Maintaining the minimal distance of a point set in polylogarithmic time 
(revised version)

Smid, Michiel

Local TagsRelease HistoryDetailsSummary

Maintaining the minimal distance of a point set in polylogarithmic time (revised version)

Smid, M.(1991). Maintaining the minimal distance of a point set in polylogarithmic time (revised version) (MPI-I-91-103). Saarbrücken: Max-Planck-Institut für Informatik.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-7B00-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-95EC-3

Genre: Report

Files

show Files

hide Files

:

MPI-I-91-103.pdf (Any fulltext), 10MB

View Save

File Permalink:
https://hdl.handle.net/11858/00-001M-0000-002D-95ED-1

Name:
MPI-I-91-103.pdf

Description:
-

OA-Status:

Visibility:
Public

MIME-Type / Checksum:
application/pdf / [MD5]

Technical Metadata:

View

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Smid, Michiel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

Abstract: A dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-dimensional

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1991

Publication Status: Issued

Pages: 17 p.

Publishing info: Saarbrücken : Max-Planck-Institut für Informatik

Table of Contents: -

Rev. Type: -

Identifiers: Report Nr.: MPI-I-91-103
BibTex Citekey: Smid91c

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Research Report / Max-Planck-Institut für Informatik

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -