English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A Lower Bound for the Complexity of the Union-Split-Find Problem

Mehlhorn, K., Näher, S., & Alt, H. (1987). A Lower Bound for the Complexity of the Union-Split-Find Problem. In Automata, Languages and Programming (ICALP-87): 14th International Colloquium (pp. 479-488). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Näher, Stefan1, Author           
Alt, Helmut2, Author
Ottmann, Thomas, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-09-211987
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344575
Other: Local-ID: C1256428004B93B8-F4AF0F7B20E773C2C1257148003160BE-mehlhorn87
BibTex Citekey: mehlhorn1987b
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Karlsruhe, Federal Republic of Germany
Start-/End Date: 1987-07-13

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 479 - 488 Identifier: ISBN: 3-540-18088-5