SIGN IN
SIGN UP
Competitive randomized algorithms for non-uniform problems
Full Text:
PDF
Buy this Article
Authors:
Anna R. Karlin
DEC Systems Research Center, 130 Lytton Ave., Palo Alto, CA
Mark S. Manasse
DEC Systems Research Center, 130 Lytton Ave., Palo Alto, CA
Lyle A. McGeoch
Dept. of Mathematics and Computer Science, Amherst College, Amherst, MA
Susan Owicki
DEC Systems Research Center, 130 Lytton Ave., Palo Alto, CA
1990 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 50
· Downloads (cumulative): 552
· Citation Count: 32
Published in:
· Proceeding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Pages 301-309
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1990
table of contents
ISBN:0-89871-251-3
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
probabilistic computation
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder