The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hervé Brönnimann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hervé Brönnimann, Michael T. Goodrich
    Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:293-302 [Conf]
  2. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
    Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:98-110 [Conf]
  3. Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram
    String Matching on the Internet. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:75-89 [Conf]
  4. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    On the number of lines tangent to four convex polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  5. Hervé Brönnimann, Bernard Chazelle
    Optimal Slope Selection Via Cuttings. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:99-103 [Conf]
  6. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
    On the number of line tangents to four triangles in three-dimensional space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:184-187 [Conf]
  7. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to line segments in R3. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:174-177 [Conf]
  8. Hervé Brönnimann, Marc Glisse, David R. Wood
    Cost-optimal quadtrees for ray shooting. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:109-112 [Conf]
  9. Jonathan Lenchner, Hervé Brönnimann
    Observations and Computations in Sylvester-Gallai Theory. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:57-60 [Conf]
  10. Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon
    Payload attribution via hierarchical bloom filters. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2004, pp:31-41 [Conf]
  11. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost prediction for ray shooting. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:293-302 [Conf]
  12. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost-driven octree construction schemes: an experimental study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:227-236 [Conf]
  13. Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
    Minimum-cost coverage of point sets by disks. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:449-458 [Conf]
  14. Hervé Brönnimann
    Almost Optimal Polyhedral Separators. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:393-394 [Conf]
  15. Hervé Brönnimann
    Degenerate Convex Hulls On-Line in Any Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:249-258 [Conf]
  16. Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
    Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:165-174 [Conf]
  17. Hervé Brönnimann, Bernard Chazelle
    How Hard is Halfspace Range Searching? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:271-275 [Conf]
  18. Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen
    Towards in-place geometric algorithms and data structures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:239-246 [Conf]
  19. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    The number of lines tangent to arbitrary convex polyhedra in 3D. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  20. Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion
    Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:174-182 [Conf]
  21. Hervé Brönnimann, Mariette Yvinec
    Efficient Exact Evaluation of Signs of Determinants. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:166-173 [Conf]
  22. Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp
    Applications of the Generic Programming Paradigm in the Design of CGAL. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 1998, pp:206-217 [Conf]
  23. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
    Product Range Spaces, Sensitive Sampling, and Derandomization [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:400-409 [Conf]
  24. Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon
    Integrating Digital Forensics in Network Infrastructures. [Citation Graph (0, 0)][DBLP]
    IFIP Int. Conf. Digital Forensics, 2005, pp:127-140 [Conf]
  25. Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer
    On the Number of Views of Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:81-90 [Conf]
  26. Hervé Brönnimann
    Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:54-61 [Conf]
  27. Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter J. Haas, Peter Scheuermann
    Efficient data reduction with EASE. [Citation Graph (0, 0)][DBLP]
    KDD, 2003, pp:59-68 [Conf]
  28. Hervé Brönnimann, Timothy M. Chan
    Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:162-171 [Conf]
  29. Hervé Brönnimann, Marc Glisse
    Cost-Optimal Trees for Ray Shooting. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:349-358 [Conf]
  30. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    In-Place Planar Convex Hull Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:494-507 [Conf]
  31. Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann, Agnès Voisard
    Dynamic topological predicates and notifications in moving objects databases. [Citation Graph (0, 0)][DBLP]
    Mobile Data Management, 2005, pp:77-85 [Conf]
  32. Kulesh Shanmugasundaram, Nasir D. Memon, Anubhav Savant, Hervé Brönnimann
    ForNet: A Distributed Forensics Network. [Citation Graph (0, 0)][DBLP]
    MMM-ACNS, 2003, pp:1-16 [Conf]
  33. Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis
    GPS-Free node localization in mobile wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    MobiDE, 2006, pp:35-42 [Conf]
  34. Hervé Brönnimann, Frédéric Cazals, Marianne Durand
    Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:283-294 [Conf]
  35. Hervé Brönnimann
    Designing and Implementing a General Purpose Halfedge Data Structure. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:51-66 [Conf]
  36. Hervé Brönnimann, Mariette Yvinec
    Efficient Exact Evaluation of Signs of Determinants. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:1, pp:21-56 [Journal]
  37. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost-driven octree construction schemes: an experimental study. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:127-148 [Journal]
  38. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost prediction for ray shooting in octrees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:3, pp:159-181 [Journal]
  39. Hervé Brönnimann, Timothy M. Chan
    Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:75-82 [Journal]
  40. Hervé Brönnimann, Bernard Chazelle
    Optimal slope selection via cuttings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:23-29 [Journal]
  41. Hervé Brönnimann, Marc Glisse
    Octrees with near optimal cost for ray-shooting. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:3, pp:182-194 [Journal]
  42. Hervé Brönnimann, Olivier Devillers
    The union of unit balls has quadratic complexity, even if they all contain the origin [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  43. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    The number of transversals to line segments in R^3 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  44. Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
    Interval arithmetic yields efficient dynamic filters for computational geometry. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:25-47 [Journal]
  45. Hervé Brönnimann
    Degenerate Convex Hulls On-Line in Any Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:527-545 [Journal]
  46. Hervé Brönnimann, Bernard Chazelle, János Pach
    How Hard Is Half-Space Range Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:143-155 [Journal]
  47. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to Line Segments in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:381-390 [Journal]
  48. Hervé Brönnimann, Michael T. Goodrich
    Almost Optimal Set Covers in Finite VC-Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:463-479 [Journal]
  49. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
    Product Range Spaces, Sensitive Sampling, and Derandomization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1552-1575 [Journal]
  50. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
    Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:721-739 [Journal]
  51. Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion
    Sign Determination in Residue Number Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:1, pp:173-197 [Journal]
  52. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    Space-efficient planar convex hull algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:25-40 [Journal]
  53. Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion
    The design of the Boost interval arithmetic library. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:1, pp:111-118 [Journal]
  54. Hüseyin Akcan, Hervé Brönnimann, Robert Marini
    Practical and Efficient Geometric Epsilon-Approximations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  55. Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
    Minimum-Cost Coverage of Point Sets by Disks [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  56. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
    Lines Tangent to Four Triangles in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:369-380 [Journal]
  57. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]
  58. Hüseyin Akcan, Hervé Brönnimann
    A new deterministic data aggregation method for wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    Signal Processing, 2007, v:87, n:12, pp:2965-2977 [Journal]

  59. Highly efficient techniques for network forensics. [Citation Graph (, )][DBLP]


  60. A Proposal to add Interval Arithmetic to the C++ Standard Library. [Citation Graph (, )][DBLP]


  61. The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. [Citation Graph (, )][DBLP]


  62. Geographic web usage estimation by monitoring DNS caches. [Citation Graph (, )][DBLP]


  63. Mission-critical management of mobile sensors: or, how to guide a flock of sensors. [Citation Graph (, )][DBLP]


  64. Deterministic algorithms for sampling count data. [Citation Graph (, )][DBLP]


Search in 0.101secs, Finished in 0.105secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002