SIGN IN
SIGN UP
Competitive algorithms for on-line problems
Full Text:
PDF
Buy this Article
Authors:
Mark Manasse
DEC Systems Research Center, 130 Lytton Avenue, Palo Alto, CA
Lyle McGeoch
Department of Mathematics, Amherst College, Amherst, MA
Daniel Sleator
Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Published in:
· Proceeding
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pages 322-333
ACM
New York, NY
, USA
©1988
table of contents
ISBN:0-89791-264-0
doi>
10.1145/62212.62243
1988 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 73
· Downloads (cumulative): 890
· Citation Count: 81
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
nonnumerical algorithms and problems
theory
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