( en | de | ru )

 

Disambiguation of "Chazelle, Bernard"

Author of the publication

copydeleteadd this publication to your clipboard
The Bloomier filter: an efficient data structure for static support lookup tables

, , , and . Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, page 30--39. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Wolfdieter Bernard

Bernard Teissier

Bernard Burke

Bernard Roxel

Bernard Bueren

 

Other publications of authors with the same name

Decomposing the Boundary of a Nonconvex Polyhedron., and . Algorithmica, 17 (3): 245-265 (1997)Triangulation and shape-complexity, and . ACM Transactions on Graphics, 3 (2): 135―152 (1984)A Functional Approach to Data Structures and Its Use in Multidimensional Searching.. SIAM J. Comput., 17 (3): 427-462 (1988)Approximating the Minimum Spanning Tree Weight in Sublinear Time., , and . SIAM J. Comput., 34 (6): 1370-1379 (2005)Car-Pooling as a Data Structuring Device: The Soft Heap.. ESA, volume 1461 of Lecture Notes in Computer Science, page 35-42. Springer, (1998)Data Structures on Event Graphs., and . ESA, volume 7501 of Lecture Notes in Computer Science, page 313-324. Springer, (2012)Decomposing the Boundary of a Nonconvex Polyhedron., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 364-375. Springer, (1992)Sublinear Computing.. ESA, volume 2832 of Lecture Notes in Computer Science, page 1. Springer, (2003)The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors, and . SIAM J. Comput., 39 (1): 302-322 (2009)The soft heap: an approximate priority queue with optimal error rate.. J. ACM, 47 (6): 1012-1027 (2000)