English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  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 & Applications, 5(3), 273-288.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Lenhof, Hans-Peter1, Author           
Smid, Michiel1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 517882
Other: Local-ID: C1256428004B93B8-E8FB9FE93308051FC125645A004D482A-Lenhof-Smid-2-95
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: International Journal of Computational Geometry & Applications
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 5 (3) Sequence Number: - Start / End Page: 273 - 288 Identifier: -