An O(n log n log log n) Algorithm for the On-line Closes Pair Problem

Schwarz, Christian; Smid, Michiel

doi:10.5555/139404.139464

Local TagsRelease HistoryDetailsSummary

An O(n log n log log n) Algorithm for the On-line Closes Pair Problem

Schwarz, C., & Smid, M. (1992). An O(n log n log log n) Algorithm for the On-line Closes Pair Problem. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 280-285). Philadelphia, USA: SIAM.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-4CA7-1 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-4CA8-0

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
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: 2005-09-16Date issued: 1992

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.5555/139404.139464
BibTex Citekey: Schwarz-Smid_SODA92

Degree: -

Event

show

hide

Title: 3rd Annual ACM-SIAM Symposium on Discrete Algorithms

Place of Event: Orlando, FL, USA

Start-/End Date: 1992-01-27

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms

Abbreviation : SODA 1992

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Philadelphia, USA : SIAM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 280 - 285 Identifier: ISBN: 978-0-89791-466-6