dblp.uni-trier.dewww.uni-trier.de

Hervé Brönnimann Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
63EEHüseyin Akcan, Torsten Suel, Hervé Brönnimann: Geographic web usage estimation by monitoring DNS caches. LocWeb 2008: 85-92
62EEHüseyin Akcan, Alex Astashyn, Hervé Brönnimann: Deterministic algorithms for sampling count data. Data Knowl. Eng. 64(2): 405-418 (2008)
2007
61EEMiroslav Ponec, Paul Giura, Hervé Brönnimann, Joel Wein: Highly efficient techniques for network forensics. ACM Conference on Computer and Communications Security 2007: 150-160
60EEHervé 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)
59EEHervé 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)
58EEHüseyin Akcan, Hervé Brönnimann: A new deterministic data aggregation method for wireless sensor networks. Signal Processing 87(12): 2965-2977 (2007)
2006
57EEHüseyin Akcan, Hervé Brönnimann, Robert Marini: Practical and Efficient Geometric Epsilon-Approximations. CCCG 2006
56EEHüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis: GPS-Free node localization in mobile wireless sensor networks. MobiDE 2006: 35-42
55EESylvain Pion, Hervé Brönnimann, Guillaume Melquiond: A Proposal to add Interval Arithmetic to the C++ Standard Library. Reliable Implementation of Real Number Algorithms 2006
54EEHelmut 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
53EEEsther 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)
52EEHervé 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)
51EEBoris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost prediction for ray shooting in octrees. Comput. Geom. 34(3): 159-181 (2006)
50EEHervé Brönnimann, Marc Glisse: Octrees with near optimal cost for ray-shooting. Comput. Geom. 34(3): 182-194 (2006)
49EEHervé 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)
48EEHervé Brönnimann, Guillaume Melquiond, Sylvain Pion: The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351(1): 111-118 (2006)
2005
47EEHervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink: Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110
46EEJonathan 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
44EEGoce Trajcevski, Peter Scheuermann, Hervé Brönnimann, Agnès Voisard: Dynamic topological predicates and notifications in moving objects databases. Mobile Data Management 2005: 77-85
43EEBoris 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)
42EEHervé 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
41EEKulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon: Payload attribution via hierarchical bloom filters. ACM Conference on Computer and Communications Security 2004: 31-41
40EEHervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram: String Matching on the Internet. CAAN 2004: 75-89
39EEHervé 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
38EEGoce Trajcevski, Peter Scheuermann, Hervé Brönnimann: Mission-critical management of mobile sensors: or, how to guide a flock of sensors. DMSN 2004: 111-118
37EEHervé Brönnimann: Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. JCDCG 2004: 54-61
36EEHervé 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
35EEHervé Brönnimann, Marc Glisse: Cost-Optimal Trees for Ray Shooting. LATIN 2004: 349-358
34EEHervé Brönnimann, Timothy M. Chan, Eric Y. Chen: Towards in-place geometric algorithms and data structures. Symposium on Computational Geometry 2004: 239-246
33EEHervé 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
32EEHervé 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
30EEHervé Brönnimann, Bin Chen, Manoranjan Dash, Peter J. Haas, Peter Scheuermann: Efficient data reduction with EASE. KDD 2003: 59-68
29EEKulesh Shanmugasundaram, Nasir D. Memon, Anubhav Savant, Hervé Brönnimann: ForNet: A Distributed Forensics Network. MMM-ACNS 2003: 1-16
28EEHervé Brönnimann, Frédéric Cazals, Marianne Durand: Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. STACS 2003: 283-294
27EEBoris 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
26EEHervé 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
25EEHervé Brönnimann, Marc Glisse, David R. Wood: Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112
24EEHervé 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
23EEHervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507
22EEBoris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost prediction for ray shooting. Symposium on Computational Geometry 2002: 293-302
2001
21EEHervé 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
19EEBoris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer: On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90
18EEHervé Brönnimann, Mariette Yvinec: Efficient Exact Evaluation of Signs of Determinants. Algorithmica 27(1): 21-56 (2000)
1999
17EEHervé Brönnimann, Olivier Devillers: The union of unit balls has quadratic complexity, even if they all contain the origin CoRR cs.CG/9907025: (1999)
16EEHervé 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)
14EEHervé 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
13EEHervé 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
12EEHervé Brönnimann, Christoph Burnikel, Sylvain Pion: Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. Symposium on Computational Geometry 1998: 165-174
11EEHervé 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
9EEHervé Brönnimann, Mariette Yvinec: Efficient Exact Evaluation of Signs of Determinants. Symposium on Computational Geometry 1997: 166-173
8EEHervé 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
5EEHervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). Symposium on Computational Geometry 1994: 293-302
4EEHervé 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
1EEHervé Brönnimann, Bernard Chazelle: How Hard is Halfspace Range Searching? Symposium on Computational Geometry 1992: 271-275

