Competitive randomized algorithms for nonuniform problems
From MaRDI portal
Recommendations
Cites work
- A competitive 2-server algorithm
- A New Approach to the Server Problem
- A strongly competitive randomized paging algorithm
- An Optimal On-Line Algorithm for K Servers on Trees
- An optimal on-line algorithm for metrical task system
- Competitive k-server algorithms
- Competitive algorithms for server problems
- Competitive paging algorithms
- Competitive snoopy caching
- scientific article; zbMATH DE number 432775 (Why is no real title available?)
- Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
- New Ressults on Server Problems
- On the power of randomization in on-line algorithms
- Random walks on weighted graphs and applications to on-line algorithms
Cited in
(53)- Randomized algorithms for metrical task systems
- Unfair problems and randomized algorithms for metrical task systems
- On the power of randomization in on-line algorithms
- A new measure for the study of on-line algorithms
- More on randomized on-line algorithms for caching.
- Nearly optimal strategies for special cases of on-line capital investment.
- Online strategies for backups
- Randomized competitive analysis for two server problems
- On randomization in on-line computation.
- A randomized algorithm for two servers on the line.
- A general decomposition theorem for the k-server problem
- Machine learning advised algorithms for the ski rental problem with a discount
- Randomized strategies for non-additive 3-slope ski rental
- Machine learning advised ski rental problem with a discount
- Metrical service systems with multiple servers
- Rent or buy problems with a fixed time horizon
- Online dynamic power management with hard real-time guarantees
- The orthogonal CNN problem
- On the on-line rent-or-buy problem in probabilistic environments
- Multiple spin-block decisions
- scientific article; zbMATH DE number 1629982 (Why is no real title available?)
- The working set algorithm has competitive ratio less than two
- Entropy-based bounds for online algorithms
- Stochastization of weighted automata
- scientific article; zbMATH DE number 1003272 (Why is no real title available?)
- Serving in the dark should be done non-uniformly
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Price fluctuations: to buy or to rent
- KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
- scientific article; zbMATH DE number 4049014 (Why is no real title available?)
- Optimal randomized algorithm for a generalized ski-rental with interest rate
- scientific article; zbMATH DE number 2080233 (Why is no real title available?)
- The \(k\)-server problem
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Randomized online multi-threaded paging
- Randomized algorithms for metrical task systems
- Semi-online bipartite matching
- Impatient Online Matching
- Query-Competitive Sorting with Uncertainty.
- Dynamic balanced graph partitioning
- USING STOCHASTIC INFORMATION TO PREDICT APPLICATION BEHAVIOR ON CONTENDED RESOURCES
- On the best possible competitive ratio for the multislope ski-rental problem
- Non-linear ski rental
- Joint replenishment meets scheduling
- Competitive analysis for online leasing problem with compound interest rate
- Competitive strategy for on-line leasing of depreciable equipment
- Randomized algorithm for MPMD on two sources
- MPMD on two sources with lookahead
- Optimal publishing strategies on a base layer
- A learning-augmented algorithm for the parking permit problem with three permit types
- Competitive analysis of the online leasing problem with a piecewise price function
- Randomized distributed online algorithms against adaptive offline adversaries
This page was built for publication: Competitive randomized algorithms for nonuniform problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329146)
