On the public citation graph

Competitive snoopy caching

https://doi.org/10.1007/bf01762111
0 signed · 580 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/285930.285984openalex-snapshot
Using cache memory to reduce processor-memory traffic
inferredcites →https://doi.org/10.1145/285930.285987openalex-snapshot
A low-overhead coherence solution for multiprocessors with private cache memories
inferredcites →https://doi.org/10.1145/317499.317534openalex-snapshot
Performance analysis of multiprocessor cache consistency protocols using generalized timed Petri nets
inferredcites →https://doi.org/10.1145/317531.317534openalex-snapshot
Performance analysis of multiprocessor cache consistency protocols using generalized timed Petri nets
inferredcites →https://doi.org/10.1145/327070.327237openalex-snapshot
Implementing a cache consistency protocol
inferredcites →https://doi.org/10.1145/3341.3349openalex-snapshot
Amortized analyses of self-organizing sequential search heuristics
inferredcites →https://doi.org/10.1145/773453.808203openalex-snapshot
Dynamic decentralized cache schemes for mimd parallel processors
inferredcites →https://doi.org/10.1145/800015.808203openalex-snapshot
Dynamic decentralized cache schemes for mimd parallel processors
inferredcites →https://doi.org/10.1145/800015.808204openalex-snapshot
A low-overhead coherence solution for multiprocessors with private cache memories
inferredcites →https://doi.org/10.1145/800046.801647openalex-snapshot
Using cache memory to reduce processor-memory traffic
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4087144openalex-extracted
Risk-Reward Models for Two-Option Online Leasing Problem Under Sharing Economy
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8openalex-snapshot
Exploring an unknown graph
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.3.co;2-#openalex-snapshot
Exploring an unknown graph
inferred← citeshttps://doi.org/10.1002/0471224561.ch4openalex-snapshot
Channel Assignment and Graph Multicoloring
inferred← citeshttps://doi.org/10.1002/cpe.4125openalex-snapshot
Online virtual machine migration for renewable energy usage maximization in geographically distributed cloud data centers
inferred← citeshttps://doi.org/10.1002/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferred← citeshttps://doi.org/10.1002/net.3230230806openalex-snapshot
The dynamic predicate stashing copy problem
inferred← citeshttps://doi.org/10.1006/inco.1998.2744openalex-snapshot
Unfair Problems and Randomized Algorithms for Metrical Task Systems
inferred← citeshttps://doi.org/10.1006/jagm.1995.0799openalex-snapshot
On-Line Load Balancing of Temporary Tasks
inferred← citeshttps://doi.org/10.1006/jagm.1996.0024openalex-snapshot
Traversing Layered Graphs Using the Work Function Algorithm
inferred← citeshttps://doi.org/10.1006/jagm.1996.0826openalex-snapshot
The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
inferred← citeshttps://doi.org/10.1006/jagm.1996.0853openalex-snapshot
Page Migration Algorithms Using Work Functions
inferred← citeshttps://doi.org/10.1006/jagm.1997.0923openalex-snapshot
Routing and Admission Control in General Topology Networks with Poisson Arrivals
inferred← citeshttps://doi.org/10.1006/jagm.1998.0924openalex-snapshot
Distributed Paging for General Networks
inferred← citeshttps://doi.org/10.1006/jagm.1999.1060openalex-snapshot
Online Scheduling with Hard Deadlines
inferred← citeshttps://doi.org/10.1006/jagm.1999.1068openalex-snapshot
Distributed Online Frequency Assignment in Cellular Networks
inferred← citeshttps://doi.org/10.1006/jcss.1995.1073openalex-snapshot
Competitive Algorithms for Distributed Data Management
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1257openalex-snapshot
Competitive Analysis of Network Load Balancing
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_60openalex-snapshot
Competitive Ratio for Portfolio Management
inferred← citeshttps://doi.org/10.1007/11537311_35openalex-snapshot
The Maximum Resource Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/11549345_1openalex-snapshot
Page Migration in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/11671541_1openalex-snapshot
On Approximation Algorithms for Data Mining Applications
inferred← citeshttps://doi.org/10.1007/11785293_14openalex-snapshot
Paging with Request Sets
inferred← citeshttps://doi.org/10.1007/11785293_5openalex-snapshot
Scheduling Jobs on Grid Processors
inferred← citeshttps://doi.org/10.1007/11841036_47openalex-snapshot
Approximation in Preemptive Stochastic Online Scheduling
inferred← citeshttps://doi.org/10.1007/11970125_8openalex-snapshot
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
inferred← citeshttps://doi.org/10.1007/3-540-36612-1_11openalex-snapshot
Application-Supported Device Management for Energy and Performance
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_4openalex-snapshot
A New Competitive Analysis of Randomized Caching
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_15openalex-snapshot
New Results for Online Page Replication
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_8openalex-snapshot
On-Line Edge-Coloring with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_50openalex-snapshot
On-Line Deadline Scheduling on Multiple Resources
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_13openalex-snapshot
The Relative Worst Order Ratio for On-Line Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_86openalex-snapshot
The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_18openalex-snapshot
On Multicriteria Online Problems
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_43openalex-snapshot
Paging on a RAM with Limited Resources
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_54openalex-snapshot
New Results on the k-Truck Problem
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_21openalex-snapshot
More on Weighted Servers or Fifo is Better than Lru
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_45openalex-snapshot
Online Companion Caching
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_48openalex-snapshot
The CNN Problem and Other k-Server Variants
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_25openalex-snapshot
Lower and Upper Bounds for the Problem of Page Replication in Ring Networks
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_9openalex-snapshot
The Accomodating Function — A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_29openalex-snapshot
Scheduling Two Machines with Release Times
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_56openalex-snapshot
An on-line algorithm for navigating in unknown terrain
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_16openalex-snapshot
The list update problem and the retrieval of sets
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_39openalex-snapshot
The influence of lookahead in competitive paging algorithms
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_272openalex-snapshot
Page migration algorithms using work functions
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_273openalex-snapshot
Memory paging for connectivity and path problems in graphs
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_275openalex-snapshot
Randomized on-line algorithms for the page replication problem
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_95openalex-snapshot
Paging more than one page
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_83openalex-snapshot
On-line resource management with applications to routing and scheduling
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_58openalex-snapshot
Page migration with limited local memory capacity
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_65openalex-snapshot
On-line scheduling with hard deadlines
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_23openalex-snapshot
Adaptability and the Usefulness of Hints (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_10openalex-snapshot
On the Bahncard Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_378openalex-snapshot
Ski Rental Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-34928-2_5openalex-snapshot
Online-algorithms for reactive vehicle scheduling
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_74openalex-snapshot
Competitive Ratio for Portfolio Management
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_10openalex-snapshot
Online Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_28openalex-snapshot
Advanced Techniques for Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_39openalex-snapshot
Methodical Competitive Snoopy-Caching
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_36openalex-snapshot
Parallel Computation Models — Some Useful Questions
inferred← citeshttps://doi.org/10.1007/978-1-4615-2223-2_8openalex-snapshot
On-Line Algorithms for a Single Machine Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-3604-8_4openalex-snapshot
Locks, Directories, and Weak Coherence—a Recipe for Scalable Shared Memory Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_378openalex-snapshot
Ski Rental Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_74-1openalex-snapshot
Competitive Ratio for Portfolio Management
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6openalex-snapshot
Algorithms for Big Data
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_10openalex-snapshot
Distributed Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_10openalex-snapshot
Online Minimum Spanning Trees with Weight Predictions
inferred← citeshttps://doi.org/10.1007/978-3-031-58453-4_1openalex-snapshot
Introduction of Online Incentive Mechanism in Wireless Communications
inferred← citeshttps://doi.org/10.1007/978-3-031-62792-7_8openalex-snapshot
A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types
inferred← citeshttps://doi.org/10.1007/978-3-031-63735-3_2openalex-snapshot
A Theory of Learning with Competing Objectives and User Feedback
inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_7openalex-snapshot
Non-Additive Two-Option Ski Rental
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_20openalex-snapshot
Online Bin Covering: Expectations vs. Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_26openalex-snapshot
Optimal Online Edge Coloring of Planar Graphs with Advice
inferred← citeshttps://doi.org/10.1007/978-3-319-18263-6_16openalex-snapshot
Online Dual Edge Coloring of Paths and Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-18263-6_8openalex-snapshot
Online Multi-Coloring with Advice
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_59openalex-snapshot
Algorithmic Approaches for a Dependable Smart Grid
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_10openalex-snapshot
Online Bounded Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_14openalex-snapshot
Weighted Online Problems with Advice
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_19openalex-snapshot
Relaxing the Irrevocability Requirement for Online Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_2openalex-snapshot
Price Fluctuation in Online Leasing
inferred← citeshttps://doi.org/10.1007/978-3-319-89441-6_13openalex-snapshot
A Tight Lower Bound for Online Convex Optimization with Switching Costs
inferred← citeshttps://doi.org/10.1007/978-3-319-89920-6_4openalex-snapshot
Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_24openalex-snapshot
Preemptively Guessing the Center
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_13openalex-snapshot
Relative Worst-Order Analysis: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_23openalex-snapshot
Multiplier with Parallel CSA using CRT’s Specific Moduli (2 k -1, 2 k , 2 k +1)
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_9openalex-snapshot
The Relative Worst Order Ratio Applied to Seat Reservation
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_10openalex-snapshot
On the On-Line k-Taxi Problem with Limited Look Ahead
inferred← citeshttps://doi.org/10.1007/978-3-540-74247-0_17openalex-snapshot
Online Delay Management on a Single Train Line
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_21openalex-snapshot
How Much Information about the Future Is Needed?
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_11openalex-snapshot
Comparing First-Fit and Next-Fit for Online Edge Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_5openalex-snapshot
Discrete online TSP
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_53openalex-snapshot
Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_11openalex-snapshot
A Comparison of Performance Measures for Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_37openalex-snapshot
Online Paging for Flash Memory Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_3openalex-snapshot
Price Fluctuations: To Buy or to Rent
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_33openalex-snapshot
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_35openalex-snapshot
Better Bounds on Online Unit Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_11openalex-snapshot
List Factoring and Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_17openalex-snapshot
On Variants of File Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_16openalex-snapshot
Formal Analysis of Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_56openalex-snapshot
On the Best Possible Competitive Ratio for Multislope Ski Rental
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_378-2openalex-snapshot
Ski Rental Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_14openalex-snapshot
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_4openalex-snapshot
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_28openalex-snapshot
Engineering Efficient Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_29openalex-snapshot
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_65openalex-snapshot
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives
inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_10openalex-snapshot
Asymptotically Optimal Online Page Migration on Three Points
inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_14openalex-snapshot
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_64openalex-snapshot
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_17openalex-snapshot
Relative Interval Analysis of Paging Algorithms on Access Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40164-0_9openalex-snapshot
The Frequent Items Problem in Online Streaming under Various Performance Measures
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_2openalex-snapshot
Bounds for Scheduling Jobs on Grid Processors
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_33openalex-snapshot
Rent or Buy Problems with a Fixed Time Horizon
inferred← citeshttps://doi.org/10.1007/978-3-662-01069-3_42openalex-snapshot
Caching in Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-04331-8_33openalex-snapshot
Combinatorial Online Optimization in Real Time
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_87openalex-snapshot
Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_7openalex-snapshot
Stochastization of Weighted Automata
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_15openalex-snapshot
MPMD on Two Sources with Lookahead
inferred← citeshttps://doi.org/10.1007/bf01189993openalex-snapshot
Competitive randomized algorithms for nonuniform problems
inferred← citeshttps://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferred← citeshttps://doi.org/10.1007/bf01294261openalex-snapshot
Randomized competitive algorithms for the list update problem
inferred← citeshttps://doi.org/10.1007/bf01294262openalex-snapshot
On-line algorithms for locating checkpoints
inferred← citeshttps://doi.org/10.1007/bf01294264openalex-snapshot
A new measure for the study of on-line algorithms
inferred← citeshttps://doi.org/10.1007/bf01940643openalex-snapshot
Competitive distributed decision-making
inferred← citeshttps://doi.org/10.1007/bf02943583openalex-snapshot
Adaptive memory coherence algorithms in DSVM
inferred← citeshttps://doi.org/10.1007/bfb0009518openalex-snapshot
On multi-threaded Paging
inferred← citeshttps://doi.org/10.1007/bfb0023850openalex-snapshot
Data structures and terminating Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0028544openalex-snapshot
Distributed online frequency assignment in cellular networks
inferred← citeshttps://doi.org/10.1007/bfb0029562openalex-snapshot
Competitive analysis of algorithms
inferred← citeshttps://doi.org/10.1007/bfb0029564openalex-snapshot
Competitive analysis of paging
inferred← citeshttps://doi.org/10.1007/bfb0029566openalex-snapshot
Distributed paging
inferred← citeshttps://doi.org/10.1007/bfb0029577openalex-snapshot
On the performance of competitive algorithms in practice
inferred← citeshttps://doi.org/10.1007/bfb0035792openalex-snapshot
Memory versus randomization in on-line algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054307openalex-snapshot
Uniform service systems with k servers
inferred← citeshttps://doi.org/10.1007/bfb0054374openalex-snapshot
Randomized online multi-threaded paging
inferred← citeshttps://doi.org/10.1007/pl00009158openalex-snapshot
On the Influence of Lookahead in Competitive Paging Algorithms
inferred← citeshttps://doi.org/10.1007/pl00009166openalex-snapshot
On Algorithm Design for Metrical Task Systems
inferred← citeshttps://doi.org/10.1007/pl00009270openalex-snapshot
On-Line Resource Management with Application to Routing and Scheduling
inferred← citeshttps://doi.org/10.1007/pl00009279openalex-snapshot
Competitive Optimal On-Line Leasing
inferred← citeshttps://doi.org/10.1007/pl00009286openalex-snapshot
The Seat Reservation Problem
inferred← citeshttps://doi.org/10.1007/s00224-007-9029-2openalex-snapshot
Paging with Request Sets
inferred← citeshttps://doi.org/10.1007/s00224-012-9427-yopenalex-snapshot
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
inferred← citeshttps://doi.org/10.1007/s00224-014-9552-xopenalex-snapshot
Rent or Buy Problems with a Fixed Time Horizon
inferred← citeshttps://doi.org/10.1007/s00224-016-9688-yopenalex-snapshot
The Advice Complexity of a Class of Hard Online Problems
inferred← citeshttps://doi.org/10.1007/s00224-017-9806-5openalex-snapshot
Weighted Online Problems with Advice
inferred← citeshttps://doi.org/10.1007/s00236-010-0123-6openalex-snapshot
A theoretical comparison of LRU and LRU-K
inferred← citeshttps://doi.org/10.1007/s00236-013-0184-4openalex-snapshot
Online multi-coloring on the path revisited
inferred← citeshttps://doi.org/10.1007/s00236-016-0283-0openalex-snapshot
Online edge coloring of paths and trees with a fixed number of colors
inferred← citeshttps://doi.org/10.1007/s00291-020-00594-wopenalex-snapshot
Online routing and scheduling of search-and-rescue teams
inferred← citeshttps://doi.org/10.1007/s00450-011-0149-1openalex-snapshot
Probabilistic alternatives for competitive analysis
inferred← citeshttps://doi.org/10.1007/s00450-011-0150-8openalex-snapshot
Migrating and replicating data in networks
inferred← citeshttps://doi.org/10.1007/s00453-001-0003-0openalex-snapshot
Optimal Search and One-Way Trading Online Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-001-0069-8openalex-snapshot
On the Competitive Theory and Practice of Online List Accessing Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-001-0073-zopenalex-snapshot
On-Line Multi-Threaded Paging
inferred← citeshttps://doi.org/10.1007/s00453-001-0125-4openalex-snapshot
Page Replacement with Multi-Size Pages and Applications to Web Caching
inferred← citeshttps://doi.org/10.1007/s00453-002-0965-6openalex-snapshot
Fair versus Unrestricted Bin Packing
inferred← citeshttps://doi.org/10.1007/s00453-002-0992-3openalex-snapshot
On-Line Edge-Coloring with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.1007/s00453-003-1013-xopenalex-snapshot
Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)
inferred← citeshttps://doi.org/10.1007/s00453-004-1129-7openalex-snapshot
Optimal Read-Once Parallel Disk Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-008-9257-0openalex-snapshot
Scheduling Jobs on Grid Processors
inferred← citeshttps://doi.org/10.1007/s00453-012-9629-3openalex-snapshot
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/s00453-012-9637-3openalex-snapshot
List Factoring and Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/s00453-013-9793-0openalex-snapshot
Online File Caching with Rejection Penalties
inferred← citeshttps://doi.org/10.1007/s00453-013-9841-9openalex-snapshot
Asymptotically Optimal Online Page Migration on Three Points
inferred← citeshttps://doi.org/10.1007/s00453-014-9884-6openalex-snapshot
A Comparison of Performance Measures for Online Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-018-0519-1openalex-snapshot
Online Dominating Set
inferred← citeshttps://doi.org/10.1007/s00453-022-00944-wopenalex-snapshot
Relaxing the Irrevocability Requirement for Online Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-024-01270-zopenalex-snapshot
Online Paging with Heterogeneous Cache Slots
inferred← citeshttps://doi.org/10.1007/s004530010014openalex-snapshot
Online Randomized Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/s00607-007-0230-6openalex-snapshot
Calculating lower bounds for caching problems
inferred← citeshttps://doi.org/10.1007/s10100-016-0455-6openalex-snapshot
Evaluating the quality of online optimization algorithms by discrete event simulation
inferred← citeshttps://doi.org/10.1007/s10288-020-00442-1openalex-snapshot
Exact distributional analysis of online algorithms with lookahead
inferred← citeshttps://doi.org/10.1007/s10472-026-10004-6openalex-snapshot
Balancing fairness: learning with conflicting objectives and user feedback
inferred← citeshttps://doi.org/10.1007/s10479-009-0605-5openalex-snapshot
Online stochastic optimization under time constraints
inferred← citeshttps://doi.org/10.1007/s10479-014-1620-8openalex-snapshot
Probability-free solutions to the non-stationary newsvendor problem
inferred← citeshttps://doi.org/10.1007/s10479-019-03153-xopenalex-snapshot
On packet scheduling with adversarial jamming and speedup
inferred← citeshttps://doi.org/10.1007/s10766-013-0247-8openalex-snapshot
Bandwidth Adaptive Cache Coherence Optimizations for Chip Multiprocessors
inferred← citeshttps://doi.org/10.1007/s10878-013-9654-4openalex-snapshot
Online traveling salesman problem with deadlines and service flexibility
inferred← citeshttps://doi.org/10.1007/s10878-014-9762-9openalex-snapshot
On the best possible competitive ratio for the multislope ski-rental problem
inferred← citeshttps://doi.org/10.1007/s10878-022-00882-xopenalex-snapshot
Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
inferred← citeshttps://doi.org/10.1007/s10878-025-01271-wopenalex-snapshot
Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components
inferred← citeshttps://doi.org/10.1007/s10878-025-01327-xopenalex-snapshot
Single machine lot scheduling to minimize maximum weighted completion time
inferred← citeshttps://doi.org/10.1007/s10898-005-2849-1openalex-snapshot
Competitive Analysis for the On-line Truck Transportation Problem
inferred← citeshttps://doi.org/10.1007/s10951-009-0129-5openalex-snapshot
Comparing online algorithms for bin packing problems
inferred← citeshttps://doi.org/10.1007/s10951-010-0199-4openalex-snapshot
A new variable-sized bin packing problem
inferred← citeshttps://doi.org/10.1007/s10951-017-0536-yopenalex-snapshot
Online-bounded analysis
inferred← citeshttps://doi.org/10.1007/s10951-022-00768-0openalex-snapshot
Joint replenishment meets scheduling
inferred← citeshttps://doi.org/10.1007/s11390-008-9122-2openalex-snapshot
Competitive Analysis of Two Special Online Device Replacement Problems
inferred← citeshttps://doi.org/10.1007/s12597-026-01181-3openalex-snapshot
Bridging theory and practice: novel adaptive frameworks for self-organizing sequential search problem under uncertainty
inferred← citeshttps://doi.org/10.1007/s12667-021-00475-3openalex-snapshot
Decrease and reset for power-down
inferred← citeshttps://doi.org/10.1007/s40305-025-00590-3openalex-snapshot
Group Rent-or-Buy: the Benefits of Having Grouped Consumers
inferred← citeshttps://doi.org/10.1007/s43069-021-00055-2openalex-snapshot
Online Failure Diagnosis in Interdependent Networks
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90011-yopenalex-snapshot
Performance effects of program structures on a snoop-cached multiprocessor system
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90025-oopenalex-snapshot
On-line algorithms for 2-coloring hypergraphs via chip games
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90201-4openalex-snapshot
The weighted list update problem and the lazy adversary
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00010-7openalex-snapshot
The list update problem and the retrieval of sets
showing the first 200 of 568
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.