Coauthor Index

1Hüseyin Akcan [56] [57] [58] [62] [63]
2Helmut Alt [54]
3Esther M. Arkin [53] [54]
4Boris Aronov [19] [22] [27] [43] [51]
5Alex Astashyn [62]
6Christoph Burnikel [12] [20]
7Frédéric Cazals [28]
8Timothy M. Chan [34] [36] [52]
9Allen Y. Chang [22] [27] [43] [51]
10Bernard Chazelle [1] [2] [3] [6] [10] [15]
11Bin Chen [30]
12Eric Y. Chen [34]
13Yi-Jen Chiang [22] [27] [43] [51]
14Manoranjan Dash [30]
15Alex Delis [56]
16Olivier Devillers [17] [24] [33] [39] [59] [60]
17Vida Dujmovic [24] [33] [59]
18Marianne Durand [28]
19Ioannis Z. Emiris [8] [14]
20Jeff Erickson [53] [54]
21Hazel Everett [24] [26] [31] [33] [42] [59]
22Sándor P. Fekete [53] [54]
23Paul Giura [61]
24Marc Glisse [24] [25] [33] [35] [50] [59]
25Xavier Goaoc [24] [33] [59]
26Michael T. Goodrich [5] [7]
27Peter J. Haas [30]
28Dan Halperin [19]
29John Iacono [23] [32]
30Jyrki Katajainen [23] [32]
31Lutz Kettner [13] [47] [49]
32Christian Knauer [53] [54]
33Vassil Kriakov [56]
34Sylvain Lazard [24] [26] [31] [33] [39] [42] [59] [60]
35Jonathan Lenchner [46] [53] [54]
36Robert Marini [57]
37Jirí Matousek [3] [15]
38Guillaume Melquiond [48] [55]
39Nasir D. Memon [29] [40] [41] [45]
40Joseph S. B. Mitchell [53] [54]
41Pat Morin [23] [32]
42Jason Morrison [23] [32]
43Hyeon-Suk Na [24] [33] [59]
44János Pach [2]
45Victor Y. Pan [8] [14]
46Sylvain Pion [8] [12] [14] [20] [48] [55]
47Michel Pocchiola [47] [49]
48Miroslav Ponec [61]
49Anubhav Savant [29]
50Peter Scheuermann [30] [38] [44]
51Robert Schiffenbauer [19]
52Stefan Schirra [13]
53Kulesh Shanmugasundaram [29] [40] [41] [45]
54Jack Snoeyink [47] [49]
55Frank Sottile [26] [31] [39] [42] [60]
56Torsten Suel [63]
57Godfried T. Toussaint [23] [32]
58Goce Trajcevski [38] [44]
59Remco C. Veltkamp [13]
60Agnès Voisard [44]
61Joel Wein [61]
62Sue Whitesides [24] [26] [31] [33] [42] [59]
63Kim Whittlesey [53] [54]
64David R. Wood [25]
65Mariette Yvinec [9] [18]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)