Tight Bounds on the Complexity of Parallel Sorting
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

Frank Thomson Leighton
Tight Bounds on the Complexity of Parallel Sorting
STOC, 1984.

STOC 1984
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1984-Leighton,
	author        = "Frank Thomson Leighton",
	booktitle     = "{Proceedings of the 16th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/800057.808667",
	pages         = "71--80",
	publisher     = "{ACM}",
	title         = "{Tight Bounds on the Complexity of Parallel Sorting}",
	year          = 1984,
}

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.