Enumerating the k closest pairs optimally

Lenhof, Hans-Peter; Smid, Michiel

Local TagsRelease HistoryDetailsSummary

Enumerating the k closest pairs optimally

Lenhof, H.-P., & Smid, M. (1992). Enumerating the k closest pairs optimally. In 33rd Annual Symposium on Foundations of Computer Science (FOCS92) (pp. 380-386). Los Alamitos: IEEE.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE0A-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE0B-E

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Lenhof, Hans-Peter¹, Author
Smid, Michiel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Published in Print: 1992

Publication Status: Published in print

Pages: -

Publishing info: Los Alamitos : IEEE

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 517885
Other: Local-ID: C1256428004B93B8-EF831E6402AB3736C12564610049782C-Lenhof-Smid-2-92

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Pittsburgh, Pennsylvania, USA

Start-/End Date: 1992

Legal Case

show

Project information

show

Source 1

show

hide

Title: 33rd Annual Symposium on Foundations of Computer Science (FOCS92)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Los Alamitos : IEEE

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 380 - 386 Identifier: -