Hervé Brönnimann

According to our database1, Hervé Brönnimann authored at least 62 papers between 1992 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
New payload attribution methods for network forensic investigations.
ACM Trans. Inf. Syst. Secur., 2010

Managing cohort movement of mobile sensors via GPS-free and compass-free node localization.
J. Parallel Distributed Comput., 2010

The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra.
Proceedings of the Mathematical Software, 2010

2008
Deterministic algorithms for sampling count data.
Data Knowl. Eng., 2008

Geographic web usage estimation by monitoring DNS caches.
Proceedings of the First International Workshop on Location and the Web, 2008

2007
A new deterministic data aggregation method for wireless sensor networks.
Signal Process., 2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
SIAM J. Comput., 2007

Opposite-Quadrant Depth in the Plane.
Graphs Comb., 2007

Lines Tangent to Four Triangles in Three-Dimensional Space.
Discret. Comput. Geom., 2007

Highly efficient techniques for network forensics.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

2006
The design of the Boost interval arithmetic library.
Theor. Comput. Sci., 2006

Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm.
SIAM J. Comput., 2006

Minimum-Cost Coverage of Point Sets by Disks
CoRR, 2006

Octrees with near optimal cost for ray-shooting.
Comput. Geom., 2006

Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time.
Comput. Geom., 2006

Cost prediction for ray shooting in octrees.
Comput. Geom., 2006

GPS-Free node localization in mobile wireless sensor networks.
Proceedings of the Fifth ACM International Workshop on Data Engineering for Wireless and Mobile Access, 2006

Deterministic Data Reduction in Sensor Networks.
Proceedings of the IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, 2006

A Proposal to add Interval Arithmetic to the C++ Standard Library.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Practical and Efficient Geometric Epsilon-Approximations.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Transversals to Line Segments in Three-Dimensional Space.
Discret. Comput. Geom., 2005

Cost-driven octree construction schemes: an experimental study.
Comput. Geom., 2005

Dynamic topological predicates and notifications in moving objects databases.
Proceedings of the 6th International Conference on Mobile Data Management (MDM 2005), 2005

Integrating Digital Forensics in Network Infrastructures.
Proceedings of the Advances in Digital Forensics, 2005

Observations and Computations in Sylvester-Gallai Theory.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Space-efficient planar convex hull algorithms.
Theor. Comput. Sci., 2004

Cost-Optimal Trees for Ray Shooting.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Mission-critical management of mobile sensors: or, how to guide a flock of sensors.
Proceedings of the 1st Workshop on Data Management for Sensor Networks, 2004

The number of lines tangent to arbitrary convex polyhedra in 3D.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Towards in-place geometric algorithms and data structures.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Payload attribution via hierarchical bloom filters.
Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004

On the number of line tangents to four triangles in three-dimensional space.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

String Matching on the Internet.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
The number of transversals to line segments in R^3
CoRR, 2003

Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

ForNet: A Distributed Forensics Network.
Proceedings of the Computer Network Security, 2003

Efficient data reduction with EASE.
Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24, 2003

Transversals to line segments in R<sup>3</sup>.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
In-Place Planar Convex Hull Algorithms.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Cost prediction for ray shooting.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Cost-optimal quadtrees for ray shooting.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

On the number of lines tangent to four convex polyhedra.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Interval arithmetic yields efficient dynamic filters for computational geometry.
Discret. Appl. Math., 2001

Designing and Implementing a General Purpose Halfedge Data Structure.
Proceedings of the Algorithm Engineering, 2001

2000
Efficient Exact Evaluation of Signs of Determinants.
Algorithmica, 2000

On the Number of Views of Polyhedral Scenes.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
Sign Determination in Residue Number Systems.
Theor. Comput. Sci., 1999

Product Range Spaces, Sensitive Sampling, and Derandomization.
SIAM J. Comput., 1999

Degenerate Convex Hulls On-Line in Any Fixed Dimension.
Discret. Comput. Geom., 1999

The union of unit balls has quadratic complexity, even if they all contain the origin
CoRR, 1999

1998
Optimal slope selection via cuttings.
Comput. Geom., 1998

Applications of the Generic Programming Paradigm in the Design of CGAL.
Proceedings of the Generic Programming, 1998

1997
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1995
Almost Optimal Set Covers in Finite VC-Dimension.
Discret. Comput. Geom., 1995

1994
Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Almost Optimal Polyhedral Separators.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
How Hard Is Half-Space Range Searching.
Discret. Comput. Geom., 1993

1992
How Hard is Halfspace Range Searching?
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992


  Loading...