( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Ushering in a New Era of Algorithm Design.

. ICALP, том 4596 из Lecture Notes in Computer Science, стр. 1. Springer, (2007)

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.

Dirk Bernard

Bernard Broermann

Bernard Willkofer

Bernard Andreae

Bernard Schmidtmann

 

Другие публикации лиц с тем же именем

Technical perspective: finding a good neighbor, near and fast.. Commun. ACM, 51 (1): 115 (2008)Natural algorithms and influence systems.. Commun. ACM, 55 (12): 101-110 (2012)A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube., , , и . STOC, стр. 305-311. ACM, (1999)Computational geometry: a retrospective.. STOC, стр. 75-94. ACM, (1994)Intersecting Is Easier than Sorting. STOC, стр. 125-134. ACM, (1984)Fractional Cascading: I. A Data Structuring Technique., и . Algorithmica, 1 (2): 133-162 (1986)Computing the Largest Empty Rectangle., , и . STACS, том 166 из Lecture Notes in Computer Science, стр. 43-54. Springer, (1984)How to Search in History.. FCT, том 158 из Lecture Notes in Computer Science, стр. 52-63. Springer, (1983)Polytope Range Searching and Integral Geometry (Extended Abstract). FOCS, стр. 1-10. IEEE Computer Society, (1987)Data Structures on Event Graphs., и . Algorithmica, 71 (4): 1007-1020 (2015)