On the public citation graph
Efficiency of semisynchronous versus asynchronous networks
0 signed · 33 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.1030openalex-snapshot
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty
inferredcites →https://doi.org/10.1007/bf02252683openalex-snapshot
Using mappings to prove timing properties
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1145/135419.135459openalex-snapshot
The impact of time on the session problem
inferredcites →https://doi.org/10.1145/174644.174649openalex-snapshot
Bounds on the time to reach agreement in the presence of timing uncertainty
inferredcites →https://doi.org/10.1145/2402.322387openalex-snapshot
Efficiency of Synchronous Versus Asynchronous Distributed Systems
inferredcites →https://doi.org/10.1145/322063.322067openalex-snapshot
Asynchronous Iterative Methods for Multiprocessors
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1145/800105.803398openalex-snapshot
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11561927_8openalex-snapshot
Obstruction-Free Algorithms Can Be Practically Wait-Free
inferred← citeshttps://doi.org/10.1007/978-981-16-7993-3_41openalex-snapshot
Asycome: A JointCloud Data Asynchronous Collaboration Mechanism Based on Blockchain
inferred← citeshttps://doi.org/10.1007/bfb0030677openalex-snapshot
Rapid convergence of a local load balancing algorithm for asynchronous rings
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-008-0066-0openalex-snapshot
Sequentially consistent versus linearizable counting networks
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00022-gopenalex-snapshot
Hyper-ring connection machines
inferred← citeshttps://doi.org/10.1016/b978-0-443-40439-9.00002-6openalex-snapshot
Consensus mechanisms insights, performance, and challenges
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.004openalex-snapshot
Improved time bounds for linearizable implementations of abstract data types
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00155-5openalex-snapshot
Time bounds on synchronization in a periodic distributed system
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00243-6openalex-snapshot
Rapid convergence of a local load balancing algorithm for asynchronous rings
inferred← citeshttps://doi.org/10.1109/ipdps.2014.77openalex-snapshot
Improved Time Bounds for Linearizable Implementations of Abstract Data Types
inferred← citeshttps://doi.org/10.1109/ipps.1997.580978openalex-snapshot
The impact of timing on linearizability in counting networks
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3133933openalex-snapshot
Three-Dimensional Tradeoffs for Consensus Algorithms: A Review
inferred← citeshttps://doi.org/10.1137/s009753979936094xopenalex-snapshot
The Impact of Timing Knowledge on the Session Problem
inferred← citeshttps://doi.org/10.1145/167088.167105openalex-snapshot
Fast asynchronous Byzantine agreement with optimal resilience
inferred← citeshttps://doi.org/10.1145/174644.174649openalex-snapshot
Bounds on the time to reach agreement in the presence of timing uncertainty
inferred← citeshttps://doi.org/10.1145/197917.198143openalex-snapshot
The impact of synchronization on the session problem
inferred← citeshttps://doi.org/10.1145/301308.301342openalex-snapshot
Sequentially consistent versus linearizable counting networks
inferred← citeshttps://doi.org/10.1145/3816782.3819207openalex-snapshot
Fast Concurrent Primitives Despite Contention
inferred← citeshttps://doi.org/10.2200/s00551ed1v01y201311dct012openalex-snapshot
Impossibility Results for Distributed Computing
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot
Notes on Theory of Distributed Systems
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.