Cited in
(only showing first 100 items - show all)- List factoring and relative worst order analysis
- An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands
- Rent or buy problems with a fixed time horizon
- On bin packing with clustering and bin packing with delays
- Online algorithms for page replication in rings
- Competitive strategy for on-line leasing of depreciable equipment
- The optimal structure of algorithms for \(\alpha\)-paging
- Guessing fractions of online sequences
- Tight bounds for restricted grid scheduling
- Group parking permit problems
- Online traveling salesman problem with deadlines and service flexibility
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- Non-additive two-option ski rental
- Page migration with limited local memory capacity
- Joint replenishment meets scheduling
- Comparing online algorithms for bin packing problems
- On-line scheduling with hard deadlines
- Online paging with heterogeneous cache slots
- Optimal online edge coloring of planar graphs with advice
- The list update problem and the retrieval of sets
- Equilibria in online games
- Online multi-coloring on the path revisited
- The list update problem and the retrieval of sets
- New results for online page replication
- Online Bin Covering: Expectations vs. Guarantees
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
- Machine learning advised algorithms for the ski rental problem with a discount
- Randomized strategies for non-additive 3-slope ski rental
- Competitive algorithms for the weighted server problem
- Online stochastic optimization under time constraints
- On multi-threaded Paging
- Better bounds on online unit clustering
- The maximum resource bin packing problem
- A new variable-sized bin packing problem
- The fast algorithm for online \(k\)-server problem on trees
- Online algorithms with advice: the tape model
- Competitive algorithms for the bicriteria \(k\)-server problem
- Handling critical jobs online: deadline scheduling and convex-body chasing
- Quantum online streaming algorithms with logarithmic memory
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory
- scientific article; zbMATH DE number 7559165 (Why is no real title available?)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Comparing first-fit and next-fit for online edge coloring
- Competitive distributed file allocation.
- Online traveling salesman problems with service flexibility
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Ramsey-type theorems for metric spaces with applications to online problems
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
- Probability-free solutions to the non-stationary newsvendor problem
- On-line algorithms for locating checkpoints
- Online Multi-Coloring with Advice
- Non-additive two-option ski rental
- Connection caching: Model and algorithms.
- Online file caching with rejection penalties
- Measuring the problem-relevant information in input
- Clever or smart: strategies for the online target date assignment problem
- The work function algorithm for the paging problem
- Online computation with untrusted advice
- ON THE k-TRUCK SCHEDULING PROBLEM
- The advice complexity of a class of hard online problems
- Paging with request sets
- Scheduling in the dark
- Online dominating set
- Discrete online TSP
- Risk-reward models for on-line leasing of depreciable equipment
- Online edge coloring of paths and trees with a fixed number of colors
- Online Vehicle Routing Problems: A Survey
- Online failure diagnosis in interdependent networks
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- On multi-threaded metrical task systems
- Online-bounded analysis
- Randomized online multi-threaded paging
- Preemptive on-line scheduling for two uniform processors
- Online companion caching
- An improved lower bound for load balancing of tasks with unknown duration
- The working set algorithm has competitive ratio less than two
- Randomized online interval scheduling
- Calculating lower bounds for caching problems
- On the power of randomization in on-line algorithms
- Optimal randomized algorithm for a generalized ski-rental with interest rate
- Bounds for scheduling jobs on grid processors
- Weighted online problems with advice
- Uniform multipaging reduces to paging
- Online bin covering: expectations vs. guarantees
- Unfair problems and randomized algorithms for metrical task systems
- Asymptotically optimal online page migration on three points
- Online multi-coloring with advice
- Competitive analysis for online leasing problem with compound interest rate
- The CNN problem and other k-server variants
- Online paging and file caching with expiration times
- Preemptive multiprocessor scheduling with rejection
- Scheduling jobs on grid processors
- The weighted list update problem and the lazy adversary
- Relative interval analysis of paging algorithms on access graphs
- Randomized competitive algorithms for the list update problem
- On the best possible competitive ratio for the multislope ski-rental problem
- Paging more than one page
- Evaluating the quality of online optimization algorithms by discrete event simulation
- On packet scheduling with adversarial jamming and speedup
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
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)
