( en | de | ru )

 

Disambiguation of "Chazelle, Bernard"

Author of the publication

copydeleteadd this publication to your clipboard
A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity

. J. ACM, 47 (6): 1028--1047 (2000)
DOI: 10.1145/355541.355562

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.

Bernard Burke

Bernard Bueren

Bernard Schröer

Christoph Bernard

Wolfdieter Bernard

 

Other publications of authors with the same name

A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications., , , and . ICALP, volume 372 of Lecture Notes in Computer Science, page 179-193. Springer, (1989)Ushering in a New Era of Algorithm Design.. ICALP, volume 4596 of Lecture Notes in Computer Science, page 1. Springer, (2007)Approximating the Minimum Spanning Tree Weight in Sublinear Time., , and . SIAM J. Comput., 34 (6): 1370-1379 (2005)Convex Decompositions of Polyhedra. STOC, page 70-79. ACM, (1981)A Model of Computation for VLSI with Related Complexity Results, and . STOC, page 318-325. ACM, (1981)Sublinear geometric algorithms., , and . STOC, page 531-540. ACM, (2003)Lower bounds for linear degeneracy testing., and . STOC, page 554-560. ACM, (2004)The soft heap: an approximate priority queue with optimal error rate.. J. ACM, 47 (6): 1012-1027 (2000)Car-Pooling as a Data Structuring Device: The Soft Heap.. ESA, volume 1461 of Lecture Notes in Computer Science, page 35-42. Springer, (1998)A Reflective Symmetry Descriptor., , , , and . ECCV (2), volume 2351 of Lecture Notes in Computer Science, page 642-656. Springer, (2002)