Hervé Brönnimann

68 papers A* 4A 1B 5Journal 26Unranked 32

Year	Rank	Type	Title / Venue / Authors
2010	J	`jnl`	Managing cohort movement of mobile sensors via GPS-free and compass-free node localization. J. Parallel Distributed Comput. Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis
2010	J	`jnl`	New payload attribution methods for network forensic investigations. ACM Trans. Inf. Syst. Secur. Miroslav Ponec, Paul Giura, Joel Wein, Hervé Brönnimann
2010	—	`conf`	The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. ICMS Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann
2008	J	`jnl`	Deterministic algorithms for sampling count data. Data Knowl. Eng. Hüseyin Akcan, Alex Astashyn, Hervé Brönnimann
2008	—	`conf`	Geographic web usage estimation by monitoring DNS caches. LocWeb Hüseyin Akcan, Torsten Suel, Hervé Brönnimann
2007	J	`jnl`	A new deterministic data aggregation method for wireless sensor networks. Signal Process. Hüseyin Akcan, Hervé Brönnimann
2007	A*	`conf`	Highly efficient techniques for network forensics. CCS Miroslav Ponec, Paul Giura, Hervé Brönnimann, Joel Wein
2007	J	`jnl`	Lines Tangent to Four Triangles in Three-Dimensional Space. Discret. Comput. Geom. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
2007	J	`jnl`	Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2007	J	`jnl`	Opposite-Quadrant Depth in the Plane. Graphs Comb. Hervé Brönnimann, Jonathan Lenchner, János Pach
2006	—	`conf`	A Proposal to add Interval Arithmetic to the C++ Standard Library. Reliable Implementation of Real Number Algorithms Sylvain Pion, Hervé Brönnimann, Guillaume Melquiond
2006	J	`jnl`	Cost prediction for ray shooting in octrees. Comput. Geom. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
2006	J	`jnl`	Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
2006	B	`conf`	Deterministic Data Reduction in Sensor Networks. MASS Hüseyin Akcan, Hervé Brönnimann
2006	—	`conf`	GPS-Free node localization in mobile wireless sensor networks. MobiDE Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis
2006	J	`jnl`	Minimum-Cost Coverage of Point Sets by Disks CoRR Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
2006	—	`conf`	Minimum-cost coverage of point sets by disks. SCG Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
2006	J	`jnl`	Octrees with near optimal cost for ray-shooting. Comput. Geom. Hervé Brönnimann, Marc Glisse
2006	—	`conf`	Practical and Efficient Geometric Epsilon-Approximations. CCCG Hüseyin Akcan, Hervé Brönnimann, Robert Marini
2006	J	`jnl`	Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. Hervé Brönnimann, Timothy M. Chan
2006	J	`jnl`	The design of the Boost interval arithmetic library. Theor. Comput. Sci. Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion
2005	J	`jnl`	Cost-driven octree construction schemes: an experimental study. Comput. Geom. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
2005	—	`conf`	Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
2005	B	`conf`	Dynamic topological predicates and notifications in moving objects databases. Mobile Data Management Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann, Agnès Voisard
2005	—	`conf`	Integrating Digital Forensics in Network Infrastructures. IFIP Int. Conf. Digital Forensics Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon
2005	—	`conf`	Observations and Computations in Sylvester-Gallai Theory. CCCG Jonathan Lenchner, Hervé Brönnimann
2005	J	`jnl`	Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2004	B	`conf`	Cost-Optimal Trees for Ray Shooting. LATIN Hervé Brönnimann, Marc Glisse
2004	—	`conf`	Mission-critical management of mobile sensors: or, how to guide a flock of sensors. DMSN Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann
2004	—	`conf`	On the number of line tangents to four triangles in three-dimensional space. CCCG Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
2004	A*	`conf`	Payload attribution via hierarchical bloom filters. CCS Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon
2004	B	`conf`	Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. LATIN Hervé Brönnimann, Timothy M. Chan
2004	J	`jnl`	Space-efficient planar convex hull algorithms. Theor. Comput. Sci. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
2004	—	`conf`	String Matching on the Internet. CAAN Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram
2004	—	`conf`	The number of lines tangent to arbitrary convex polyhedra in 3D. SCG Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2004	—	`conf`	Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. JCDCG Hervé Brönnimann
2004	—	`conf`	Towards in-place geometric algorithms and data structures. SCG Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen
2003	—	`conf`	Cost-driven octree construction schemes: an experimental study. SCG Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
2003	A*	`conf`	Efficient data reduction with EASE. KDD Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter J. Haas, Peter Scheuermann
2003	—	`conf`	ForNet: A Distributed Forensics Network. MMM-ACNS Kulesh Shanmugasundaram, Nasir D. Memon, Anubhav Savant, Hervé Brönnimann
2003	A	`conf`	Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. STACS Hervé Brönnimann, Frédéric Cazals, Marianne Durand
2003	J	`jnl`	The number of transversals to line segments in R^3 CoRR Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2003	—	`conf`	Transversals to line segments in R CCCG Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2002	—	`conf`	Cost prediction for ray shooting. SCG Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
2002	—	`conf`	Cost-optimal quadtrees for ray shooting. CCCG Hervé Brönnimann, Marc Glisse, David R. Wood
2002	B	`conf`	In-Place Planar Convex Hull Algorithms. LATIN Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
2002	—	`conf`	On the number of lines tangent to four convex polyhedra. CCCG Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2001	—	`conf`	Designing and Implementing a General Purpose Halfedge Data Structure. WAE Hervé Brönnimann
2001	J	`jnl`	Interval arithmetic yields efficient dynamic filters for computational geometry. Discret. Appl. Math. Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
2000	J	`jnl`	Efficient Exact Evaluation of Signs of Determinants. Algorithmica Hervé Brönnimann, Mariette Yvinec
2000	—	`conf`	On the Number of Views of Polyhedral Scenes. JCDCG Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer
1999	J	`jnl`	Degenerate Convex Hulls On-Line in Any Fixed Dimension. Discret. Comput. Geom. Hervé Brönnimann
1999	J	`jnl`	Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
1999	J	`jnl`	Sign Determination in Residue Number Systems. Theor. Comput. Sci. Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion
1999	J	`jnl`	The union of unit balls has quadratic complexity, even if they all contain the origin CoRR Hervé Brönnimann, Olivier Devillers
1998	—	`conf`	Applications of the Generic Programming Paradigm in the Design of CGAL. Generic Programming Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp
1998	—	`conf`	Degenerate Convex Hulls On-Line in Any Fixed Dimension. SCG Hervé Brönnimann
1998	—	`conf`	Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. SCG Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
1998	J	`jnl`	Optimal slope selection via cuttings. Comput. Geom. Hervé Brönnimann, Bernard Chazelle
1997	—	`conf`	Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. SCG Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion
1997	—	`conf`	Efficient Exact Evaluation of Signs of Determinants. SCG Hervé Brönnimann, Mariette Yvinec
1995	J	`jnl`	Almost Optimal Set Covers in Finite VC-Dimension. Discret. Comput. Geom. Hervé Brönnimann, Michael T. Goodrich
1994	—	`conf`	Almost Optimal Polyhedral Separators. SCG Hervé Brönnimann
1994	—	`conf`	Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). SCG Hervé Brönnimann, Michael T. Goodrich
1994	—	`conf`	Optimal Slope Selection Via Cuttings. CCCG Hervé Brönnimann, Bernard Chazelle
1993	J	`jnl`	How Hard Is Half-Space Range Searching. Discret. Comput. Geom. Hervé Brönnimann, Bernard Chazelle, János Pach
1993	A*	`conf`	Product Range Spaces, Sensitive Sampling, and Derandomization FOCS Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
1992	—	`conf`	How Hard is Halfspace Range Searching? SCG Hervé Brönnimann, Bernard Chazelle