On the public citation graph
Memory versus randomization in on-line algorithms
0 signed · 80 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-0000(89)90044-5openalex-snapshot
There are planar graphs almost as good as the complete graph
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot
An optimal online algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1145/73007.73062openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1995.1011openalex-snapshot
A Communication-Randomness Tradeoff for Two-Processor Systems
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.1007/11830924_12openalex-snapshot
Online Algorithms to Minimize Resource Reallocations and Network Communication
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_21openalex-snapshot
Carrying Umbrellas: An Online Relocation Problem on Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_36openalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_26openalex-snapshot
A time-randomness tradeoff for communication complexity
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_59openalex-snapshot
Competitive analysis of the Round Robin algorithm
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-60084-1_72openalex-snapshot
On the number of random bits in totally private computation
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_72openalex-snapshot
Competitive analysis of randomized paging algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-49815-2_13openalex-snapshot
Any-Order Online Interval Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_15openalex-snapshot
On the Smoothness of Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-32025-0_1openalex-snapshot
Cost Minimization and Social Fairness for Spatial Crowdsourcing Tasks
inferred← citeshttps://doi.org/10.1007/978-981-96-4136-9_33openalex-snapshot
Randomized Algorithm for Online k-Server Problem on a Line
inferred← citeshttps://doi.org/10.1007/bf01200118openalex-snapshot
Bounds on tradeoffs between randomness and communication complexity
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/bfb0029609openalex-snapshot
On fast algorithms for two servers
inferred← citeshttps://doi.org/10.1007/bfb0054307openalex-snapshot
Uniform service systems with k servers
inferred← citeshttps://doi.org/10.1007/s00224-017-9813-6openalex-snapshot
On the Smoothness of Paging Algorithms
inferred← citeshttps://doi.org/10.1007/s10462-022-10145-0openalex-snapshot
Putting ridesharing to the test: efficient and scalable solutions and the power of dynamic vehicle relocation
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90007-3openalex-snapshot
HARMONIC is 3-competitive for two servers
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90154-6openalex-snapshot
Competitive algorithms for the weighted server problem
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90032-2openalex-snapshot
A competitive analysis of algorithms for searching unknown scenes
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.12.011openalex-snapshot
A k-server problem with parallel requests and unit distances
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00287-9openalex-snapshot
More on random walks, electrical networks, and the harmonic -server algorithm
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00041-2openalex-snapshot
Connection caching: model and algorithms
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80060-1openalex-snapshot
Competitive k-server algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)89513-8openalex-snapshot
Paging more than one page
inferred← citeshttps://doi.org/10.1080/00207169508804431openalex-snapshot
Randomized algorithms for the on-line minimum matching problem on euclidean space
inferred← citeshttps://doi.org/10.1109/12.868024openalex-snapshot
On optimal replacement of nonuniform cache objects
inferred← citeshttps://doi.org/10.1109/ccc.1997.612318openalex-snapshot
On randomization in online computation
inferred← citeshttps://doi.org/10.1109/fscs.1990.89599openalex-snapshot
Bounds on tradeoffs between randomness and communication complexity
inferred← citeshttps://doi.org/10.1109/icde.2017.109openalex-snapshot
KeystoneML: Optimizing Pipelines for Large-Scale Advanced Analytics
inferred← citeshttps://doi.org/10.1109/istcs.1993.253459openalex-snapshot
Competitive algorithms for the weighted server problem
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185381openalex-snapshot
Competitive algorithms for layered graph traversal
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267756openalex-snapshot
The distributed k-server problem-a competitive distributed translator for k-server algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267772openalex-snapshot
A decomposition theorem and bounds for randomized server problems
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365675openalex-snapshot
On-line admission control and circuit routing for high performance computing and communication
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365677openalex-snapshot
Beyond competitive analysis [on-line algorithms]
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492476openalex-snapshot
A unified analysis of paging and caching
inferred← citeshttps://doi.org/10.1137/0220008openalex-snapshot
An Optimal On-Line Algorithm for K Servers on Trees
inferred← citeshttps://doi.org/10.1137/s0097539792224838openalex-snapshot
Lower Bounds for Randomized k -Server and Motion-Planning Algorithms
inferred← citeshttps://doi.org/10.1145/100216.100264openalex-snapshot
Online algorithms for locating checkpoints
inferred← citeshttps://doi.org/10.1145/100216.100266openalex-snapshot
Random walks on weighted graphs, and applications to on-line algorithms
inferred← citeshttps://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferred← citeshttps://doi.org/10.1145/103418.103448openalex-snapshot
The harmonic online K -server algorithm is competitive
inferred← citeshttps://doi.org/10.1145/1148109.1148133openalex-snapshot
Conflict-free coloring for intervals
inferred← citeshttps://doi.org/10.1145/129712.129717openalex-snapshot
Competitive algorithms for distributed data management (extended abstract)
inferred← citeshttps://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferred← citeshttps://doi.org/10.1145/174130.174131openalex-snapshot
Random walks on weighted graphs and applications to on-line algorithms
inferred← citeshttps://doi.org/10.1145/225058.225280openalex-snapshot
Randomized and multipointer paging with locality of reference
inferred← citeshttps://doi.org/10.1145/248052.248089openalex-snapshot
Randomness in private computations
inferred← citeshttps://doi.org/10.1145/277697.277710openalex-snapshot
Amortizing randomness in private multiparty computations
inferred← citeshttps://doi.org/10.1145/330560.330653openalex-snapshot
Replacement algorithms for object caching
inferred← citeshttps://doi.org/10.1145/331605.331606openalex-snapshot
The harmonic k -server algorithm is competitive
inferred← citeshttps://doi.org/10.1145/341800.341808openalex-snapshot
Connection caching under various models of communication
inferred← citeshttps://doi.org/10.1147/rd.386.0683openalex-snapshot
Memory versus randomization in on-line algorithms
inferred← citeshttps://doi.org/10.70675/85642a82z8494z411cz9564ze1a7ffcc89c4openalex-snapshot
Equilibrage de charge efficace et adaptatif avec contraintes temporelles pour les véhicules connectés
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.