On the public citation graph
Collective asynchronous reading with polylogarithmic worst-case overhead
0 signed · 43 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.1006/inco.1994.1099openalex-snapshot
Tolerating a Linear Number of Faults in Networks of Bounded Degree
inferredcites →https://doi.org/10.1006/jagm.1996.0003openalex-snapshot
Parallel Algorithms with Processor Failures and Delays
inferredcites →https://doi.org/10.1006/jagm.1997.0907openalex-snapshot
Spreading Rumors Rapidly Despite an Adversary
inferredcites →https://doi.org/10.1007/978-3-540-39989-6_16openalex-snapshot
Efficient Gossip and Robust Distributed Computation
inferredcites →https://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferredcites →https://doi.org/10.1007/bf02277667openalex-snapshot
Efficient parallel algorithms can be made robust
inferredcites →https://doi.org/10.1007/s004460100067openalex-snapshot
An adaptive collect algorithm with applications
inferredcites →https://doi.org/10.1007/s004930050049openalex-snapshot
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
inferredcites →https://doi.org/10.1016/0020-0190(91)90156-copenalex-snapshot
Achieving optimal CRCW PRAM fault-tolerance
inferredcites →https://doi.org/10.1109/sfcs.1986.11openalex-snapshot
Atomic shared register access by asynchronous hardware
inferredcites →https://doi.org/10.1109/sfcs.1994.365676openalex-snapshot
A theory of competitive analysis for distributed algorithms
inferredcites →https://doi.org/10.1137/0221063openalex-snapshot
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
inferredcites →https://doi.org/10.1137/s0097539790192647openalex-snapshot
Bounded Concurrent Time-Stamping
inferredcites →https://doi.org/10.1137/s0097539794319126openalex-snapshot
Algorithms for the Certified Write-All Problem
inferredcites →https://doi.org/10.1137/s0097539795279463openalex-snapshot
Atomic Snapshots in O ( n log n ) Operations
inferredcites →https://doi.org/10.1145/129712.129717openalex-snapshot
Competitive algorithms for distributed data management (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129768openalex-snapshot
Competitive distributed job scheduling (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129776openalex-snapshot
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
inferredcites →https://doi.org/10.1145/153724.153741openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/234533.234556openalex-snapshot
How to share concurrent wait-free variables
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/301308.301362openalex-snapshot
Resource discovery in distributed networks
inferredcites →https://doi.org/10.1145/378580.378685openalex-snapshot
Towards practical deteministic write-all algorithms
inferredcites →https://doi.org/10.1145/380752.380790openalex-snapshot
Loss-less condensers, unbalanced expanders, and extractors
inferredcites →https://doi.org/10.1145/380752.380796openalex-snapshot
Spatial gossip and resource location protocols
inferredcites →https://doi.org/10.1145/41840.41841openalex-snapshot
Epidemic algorithms for replicated database maintenance
inferredcites →https://doi.org/10.1145/780542.780581openalex-snapshot
Work-competitive scheduling for cooperative computing with dynamic groups
inferredcites →https://doi.org/10.1145/872035.872075openalex-snapshot
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
inferredcites →https://doi.org/10.1145/97444.97701openalex-snapshot
Wait-free data structures in the asynchronous PRAM model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11864219_22openalex-snapshot
Time and Communication Efficient Consensus for Crash Failures
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_26openalex-snapshot
On the Communication Surplus Incurred by Faulty Processors
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_33openalex-snapshot
Trusted Computing for Fault-Prone Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_15openalex-snapshot
Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
inferred← citeshttps://doi.org/10.1007/s00446-011-0144-6openalex-snapshot
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
inferred← citeshttps://doi.org/10.1016/j.ic.2017.02.003openalex-snapshot
Doing-it-All with bounded work and communication
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.07.007openalex-snapshot
On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts
inferred← citeshttps://doi.org/10.1145/1060590.1060698openalex-snapshot
Cooperative asynchronous update of shared memory
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09314openalex-snapshot
Asynchronous Exclusive Selection
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.