Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Hans-Peter Lenhof, Michiel H. M. Smid. Enumerating the k Closest Pairs Optimally. In 33rd Annual Symposium on Foundations of Computer Science, 24-27 October 1992, Pittsburgh, Pennsylvania, USA. pages 380-386, IEEE, 1992.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Sequential and parallel algorithms for the k closest pairs problemHans-Peter Lenhof, Michiel H. M. Smid. ijcga, 5(3):273-288, 1995. An Optimal Algorithm for the On-Line Closest-Pair ProblemChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink. compgeom 1992: 330-336 [doi] An Optimal Algorithm for the On-Line Closest-Pair ProblemChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink. algorithmica, 12(1):18-29, 1994.
The following publications are possibly variants of this publication: