A Reliable Randomized Algorithm for the Closest-Pair Problem
- 1 October 1997
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 25 (1), 19-51
- https://doi.org/10.1006/jagm.1997.0873
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Sorting in linear time?Published by Association for Computing Machinery (ACM) ,1995
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- Average case error estimates for the strong probable prime testMathematics of Computation, 1993
- Optimal time bounds for some proximity problems in the planeInformation Processing Letters, 1992
- Fast and reliable parallel hashingPublished by Association for Computing Machinery (ACM) ,1991
- On the power of two-point based samplingJournal of Complexity, 1989
- The generation of random numbers that are probably primeJournal of Cryptology, 1988
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Divide-and-conquer in multidimensional spacePublished by Association for Computing Machinery (ACM) ,1976