On the public citation graph
The need for headers: An impossibility result for communication over unreliable channels
0 signed · 30 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.1007/978-1-4471-3173-1_22openalex-snapshot
Commutativity-Based Locking for Nested Transactions
inferredcites →https://doi.org/10.1007/bfb0019807openalex-snapshot
A modular proof of correctness for a network synchronizer
inferredcites →https://doi.org/10.1016/0022-0000(90)90034-iopenalex-snapshot
Commutativity-based locking for nested transactions
inferredcites →https://doi.org/10.1016/0376-5075(76)90015-5openalex-snapshot
A data transfer protocol
inferredcites →https://doi.org/10.1109/lics.1990.113754openalex-snapshot
Proof transformations for equational theories
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/41840.41861openalex-snapshot
Constructing two-writer atomic registers
inferredcites →https://doi.org/10.1145/62546.62556openalex-snapshot
Understanding and verifying distributed algorithms using stratified decomposition
inferredcites →https://doi.org/10.1145/62546.62572openalex-snapshot
Data link layer: two impossibility results
inferredcites →https://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferredcites →https://doi.org/10.1145/72981.72985openalex-snapshot
The intractability of bounded protocols for non-FIFO channels
inferredcites →https://doi.org/10.1145/72981.72986openalex-snapshot
Tight bounds for the sequence transmission problem
inferredcites →https://doi.org/10.21236/ada198312openalex-snapshot
A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm
inferredcites →https://doi.org/10.21236/ada200983openalex-snapshot
The Data Link Layer: Two Impossibility Results
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_18openalex-snapshot
Causing Communication Closure: Safe Program Composition with Non-FIFO Channels
inferred← citeshttps://doi.org/10.1007/11603771_3openalex-snapshot
Single-Bit Messages Are Insufficient in the Presence of Duplication
inferred← citeshttps://doi.org/10.1007/11603771_4openalex-snapshot
Safe Composition of Distributed Programs Communicating over Order-Preserving Imperfect Channels
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_35openalex-snapshot
Highly concurrent logically synchronous multicast
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_15openalex-snapshot
Lower Bounds for Oblivious Single-Packet End-to-End Communication
inferred← citeshttps://doi.org/10.1007/bf01784720openalex-snapshot
Highly concurrent logically synchronous multicast
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-009-0081-9openalex-snapshot
Causing communication closure: safe program composition with reliable non-FIFO channels
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.09.025openalex-snapshot
Header-size lower bounds for end-to-end communication in memoryless networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.010openalex-snapshot
Single-bit messages are insufficient for data link over duplicating channels
inferred← citeshttps://doi.org/10.1145/195613.195651openalex-snapshot
Reliable communication over unreliable channels
inferred← citeshttps://doi.org/10.1145/301308.301364openalex-snapshot
The complexity of end-to-end communication in memoryless networks
inferred← citeshttps://doi.org/10.1145/3428278openalex-snapshot
Testing consensus implementations using communication closure
inferred← citeshttps://doi.org/10.15308/sinteza-2018-131-138openalex-snapshot
Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto
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.