Competitive snoopy caching
From MaRDI portal
For a review of the preliminary version of this paper in Discrete algorithms and complexity, Proc. Jap.-US Joint Semin., Kyoto/Jap. 1986, Perspect. Comput. 15, 459-483 (1987), see Zbl 0643.68021.
Cited in
(only showing first 100 items - show all)- The weighted list update problem and the lazy adversary
- On-line algorithms for 2-coloring hypergraphs via chip games
- Randomized online interval scheduling
- Unfair problems and randomized algorithms for metrical task systems
- Preemptive on-line scheduling for two uniform processors
- On the power of randomization in on-line algorithms
- Randomized competitive algorithms for the list update problem
- On-line algorithms for locating checkpoints
- A new measure for the study of on-line algorithms
- Competitive randomized algorithms for nonuniform problems
- Competitive k-server algorithms
- Methods for message routing in parallel machines
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- The list update problem and the retrieval of sets
- Competitive algorithms for the weighted server problem
- Paging more than one page
- Connection caching: Model and algorithms.
- More on weighted servers or FIFO is better than LRU.
- Competitive distributed file allocation.
- Online-bounded analysis
- Evaluating the quality of online optimization algorithms by discrete event simulation
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- The advice complexity of a class of hard online problems
- Online edge coloring of paths and trees with a fixed number of colors
- Online dominating set
- Online companion caching
- New results for online page replication
- The CNN problem and other k-server variants
- Competitive distributed decision-making
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- List factoring and relative worst order analysis
- Online stochastic optimization under time constraints
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Exact distributional analysis of online algorithms with lookahead
- Guessing fractions of online sequences
- Machine learning advised algorithms for the ski rental problem with a discount
- The fast algorithm for online \(k\)-server problem on trees
- Randomized strategies for non-additive 3-slope ski rental
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- The work function algorithm for the paging problem
- Group parking permit problems
- Online failure diagnosis in interdependent networks
- On bin packing with clustering and bin packing with delays
- Quantum online streaming algorithms with logarithmic memory
- Probability-free solutions to the non-stationary newsvendor problem
- Paging with request sets
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Non-additive two-option ski rental
- Rent or buy problems with a fixed time horizon
- Online file caching with rejection penalties
- Asymptotically optimal online page migration on three points
- Online multi-coloring with advice
- Competitive algorithms for the bicriteria \(k\)-server problem
- Comparing online algorithms for bin packing problems
- A new variable-sized bin packing problem
- Calculating lower bounds for caching problems
- Competitive analysis for the on-line truck transportation problem
- Ramsey-type theorems for metric spaces with applications to online problems
- The maximum resource bin packing problem
- Relative interval analysis of paging algorithms on access graphs
- Online search for a hyperplane in high-dimensional Euclidean space
- An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands
- Equilibria in online games
- Weighted Online Problems with Advice
- Engineering efficient paging algorithms
- Bounds for scheduling jobs on grid processors
- Online Bin Covering: Expectations vs. Guarantees
- Non-additive two-option ski rental
- An improved lower bound for load balancing of tasks with unknown duration
- The working set algorithm has competitive ratio less than two
- Uniform multipaging reduces to paging
- Stochastization of weighted automata
- Optimal online edge coloring of planar graphs with advice
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- Online bin covering: expectations vs. guarantees
- On variants of file caching
- Online traveling salesman problems with service flexibility
- Online ordering policies for a two-product, multi-period stationary newsvendor problem
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Online Multi-Coloring with Advice
- Online Dual Edge Coloring of Paths and Trees
- Price fluctuations: to buy or to rent
- Online Vehicle Routing Problems: A Survey
- Discrete online TSP
- Online multi-coloring on the path revisited
- Better bounds on online unit clustering
- Risk-reward models for on-line leasing of depreciable equipment
- Optimal randomized algorithm for a generalized ski-rental with interest rate
- The \(k\)-server problem
- Handling critical jobs online: deadline scheduling and convex-body chasing
- The optimal structure of algorithms for \(\alpha\)-paging
- Multi-priority online scheduling with cancellations
- Online traveling salesman problem with deadlines and service flexibility
- Randomized online multi-threaded paging
- The list update problem and the retrieval of sets
- Page migration with limited local memory capacity
- scientific article; zbMATH DE number 7559165 (Why is no real title available?)
- Paging more than one page
- On-line scheduling with hard deadlines
This page was built for publication: Competitive snoopy caching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103391)
