and (1993)

by Martin Dietzfelbinger , Torben Hagerup , Jyrki Katajainen , Martti Penttonen

Active Bibliography

8 Delaunay Triangulations in O(sort(n)) Time and More – Kevin Buchin, Wolfgang Mulzer
10 Randomized Data Structures for the Dynamic Closest-Pair Problem – Mordecai Golin, Rajeev Raman, Christian Schwarz, Michiel Smid - 1993
25 On Parallel Hashing and Integer Sorting – Yossi Matias, Uzi Vishkin - 1991
41 Improved Parallel Integer Sorting without Concurrent Writing – Susanne Albers, Torben Hagerup - 1992
65 Closest-Point Problems in Computational Geometry – Michiel Smid - 1997
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
Low-Entropy Computational Geometry – Wolfgang Johann Heinrich Mulzer - 2010
193 Programming Parallel Algorithms – Guy E. Blelloch - 1996
8 Lower Bounds for Fundamental Geometric Problems – Jeffrey Gordon Erickson - 1996
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
9 Linear Hash Functions – Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos - 1999
7 Minimizing Randomness in Minimum Spanning Tree, Parallel Connectivity, and Set Maxima Algorithms – Seth Pettie, Vijaya Ramachandran - 2001
57 Exact and Approximate Distances in Graphs - a survey – Uri Zwick - 2001
Cryptographic Primitives – Paul Garrett - 2007
38 Efficient External-Memory Data Structures and Applications – Lars Arge - 1996
3 Further investigations with the strong probable prime test – Ronald Joseph Burthe - 1996
Arne Andersson – Arne Andersson, Torben Hagerup, Stefan Nilsson
86 Sorting in Linear Time? – Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman - 1995
MO419 – Probabilistic Algorithms – Flávio K. Miyazawa – IC/UNICAMP 2010 A survey on Probabilistic Algorithms to Primality Test – Marcio Machado, Pereira Ra, Marco Alves, Ganhoto Ra