Tight(er) worst-case bounds on dynamic searching and priority queues
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

Arne Andersson, Mikkel Thorup
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC, 2000.

STOC 2000
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2000-AnderssonT,
	author        = "Arne Andersson and Mikkel Thorup",
	booktitle     = "{Proceedings of the 32nd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/335305.335344",
	isbn          = "1-58113-184-4",
	pages         = "335--342",
	publisher     = "{ACM}",
	title         = "{Tight(er) worst-case bounds on dynamic searching and priority queues}",
	year          = 2000,
}

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.