Sequential and Parallel Algorithms for the k Closest Pairs Problem

Lenhof, Hans-Peter; Smid, Michiel

doi:10.1142/S0218195995000167

Local TagsRelease HistoryDetailsSummary

Sequential and Parallel Algorithms for the k Closest Pairs Problem

Lenhof, H.-P., & Smid, M. (1995). Sequential and Parallel Algorithms for the k Closest Pairs Problem. International Journal of Computational Geometry and Applications, 5(3), 273-288. doi:10.1142/S0218195995000167.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACC3-B Version Permalink: https://hdl.handle.net/21.11116/0000-000E-55C4-5

Genre: Journal Article

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-02Date issued: 1995

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517882
Other: Local-ID: C1256428004B93B8-E8FB9FE93308051FC125645A004D482A-Lenhof-Smid-2-95
DOI: 10.1142/S0218195995000167
BibTex Citekey: Lenhof-Smid_IJCGA95

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: International Journal of Computational Geometry and Applications

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Singapore : World Scientific

Pages: - Volume / Issue: 5 (3) Sequence Number: - Start / End Page: 273 - 288 Identifier: ISSN: 0218-1959
CoNE: https://pure.mpg.de/cone/journals/resource/954925493943