On the public citation graph

Proceedings of the 2013 ACM symposium on Principles of distributed computing

0 signed · 13 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_15openalex-snapshot
Consistency in Distributed Systems
inferred← citeshttps://doi.org/10.1016/j.adhoc.2017.06.005openalex-snapshot
PACK: Path coloring based k -connectivity detection algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2017.11.005openalex-snapshot
DECK: A distributed, asynchronous and exact k-connectivity detection algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.07.004openalex-snapshot
How to achieve adaptive security for asynchronous BFT?
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.029openalex-snapshot
Lessons from the Congested Clique applied to MapReduce
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.006openalex-snapshot
Proof-labeling schemes: Broadcast, unicast and in between
inferred← citeshttps://doi.org/10.1080/17445761003691890openalex-snapshot
A simple Byzantine-fault-tolerant algorithm for a multi-writer regular register
inferred← citeshttps://doi.org/10.1137/141002281openalex-snapshot
Single Pass Spectral Sparsification in Dynamic Streams
inferred← citeshttps://doi.org/10.1145/3364626.3364635openalex-snapshot
The Splendors and Miseries of Rounds
inferred← citeshttps://doi.org/10.1145/3374857.3374866openalex-snapshot
PODC 2019 Review
inferred← citeshttps://doi.org/10.1145/3490148.3538588openalex-snapshot
A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables
inferred← citeshttps://doi.org/10.1145/508352.508355openalex-snapshot
The state of the art in locally distributed Web-server systems
inferred← citeshttps://doi.org/10.3390/math8050757openalex-snapshot
Asynchronous Computability Theorem in Arbitrary Solo Models
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.