de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A Lower Bound on the Complexity of the Union-Split-Find Problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45100

Näher,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Alt,  Helmut
Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K., Näher, S., & Alt, H. (1988). A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing, 17, 1093-1102.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AE7E-A
Abstract
There is no abstract available