Randomized Data Structures for the Dynamic Closest-Pair Problem

Golin, Mordecai J.; Raman, Rajeev; Schwarz, Christian; Smid, Michiel

Local TagsRelease HistoryDetailsSummary

Randomized Data Structures for the Dynamic Closest-Pair Problem

Golin, M. J., Raman, R., Schwarz, C., & Smid, M. (1998). Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM Journal on Computing, 27(4), 1036-1072.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-37D2-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-37D3-6

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Golin, Mordecai J.¹, Author
Raman, Rajeev¹, Author
Schwarz, Christian¹, 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: 1998

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518010
Other: Local-ID: C1256428004B93B8-69F48247659586D6C1256744005BDD88-GolinRamanSchwarzSmidSIAMJCOMPUT1998

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 27 (4) Sequence Number: - Start / End Page: 1036 - 1072 Identifier: ISSN: 0097-5397