On the public citation graph
Competitive distributed decision-making
0 signed · 51 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/0012-365x(89)90096-4openalex-snapshot
An on-line graph coloring algorithm with sublinear performance ratio
inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-snapshot
Shortest paths without a map
inferredcites →https://doi.org/10.1109/cdc.1985.268670openalex-snapshot
Intractable problems in control theory
inferredcites →https://doi.org/10.1109/fscs.1990.89566openalex-snapshot
Competitive k-server algorithms
inferredcites →https://doi.org/10.1109/fscs.1990.89567openalex-snapshot
Randomized online graph coloring
inferredcites →https://doi.org/10.1109/fscs.1990.89568openalex-snapshot
Coloring inductive graphs on-line
inferredcites →https://doi.org/10.1109/sfcs.1981.45openalex-snapshot
The complexity of distributed concurrency control
inferredcites →https://doi.org/10.1109/sfcs.1991.185354openalex-snapshot
On-line scheduling in the presence of overload
inferredcites →https://doi.org/10.1109/sfcs.1991.185355openalex-snapshot
Dynamic scheduling on parallel machines
inferredcites →https://doi.org/10.1109/sfcs.1991.185361openalex-snapshot
Scheduling parallel machines on-line
inferredcites →https://doi.org/10.1109/sfcs.1991.185381openalex-snapshot
Competitive algorithms for layered graph traversal
inferredcites →https://doi.org/10.1109/sfcs.1991.185382openalex-snapshot
How to learn an unknown environment
inferredcites →https://doi.org/10.1109/sfcs.1991.185383openalex-snapshot
Walking an unknown street with bounded detour
inferredcites →https://doi.org/10.1109/sfcs.1993.366886openalex-snapshot
On the value of information in coordination games
inferredcites →https://doi.org/10.1137/0306011openalex-snapshot
A Counterexample in Stochastic Optimum Control
inferredcites →https://doi.org/10.1137/0324038openalex-snapshot
Intractable Problems in Control Theory
inferredcites →https://doi.org/10.1137/siconopenalex-snapshot
SIAM Journal on Control and Optimization
inferredcites →https://doi.org/10.1145/100216.100266openalex-snapshot
Random walks on weighted graphs, and applications to on-line algorithms
inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferredcites →https://doi.org/10.1145/103418.103419openalex-snapshot
Navigating in unfamiliar geometric terrain
inferredcites →https://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferredcites →https://doi.org/10.1145/103418.103448openalex-snapshot
The harmonic online K -server algorithm is competitive
inferredcites →https://doi.org/10.1145/103418.103450openalex-snapshot
Lower bounds for randomized k-server and motion-planning algorithms
inferredcites →https://doi.org/10.1145/112600.112606openalex-snapshot
On the value of information in distributed decision-making (extended abstract)
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.1147/rd.386.0683openalex-snapshot
Memory versus randomization in on-line algorithms
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.2001.3057openalex-snapshot
Delayed Information and Action in On-Line Algorithms
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/3-540-48321-7_24openalex-snapshot
Optimal, distributed decision-making: The case of no communication
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_181openalex-snapshot
Scheduling in critical real-time systems: a manifesto
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_47openalex-snapshot
Distributed near-optimal matching
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_82openalex-snapshot
Computational aspects of organization theory
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-1-4613-0307-7_6openalex-snapshot
Complexity Issues in Bilevel Linear Programming
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/bfb0022137openalex-snapshot
On real-time and non real-time distributed computing
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.04.001openalex-snapshot
A glimpse at Christos H. Papadimitriou
inferred← citeshttps://doi.org/10.1109/etfa.1995.496774openalex-snapshot
A general approach to real-time message scheduling over distributed broadcast channels
inferred← citeshttps://doi.org/10.1109/tro.2010.2072271openalex-snapshot
Multirobot Forest Coverage for Weighted and Unweighted Terrain
inferred← citeshttps://doi.org/10.1145/167088.167127openalex-snapshot
Linear programming without the matrix
inferred← citeshttps://doi.org/10.1145/301308.301387openalex-snapshot
Optimal, distributed decision-making
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.