Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ
Home Search Quick Search Advanced Fulltext Browse Collections Persons My eDoc Session History Login Name: Password: Documentation Help Support Wiki Direct access to document ID:	Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents ID: 517840.0, MPI für Informatik / Algorithms and Complexity Group A reliable randomized algorithm for the closest-pair problem Authors: Dietzfelbinger, Martin; Hagerup, Torben; Katajainen, Jyrki; Penttonen, Martti Language: English Date of Publication (YYYY-MM-DD): 1997 Title of Journal: Journal of Algorithms Volume: 25 Issue / Number: 1 Start Page: 19 End Page: 51 Review Status: Peer-review Audience: Experts Only Intended Educational Use: No Last Change of the Resource (YYYY-MM-DD): 2010-03-02 External Publication Status: published Document Type: Article Communicated by: Kurt Mehlhorn Affiliations: MPI für Informatik/Algorithms and Complexity Group Identifiers: LOCALID:C1256428004B93B8-B94D7DB3C4A7825DC12564840050BDED-... The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.