English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Journal Article

Simple randomized algorithms for closest pair problems

MPS-Authors
/persons/resource/persons44509

Golin,  Mordecai J.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45250

Raman,  Rajeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45433

Schwarz,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Golin, M. J., Raman, R., Schwarz, C., & Smid, M. (1995). Simple randomized algorithms for closest pair problems. Nordic Journal of Computing, 2(-), 3-27.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ACC7-3
Abstract
There is no abstract available