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
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
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Buchbinder, N., & (Seffi) Naor, J. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982179 · Cited by 260
Software strategies for portable computer energy management
Lorch, J. R., & Smith, A. J. (1998) · IEEE Personal Communications · doi:10.1109/98.683740 · Cited by 273
Koutsoupias, E., & Papadimitriou, C. H. (1995) · Journal of the ACM · doi:10.1145/210118.210128 · Cited by 240
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Buchbinder, N., & (Seffi) Naor, J. (2009) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000024 · Cited by 220
Dynamic power management for portable systems
Simunic, T., Benini, L., Glynn, P., & De Micheli, G. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345914 · Cited by 217
Simunic, T., Benini, L., Glynn, P. W., & Micheli, G. D. (2001) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.931003 · Cited by 196
Comparing system level power management policies
Lu, Y.-H., & Micheli, G. D. (2001) · IEEE Design & Test of Computers · doi:10.1109/54.914592 · Cited by 171
Adaptive computation offloading for energy conservation on battery-powered systems
Xian, C., Lu, Y.-H., & Li, Z. (2007) · 2007 International Conference on Parallel and Distributed Systems · doi:10.1109/icpads.2007.4447724 · Cited by 149
Dynamic power management for nonstationary service requests
Chung, E.-Y., Benini, L., Bogliolo, A., Lu, Y.-H., & Micheli, G. D. (2002) · IEEE Transactions on Computers · doi:10.1109/tc.2002.1047758 · Cited by 148
Quantitative comparison of power management algorithms
Lu, Y.-H., Chung, E.-Y., Simunic, T., Benini, L., & Micheli, G. D. (2000) · Design, Automation, and Test in Europe · doi:10.1145/343647.343688 · Cited by 146
Utilizing Predictors for Efficient Thermal Management in Multiprocessor SoCs
Coskun, A. K., Simunic, T., & Gross, K. C. (2009) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2009.2026357 · Cited by 136
Operating-system directed power reduction
Lu, Y.-H., Benini, L., & Micheli, G. D. (2000) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1109/lpe.2000.155250 · Cited by 124
Greener, Energy-Efficient and Sustainable Networks: State-Of-The-Art and New Trends
Lörincz, J., Capone, A., & Wu, J. (2019) · Sensors · doi:10.3390/s19224864 · Cited by 134
Coskun, A. K., Strong, R. D., Tullsen, D. M., & Simunic, T. (2009) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1555349.1555369 · Cited by 116
Improving Online Algorithms via ML Predictions
Kumar, R., Purohit, M., & Svitkina, Z. (2024) · arXiv · doi:10.48550/arxiv.2407.17712 · Cited by 111
Koutsoupias, E. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.04.002 · Cited by 103
System-level power optimization: techniques and tools
Benini, L., & Micheli, G. D. (1999) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1145/313817.313957 · Cited by 102
Optimal Online Multi-Instance Acquisition in IaaS Clouds
Wang, W., Liang, B., & Li, B. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2385697 · Cited by 101
Fleischer, R. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00266-8 · Cited by 97
Fleischer, R. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68535-9_10 · Cited by 95
Low-power task scheduling for multiple devices
Lu, Y.-H., Benini, L., & Micheli, G. D. (2000) · International Symposium on Hardware/Software Codesign (CODES) · doi:10.1145/334012.334020 · Cited by 92
Battery-driven dynamic power management
Benini, L., Castelli, G., Macii, A., & Scarsi, R. (2001) · IEEE Design & Test of Computers · doi:10.1109/54.914621 · Cited by 92
Simple and Effective Dynamic Provisioning for Power-Proportional Data Centers
Lu, T., Chen, M., & Andrew, L. L. H. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.241 · Cited by 99
Arpaci-Dusseau, A. C. (2001) · ACM Transactions on Computer Systems · doi:10.1145/380749.380764 · Cited by 83
Augustine, J. E., Irani, S., & Swamy, C. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.50 · Cited by 90
Dynamic power management using machine learning
Dhiman, G., & Simunic, T. (2006) · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · doi:10.1145/1233501.1233656 · Cited by 82
On-line analysis of the TCP acknowledgment delay problem
Dooly, D. R., Goldman, S. A., & Scott, S. (2001) · Journal of the ACM · doi:10.1145/375827.375843 · Cited by 81
Online VNF Scaling in Datacenters
Wang, X., Wu, C., Le, F., Liu, A., Li, Z., & Lau, F. C. M. (2016) · IEEE ... International Conference on Cloud Computing · doi:10.1109/cloud.2016.0028 · Cited by 79
Performance prediction in production environments
Schopf, J. M., & Berman, F. (2002) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipps.1998.669995 · Cited by 79
A guessing game and randomized online algorithms
Seiden, S. S. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335385 · Cited by 91
Power-aware operating systems for interactive systems
Lu, Y.-H., Benini, L., & Micheli, G. D. (2002) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.994989 · Cited by 76
Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
Wang, Y., & Wong, S. C.-W. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47672-7_87 · Cited by 71
Competitive Optimal On-Line Leasing
El‐Yaniv, R., Kaniel, R., & Linial, N. (1999) · Algorithmica · doi:10.1007/pl00009279 · Cited by 68
Energy efficient design of portable wireless systems
Simunic, T., Vikalo, H., Glynn, P. W., & Micheli, G. D. (2000) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1145/344166.344197 · Cited by 63
Proactive temperature balancing for low cost thermal management in MPSoCs
Coskun, A. K., Rosing, T., & Gross, K. C. (2008) · doi:10.5555/1509456.1509519 · Cited by 61
Online Algorithms for Rent-Or-Buy with Expert Advice.
Gollapudi, S., & Panigrahi, D. (2019) · International Conference on Machine Learning · Cited by 169
Quantitative comparison of power management algorithms
Lu, Y.-H., Chung, E.-Y., Simunic, T., Benini, T., & Micheli, G. D. (2002) · Design, Automation, and Test in Europe · doi:10.1109/date.2000.840010 · Cited by 56
Mobile Robot Planning to Seek Help with Spatially-Situated Tasks
Rosenthal, S. L., & Veloso, M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8386 · Cited by 54
Online Resource Procurement and Allocation in a Hybrid Edge-Cloud Computing System
Dinh, T. Q., Liang, B., Quek, T. Q. S., & Shin, H. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2962795 · Cited by 57
“In our problem, the edge node needs to decide whether to reserve instances at any time, which can be classified as a variant of the ski rental problem [26], a class of rent-or-buy problems.”
BackgroundA 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
Bansal, N., Gupta, A., Krishnaswamy, R., Pruhs, K. R., Schewior, K., & Stein, C. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx-random.2015.96 · Cited by 52
Bhatti, M. K., Belleudy, C., & Auguin, M. (2010) · IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC) · doi:10.1109/euc.2010.35 · Cited by 51
Proactive temperature balancing for low cost thermal management in MPSoCs
Coskun, A. K., Simunic, T., & Gross, K. C. (2008) · doi:10.1109/iccad.2008.4681582 · Cited by 50
Green Data Centers: A Survey, Perspectives, and Future DirectionsPreprint
Jin, X., Zhang, F., Vasilakos, A. V., & Liu, Z. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.00687 · Cited by 50
Dynamic Power Management Using Machine Learning
Dhiman, G., & Rosing, T. (2006) · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · doi:10.1109/iccad.2006.320115 · Cited by 48
System level online power management algorithms
Ramanathan, D., & Gupta, R. K. (2000) · Design, Automation, and Test in Europe · doi:10.1145/343647.343867 · Cited by 47
Program Counter Based Techniques for Dynamic Power Management
Gniady, C., Hu, Y., & Lu, Y.-H. (2005) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2004.10021 · Cited by 46
Average-Case Competitive Analyses for Ski-Rental Problems
Fujiwara, H., & Iwama, K. (2005) · Algorithmica · doi:10.1007/s00453-004-1142-x · Cited by 51
Learning-Based Power Management for Multicore Processors via Idle Period Manipulation
Ye, R., & Xu, Q. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2305838 · Cited by 42
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2012) · SIAM Journal on Discrete Mathematics · doi:10.1137/100794018 · Cited by 39
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski RentalPreprint
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2008) · arXiv (Cornell University) · Cited by 37
Chasing Convex Bodies and Functions
Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K. R., Schewior, K., & Scquizzato, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49529-2_6 · Cited by 36
Online Ski Rental for ON/OFF Scheduling of Energy Harvesting Base Stations
Lee, G., Saad, W., Bennis, M., Mehbodniya, A., & Adachi, F. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2672964 · Cited by 36
Online Learning-Assisted VNF Service Chain Scaling with Network Uncertainties
Wang, X., Wu, C., Le, F., & Lau, F. C. M. (2017) · IEEE ... International Conference on Cloud Computing · doi:10.1109/cloud.2017.34 · Cited by 35
Battery-driven dynamic power management of portable systems
Benini, L., Castelli, G., Macii, A., Macii, B., & Scarai, R. (2002) · International Symposium on System Synthesis (ISSS) · doi:10.1109/isss.2000.874025 · Cited by 35
A comparative evaluation of implicit coscheduling strategies for networks of workstations
Anglano, C. (2002) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.2000.868653 · Cited by 34
A Self-Learning Strategy for Task Offloading in UAV Networks
Sacco, A., Esposito, F., Marchetto, G., & Montuschi, P. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3144654 · Cited by 32
“An online algorithm is instead presented in [18], where task offloading decisions are modeled as a well-known sub-problem called rent/buy problem [19].”
Latency effects of system level power management algorithms
Ramanathan, D., Irani, S., & Gupta, R. K. (2000) · doi:10.5555/602902.602982 · Cited by 32
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online AlgorithmsPreprint
Wei, A., & Zhang, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.11443 · Cited by 112
Albers, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03456-5_12 · Cited by 30
Program counter-based prediction techniques for dynamic power management
Gniady, C., Butt, A. R., Hu, Y., & Lu, Y.-H. (2006) · IEEE Transactions on Computers · doi:10.1109/tc.2006.87 · Cited by 30
Randomized algorithms for metrical task systems
Irani, S., & Seiden, S. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00006-6 · Cited by 29
An analysis of system level power management algorithms and their effects on latency
Ramanathan, D., Irani, S., & Gupta, R. K. (2002) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.986423 · Cited by 29
Unfair Problems and Randomized Algorithms for Metrical Task Systems
Seiden, S. (1999) · Information and Computation · doi:10.1006/inco.1998.2744 · Cited by 28
Dynamic power management of laptop hard disk
Simunic, T., Benini, L., Glynn, P. W., & Micheli, G. D. (2002) · Design, Automation, and Test in Europe · doi:10.1109/date.2000.840869 · Cited by 27
Semi-Online Bipartite MatchingPreprint
Kumar, R., Purohit, M., Schild, A., Svitkina, Z., & Vee, E. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2019.50 · Cited by 35
Learning-based power management for multi-core processors via idle period manipulation
Ye, R., & Xu, Q. (2012) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2012.6164929 · Cited by 26
On the on-line rent-or-buy problem in probabilistic environments
Xu, Y., Xu, W., & Li, H. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9079-z · Cited by 26
A Match in Time Saves Nine: Deterministic Online Matching with Delays
Bieńkowski, M., Kraska, A., & Schmidt, P. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-89441-6_11 · Cited by 34
USING STOCHASTIC INFORMATION TO PREDICT APPLICATION BEHAVIOR ON CONTENDED RESOURCES
Schopf, J. M., & Berman, F. (2001) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054101000527 · Cited by 26
The Randomized 𝑘-Server Conjecture Is False!
Bubeck, S., Coester, C., & Rabani, Y. (2023) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3564246.3585132 · Cited by 25
Energy efficient design of portable wireless systems
Simunic, T., Vikalo, H., Glynn, P. W., & Micheli, G. D. (2000) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1109/lpe.2000.155252 · Cited by 25
A simulation methodology for reliability analysis in multi-core SoCs
Coskun, A. K., Simunic, T., Leblebici, Y., & Micheli, G. D. (2006) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/1127908.1127933 · Cited by 24
Simple and effective dynamic provisioning for power-proportional data centers
Lu, T., & Chen, M. (2012) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2012.6310753 · Cited by 22
Nearly optimal strategies for special cases of on-line capital investment
Damaschke, P. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00727-2 · Cited by 22
Dynamic Management of Power Consumption
Simunic, T. (2002) · Plenum series in computer science · doi:10.1007/978-1-4757-6217-4_6 · Cited by 22
A Tight Lower Bound for Online Convex Optimization with Switching Costs
Antoniadis, A., & Schewior, K. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-89441-6_13 · Cited by 21
Liu, M.-Y., Pan, L., & Liu, S. (2019) · IEEE Access · doi:10.1109/access.2019.2928844 · Cited by 21
Dynamic Balanced Graph Partitioning
Avin, C., Bieńkowski, M., Loukas, A., Pacut, M., & Schmid, S. (2020) · SIAM Journal on Discrete Mathematics · doi:10.1137/17m1158513 · Cited by 26
“The BRP problem is an example of a non-uniform problem [26]: the cost of changing the state is higher than the cost of serving a single request.”
A Randomized Algorithm for Two Servers on the Line
Bartal, Y., Chrobák, M., & Larmore, L. L. (2000) · Information and Computation · doi:10.1006/inco.1999.2809 · Cited by 21
Customizing ML Predictions for Online AlgorithmsPreprint
Anand, K., Ge, R., & Panigrahi, D. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.08715 · Cited by 23
“The ski-rental e−1 problem (Karlin et al., 1994; Lotker et al., 2008; Khanafer et al., 2013; Kodialam, 2014), and variants such as TCP acknowledgment (Karlin et al.”
BackgroundOnline Randomized Multiprocessor Scheduling
Seiden, S. S. (2000) · Algorithmica · doi:10.1007/s004530010014 · Cited by 20
Optimal randomized algorithm for a generalized ski-rental with interest rate
Yang, X., Zhang, W., Zhang, Y., & Xu, W. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.04.006 · Cited by 19
Elastic Virtual Network Function Orchestration Policy Based on Workload Prediction
Gu, Y., Hu, Y., Ding, Y., Lu, J., & Xie, J. (2019) · IEEE Access · doi:10.1109/access.2019.2929260 · Cited by 19
Optimal Algorithms for Ski Rental with Soft Machine-Learned PredictionsPreprint
Kodialam, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00092 · Cited by 19
Online Lower Bounds via Duality
Azar, Y., Cohen, I. R., & Roytman, A. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.66 · Cited by 18
On the best possible competitive ratio for the multislope ski-rental problem
Fujiwara, H., Kitano, T., & Fujito, T. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9762-9 · Cited by 18
On Advice Complexity of the k-server Problem under Sparse Metrics
Gupta, S., Kamali, S., & López-Ortíz, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03578-9_5 · Cited by 17
Rong, P., & Pedram, M. (2006) · Design, Automation, and Test in Europe · doi:10.1109/date.2006.243981 · Cited by 17
Average-Case Competitive Analyses for Ski-Rental Problems
Fujiwara, H., & Iwama, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36136-7_42 · Cited by 18
Rent or Buy Problems with a Fixed Time Horizon
Epstein, L., & Zebedat-Haider, H. (2014) · Theory of Computing Systems · doi:10.1007/s00224-014-9552-x · Cited by 18
Latency effects of system level power management algorithms
Ramanathan, D., Irani, S., & Gupta, R. K. (2002) · International Conference on Computer Aided Design · doi:10.1109/iccad.2000.896497 · Cited by 17
Online Algorithms for Multi-shop Ski Rental with Machine Learned AdvicePreprint
Wang, S., Li, J., & Wang, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.05808 · Cited by 17
Minimizing Cost in IaaS Clouds Via Scheduled Instance Reservation
Wang, Q., Tan, M. M., Tang, X., & Cai, W. (2017) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2017.16 · Cited by 18
Competitive strategy for on-line leasing of depreciable equipment
Zhang, Y., Zhang, W.-G., Xu, W., & Li, H. (2011) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2011.02.036 · Cited by 16
Joint Power Management of Memory and Disk Under Performance Constraints
Cai, L., Pettis, N., & Lu, Y.-H. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2006.882587 · Cited by 16
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.