default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHervé Brönnimann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j23]Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis:
Managing cohort movement of mobile sensors via GPS-free and compass-free node localization. J. Parallel Distributed Comput. 70(7): 743-757 (2010)- [j22]Miroslav Ponec, Paul Giura, Joel Wein, Hervé Brönnimann:
New payload attribution methods for network forensic investigations. ACM Trans. Inf. Syst. Secur. 13(2): 15:1-15:32 (2010) - [c41]Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann:
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. ICMS 2010: 121-141
2000 – 2009
- 2008
- [j21]Hüseyin Akcan, Alex Astashyn, Hervé Brönnimann:
Deterministic algorithms for sampling count data. Data Knowl. Eng. 64(2): 405-418 (2008) - [c40]Hüseyin Akcan, Torsten Suel, Hervé Brönnimann:
Geographic web usage estimation by monitoring DNS caches. LocWeb 2008: 85-92 - 2007
- [j20]Hervé Brönnimann, Olivier Devillers
, Sylvain Lazard, Frank Sottile:
Lines Tangent to Four Triangles in Three-Dimensional Space. Discret. Comput. Geom. 37(3): 369-380 (2007) - [j19]Hervé Brönnimann, Jonathan Lenchner, János Pach:
Opposite-Quadrant Depth in the Plane. Graphs Comb. 23(Supplement-1): 145-152 (2007) - [j18]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. SIAM J. Comput. 37(2): 522-551 (2007) - [j17]Hüseyin Akcan, Hervé Brönnimann:
A new deterministic data aggregation method for wireless sensor networks. Signal Process. 87(12): 2965-2977 (2007) - [c39]Miroslav Ponec, Paul Giura, Hervé Brönnimann, Joel Wein:
Highly efficient techniques for network forensics. CCS 2007: 150-160 - 2006
- [j16]Hervé Brönnimann, Timothy M. Chan:
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34(2): 75-82 (2006) - [j15]Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost prediction for ray shooting in octrees. Comput. Geom. 34(3): 159-181 (2006) - [j14]Hervé Brönnimann, Marc Glisse:
Octrees with near optimal cost for ray-shooting. Comput. Geom. 34(3): 182-194 (2006) - [j13]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36(3): 721-739 (2006) - [j12]Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion:
The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351(1): 111-118 (2006) - [c38]Hüseyin Akcan, Hervé Brönnimann, Robert Marini:
Practical and Efficient Geometric Epsilon-Approximations. CCCG 2006 - [c37]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. SCG 2006: 449-458 - [c36]Hüseyin Akcan, Hervé Brönnimann:
Deterministic Data Reduction in Sensor Networks. MASS 2006: 530-533 - [c35]Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis:
GPS-Free node localization in mobile wireless sensor networks. MobiDE 2006: 35-42 - [i4]Sylvain Pion, Hervé Brönnimann, Guillaume Melquiond:
A Proposal to add Interval Arithmetic to the C++ Standard Library. Reliable Implementation of Real Number Algorithms 2006 - [i3]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. CoRR abs/cs/0604008 (2006) - 2005
- [j11]Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost-driven octree construction schemes: an experimental study. Comput. Geom. 31(1-2): 127-148 (2005) - [j10]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34(3): 381-390 (2005) - [c34]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110 - [c33]Jonathan Lenchner, Hervé Brönnimann:
Observations and Computations in Sylvester-Gallai Theory. CCCG 2005: 57-60 - [c32]Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon:
Integrating Digital Forensics in Network Infrastructures. IFIP Int. Conf. Digital Forensics 2005: 127-140 - [c31]Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann, Agnès Voisard:
Dynamic topological predicates and notifications in moving objects databases. Mobile Data Management 2005: 77-85 - 2004
- [j9]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004) - [c30]Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram:
String Matching on the Internet. CAAN 2004: 75-89 - [c29]Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile:
On the number of line tangents to four triangles in three-dimensional space. CCCG 2004: 184-187 - [c28]Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon:
Payload attribution via hierarchical bloom filters. CCS 2004: 31-41 - [c27]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. SCG 2004: 46-55 - [c26]Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen:
Towards in-place geometric algorithms and data structures. SCG 2004: 239-246 - [c25]Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann:
Mission-critical management of mobile sensors: or, how to guide a flock of sensors. DMSN 2004: 111-118 - [c24]Hervé Brönnimann:
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. JCDCG 2004: 54-61 - [c23]Hervé Brönnimann, Timothy M. Chan:
Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. LATIN 2004: 162-171 - [c22]Hervé Brönnimann, Marc Glisse:
Cost-Optimal Trees for Ray Shooting. LATIN 2004: 349-358 - 2003
- [c21]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to line segments in R3. CCCG 2003: 174-177 - [c20]Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost-driven octree construction schemes: an experimental study. SCG 2003: 227-236 - [c19]Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter J. Haas, Peter Scheuermann:
Efficient data reduction with EASE. KDD 2003: 59-68 - [c18]Kulesh Shanmugasundaram, Nasir D. Memon, Anubhav Savant, Hervé Brönnimann:
ForNet: A Distributed Forensics Network. MMM-ACNS 2003: 1-16 - [c17]Hervé Brönnimann, Frédéric Cazals, Marianne Durand:
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. STACS 2003: 283-294 - [i2]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
The number of transversals to line segments in R^3. CoRR math.MG/0306401 (2003) - 2002
- [c16]Hervé Brönnimann, Marc Glisse, David R. Wood:
Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112 - [c15]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. CCCG 2002: 113-117 - [c14]Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost prediction for ray shooting. SCG 2002: 293-302 - [c13]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507 - 2001
- [j8]Hervé Brönnimann, Christoph Burnikel, Sylvain Pion:
Interval arithmetic yields efficient dynamic filters for computational geometry. Discret. Appl. Math. 109(1-2): 25-47 (2001) - [c12]Hervé Brönnimann:
Designing and Implementing a General Purpose Halfedge Data Structure. WAE 2001: 51-66 - 2000
- [j7]Hervé Brönnimann, Mariette Yvinec:
Efficient Exact Evaluation of Signs of Determinants. Algorithmica 27(1): 21-56 (2000) - [c11]Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer:
On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90
1990 – 1999
- 1999
- [j6]Hervé Brönnimann:
Degenerate Convex Hulls On-Line in Any Fixed Dimension. Discret. Comput. Geom. 22(4): 527-545 (1999) - [j5]Hervé Brönnimann, Bernard Chazelle, Jirí Matousek:
Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999) - [j4]Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion:
Sign Determination in Residue Number Systems. Theor. Comput. Sci. 210(1): 173-197 (1999) - [i1]Hervé Brönnimann, Olivier Devillers:
The union of unit balls has quadratic complexity, even if they all contain the origin. CoRR cs.CG/9907025 (1999) - 1998
- [j3]Hervé Brönnimann, Bernard Chazelle:
Optimal slope selection via cuttings. Comput. Geom. 10(1): 23-29 (1998) - [c10]Hervé Brönnimann, Christoph Burnikel, Sylvain Pion:
Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. SCG 1998: 165-174 - [c9]Hervé Brönnimann:
Degenerate Convex Hulls On-Line in Any Fixed Dimension. SCG 1998: 249-258 - [c8]Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp:
Applications of the Generic Programming Paradigm in the Design of CGAL. Generic Programming 1998: 206-217 - 1997
- [c7]Hervé Brönnimann, Mariette Yvinec:
Efficient Exact Evaluation of Signs of Determinants. SCG 1997: 166-173 - [c6]Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion:
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. SCG 1997: 174-182 - 1995
- [j2]Hervé Brönnimann, Michael T. Goodrich:
Almost Optimal Set Covers in Finite VC-Dimension. Discret. Comput. Geom. 14(4): 463-479 (1995) - 1994
- [c5]Hervé Brönnimann, Bernard Chazelle:
Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103 - [c4]Hervé Brönnimann, Michael T. Goodrich:
Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). SCG 1994: 293-302 - [c3]Hervé Brönnimann:
Almost Optimal Polyhedral Separators. SCG 1994: 393-394 - 1993
- [j1]Hervé Brönnimann, Bernard Chazelle, János Pach:
How Hard Is Half-Space Range Searching. Discret. Comput. Geom. 10: 143-155 (1993) - [c2]Hervé Brönnimann, Bernard Chazelle, Jirí Matousek:
Product Range Spaces, Sensitive Sampling, and Derandomization. FOCS 1993: 400-409 - 1992
- [c1]Hervé Brönnimann, Bernard Chazelle:
How Hard is Halfspace Range Searching? SCG 1992: 271-275
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
