Competitive randomized algorithms for nonuniform problems
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As is well known, the best possible online strategy for classical ski rental has competitive ratio of e e 1 ≈ 1 . 582.”
From Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental (2012) · cites this paper as [10]
In the citing paper
“Karlin et al. [12] designed a randomized algorithm that yields a competitive ratio of e e -1 ≈ 1 . 58 , which is also optimal.”
From Improving Online Algorithms via ML Predictions (2024) · cites this paper as [12]
Citations
Cites
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631 · cited 3×
“Thus the deterministic algorithm of Karlin et al. [ 14 ] is also optimally competitive against this adversary.”
MethodInfluentialSelf-citationFiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457 · cited 3×
“A large number of problems have been studied from this point of view, see [1]-[8] and [ 10 ]-[20].”
BackgroundResultInfluentialSelf-citationCompetitive algorithms for server problems
Manasse, M. S., McGeoch, L. A., & Sleator, D. D. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90003-w · Cited by 425 · cited 3×
“For an explanation, see [ 16 ].) Laziness implies that 0 < nl <_ "'" < n2a-i <- nza = 1. Competitive Randomized Algorithms for Nonuniform Problems 565”
BackgroundMethodInfluentialSelf-citationAn optimal on-line algorithm for metrical task system
Borodin, A., Linial, N., & Saks, M. E. (1992) · Journal of the ACM · doi:10.1145/146585.146588 · Cited by 326
On the power of randomization in on-line algorithms
Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1994) · Algorithmica · doi:10.1007/bf01294260 · Cited by 262
A strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238 · cited 2×
“They also described an algorithm that is 2Hk-competitive for all k. McGeoch and Sleator [ 18 ] later obtained an H kcompetitive algorithm for all k.”
BackgroundMethodSelf-citationNew Ressults on Server Problems
Chrobak, M., Karloof, H., Payne, T., & Vishwnathan, S. (1991) · SIAM Journal on Discrete Mathematics · doi:10.1137/0404017 · Cited by 208
An optimal online algorithm for metrical task systems
Borodin, A., Linial, N., & Saks, M. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28435 · Cited by 164
An Optimal On-Line Algorithm for K Servers on Trees
Chrobák, M., & Larmore, L. L. (1991) · SIAM Journal on Computing · doi:10.1137/0220008 · Cited by 161
Evaluating The Performance Of Four Snooping Cache Coherency Protocols
Eggers, S. J., & Katz, R. H. (1989) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/74925.74927 · Cited by 131
Memory versus randomization in on-line algorithms
Rajhavan, P., & Snir, M. (1994) · IBM Journal of Research and Development · doi:10.1147/rd.386.0683 · Cited by 119
Random walks on weighted graphs and applications to on-line algorithms
Coppersmith, D., Doyle, P. G., Raghavan, P., & Snir, M. (1993) · Journal of the ACM · doi:10.1145/174130.174131 · Cited by 90
The harmonic online K -server algorithm is competitive
Grove, E. F. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103448 · Cited by 62 · cited 1×
“Berman et al. [2] showed that the same algorithm is competitive for three servers, within a very large factor, and Grove [ 12 ] later showed that it is O(k2k)-competitive for k servers.”
BackgroundEvaluating The Performance Of Four Snooping Cache Coherency Protocols
Eggers, S. J., & Katz, R. H. (2005) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.1989.714519 · Cited by 45
Lower Bounds for Randomized k -Server and Motion-Planning Algorithms
Karloff, H. J., Rabani, Y., & Ravid, Y. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539792224838 · Cited by 29
A competitive 2-server algorithm
Irani, S., & Rubinfeld, R. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90160-j · Cited by 29
A competitive 3-server algorithm
Berman, P., Karloff, H. J., & Tardos, G. (1990) · Symposium on Discrete Algorithms · doi:10.5555/320176.320208 · Cited by 24
A New Approach to the Server Problem
Chrobak, M., & Larmore, L. L. (1991) · SIAM Journal on Discrete Mathematics · doi:10.1137/0404029 · Cited by 22
Research works printed but not linked: 1
- McGeoch, L. A. Algorithms for Two Graph Problems. Ph.D. thesis, Carnegie Mellon University, 1987.
Cited by
A survey of design techniques for system-level dynamic power management
Benini, L., Bogliolo, A., & De Micheli, G. (2000) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.845896 · Cited by 1,241
Albers, S. (2010) · Communications of the ACM · doi:10.1145/1735223.1735245 · Cited by 459
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457
Self-citationEnergy Harvesting for Structural Health Monitoring Sensor Networks
Park, G., Rosing, T., Todd, M. D., Farrar, C. R., & Hodgkiss, W. (2008) · Journal of Infrastructure Systems · doi:10.1061/(asce)1076-0342(2008)14:1(64 · Cited by 434
System-level power optimization: techniques and tools
Benini, L., & Micheli, G. D. (2000) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/335043.335044 · Cited by 405
Metadata
- Authors
- Karlin, A. R., Manasse, M. S., McGeoch, L. A., & Owicki, S.
- Affiliations
- Amherst College (US)
- Venue
- Algorithmica
- Published
- 1994-06
- Volume
- 11
- Issue
- 6
- Pages
- 542-571
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W3137684744
- Cited by
- 258
- References
- 19
- Citations by year
- 2026: 4 · 2025: 7 · 2024: 10 · 2023: 5 · 2022: 8 · 2021: 10 · 2020: 11 · 2019: 8 · 2018: 11 · 2017: 9 · 2016: 8 · 2015: 9 · 2014: 12 · 2013: 10 · 2012: 10
- FWCI
- 2.88
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithmica (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- competitive analysis, randomized online algorithms, oblivious adversary, adaptive algorithms, request sequences, performance ratio, isosceles triangles
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.