A Lower Bound for the Complexity of the Union-Split-Find Problem
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Kurt Mehlhorn, Stefan Näher, Helmut Alt
A Lower Bound for the Complexity of the Union-Split-Find Problem
ICALP, 1987.

ICALP 1987
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-1987-MehlhornNA,
	author        = "Kurt Mehlhorn and Stefan Näher and Helmut Alt",
	booktitle     = "{Proceedings of the 14th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-18088-5_41",
	isbn          = "3-540-18088-5",
	pages         = "479--488",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{A Lower Bound for the Complexity of the Union-Split-Find Problem}",
	volume        = 267,
	year          = 1987,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.