Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms
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, Peter W. Shor
Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms
STOC, 1986.

STOC 1986
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1986-LeightonS,
	author        = "Frank Thomson Leighton and Peter W. Shor",
	booktitle     = "{Proceedings of the 18th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/12130.12140",
	isbn          = "0-89791-193-8",
	pages         = "91--103",
	publisher     = "{ACM}",
	title         = "{Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms}",
	year          = 1986,
}

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.