2008 | ||
---|---|---|
63 | Hüseyin Akcan, Torsten Suel, Hervé Brönnimann: Geographic web usage estimation by monitoring DNS caches. LocWeb 2008: 85-92 | |
62 | Hüseyin Akcan, Alex Astashyn, Hervé Brönnimann: Deterministic algorithms for sampling count data. Data Knowl. Eng. 64(2): 405-418 (2008) | |
2007 | ||
61 | Miroslav Ponec, Paul Giura, Hervé Brönnimann, Joel Wein: Highly efficient techniques for network forensics. ACM Conference on Computer and Communications Security 2007: 150-160 | |
60 | Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile: Lines Tangent to Four Triangles in Three-Dimensional Space. Discrete & Computational Geometry 37(3): 369-380 (2007) | |
59 | 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) | |
58 | Hüseyin Akcan, Hervé Brönnimann: A new deterministic data aggregation method for wireless sensor networks. Signal Processing 87(12): 2965-2977 (2007) | |
2006 | ||
57 | Hüseyin Akcan, Hervé Brönnimann, Robert Marini: Practical and Efficient Geometric Epsilon-Approximations. CCCG 2006 | |
56 | Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis: GPS-Free node localization in mobile wireless sensor networks. MobiDE 2006: 35-42 | |
55 | 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 | |
54 | 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. Symposium on Computational Geometry 2006: 449-458 | |
53 | 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) | |
52 | 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) | |
51 | 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) | |
50 | Hervé Brönnimann, Marc Glisse: Octrees with near optimal cost for ray-shooting. Comput. Geom. 34(3): 182-194 (2006) | |
49 | 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) | |
48 | Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion: The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351(1): 111-118 (2006) | |
2005 | ||
47 | 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 | |
46 | Jonathan Lenchner, Hervé Brönnimann: Observations and Computations in Sylvester-Gallai Theory. CCCG 2005: 57-60 | |
45 | Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon: Integrating Digital Forensics in Network Infrastructures. IFIP Int. Conf. Digital Forensics 2005: 127-140 | |
44 | 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 | |
43 | 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) | |
42 | Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: Transversals to Line Segments in Three-Dimensional Space. Discrete & Computational Geometry 34(3): 381-390 (2005) | |
2004 | ||
41 | Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon: Payload attribution via hierarchical bloom filters. ACM Conference on Computer and Communications Security 2004: 31-41 | |
40 | Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram: String Matching on the Internet. CAAN 2004: 75-89 | |
39 | 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 | |
38 | 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 | |
37 | Hervé Brönnimann: Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. JCDCG 2004: 54-61 | |
36 | 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 | |
35 | Hervé Brönnimann, Marc Glisse: Cost-Optimal Trees for Ray Shooting. LATIN 2004: 349-358 | |
34 | Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen: Towards in-place geometric algorithms and data structures. Symposium on Computational Geometry 2004: 239-246 | |
33 | 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. Symposium on Computational Geometry 2004: 46-55 | |
32 | 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) | |
2003 | ||
31 | Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: Transversals to line segments in R3. CCCG 2003: 174-177 | |
30 | Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter J. Haas, Peter Scheuermann: Efficient data reduction with EASE. KDD 2003: 59-68 | |
29 | Kulesh Shanmugasundaram, Nasir D. Memon, Anubhav Savant, Hervé Brönnimann: ForNet: A Distributed Forensics Network. MMM-ACNS 2003: 1-16 | |
28 | Hervé Brönnimann, Frédéric Cazals, Marianne Durand: Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. STACS 2003: 283-294 | |
27 | Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost-driven octree construction schemes: an experimental study. Symposium on Computational Geometry 2003: 227-236 | |
26 | 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 | ||
25 | Hervé Brönnimann, Marc Glisse, David R. Wood: Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112 | |
24 | 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 | |
23 | Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507 | |
22 | Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost prediction for ray shooting. Symposium on Computational Geometry 2002: 293-302 | |
2001 | ||
21 | Hervé Brönnimann: Designing and Implementing a General Purpose Halfedge Data Structure. Algorithm Engineering 2001: 51-66 | |
20 | Hervé Brönnimann, Christoph Burnikel, Sylvain Pion: Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Applied Mathematics 109(1-2): 25-47 (2001) | |
2000 | ||
19 | Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer: On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90 | |
18 | Hervé Brönnimann, Mariette Yvinec: Efficient Exact Evaluation of Signs of Determinants. Algorithmica 27(1): 21-56 (2000) | |
1999 | ||
17 | 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) | |
16 | Hervé Brönnimann: Degenerate Convex Hulls On-Line in Any Fixed Dimension. Discrete & Computational Geometry 22(4): 527-545 (1999) | |
15 | Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999) | |
14 | 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) | |
1998 | ||
13 | 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 | |
12 | Hervé Brönnimann, Christoph Burnikel, Sylvain Pion: Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. Symposium on Computational Geometry 1998: 165-174 | |
11 | Hervé Brönnimann: Degenerate Convex Hulls On-Line in Any Fixed Dimension. Symposium on Computational Geometry 1998: 249-258 | |
10 | Hervé Brönnimann, Bernard Chazelle: Optimal slope selection via cuttings. Comput. Geom. 10(1): 23-29 (1998) | |
1997 | ||
9 | Hervé Brönnimann, Mariette Yvinec: Efficient Exact Evaluation of Signs of Determinants. Symposium on Computational Geometry 1997: 166-173 | |
8 | Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion: Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. Symposium on Computational Geometry 1997: 174-182 | |
1995 | ||
7 | Hervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension. Discrete & Computational Geometry 14(4): 463-479 (1995) | |
1994 | ||
6 | Hervé Brönnimann, Bernard Chazelle: Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103 | |
5 | Hervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). Symposium on Computational Geometry 1994: 293-302 | |
4 | Hervé Brönnimann: Almost Optimal Polyhedral Separators. Symposium on Computational Geometry 1994: 393-394 | |
1993 | ||
3 | Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization FOCS 1993: 400-409 | |
2 | Hervé Brönnimann, Bernard Chazelle, János Pach: How Hard Is Half-Space Range Searching. Discrete & Computational Geometry 10: 143-155 (1993) | |
1992 | ||
1 | Hervé Brönnimann, Bernard Chazelle: How Hard is Halfspace Range Searching? Symposium on Computational Geometry 1992: 271-275 |