On the public citation graph

Proceedings of the 39th Symposium on Principles of Distributed Computing

0 signed · 20 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-0-8176-4751-3_16openalex-snapshot
Advances in the Theory of Complex Networks
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90054-xopenalex-snapshot
Asynchronous Byzantine agreement protocols
inferred← citeshttps://doi.org/10.1016/j.aim.2023.109241openalex-snapshot
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111264openalex-snapshot
Graph-theoretic approaches for analyzing the resilience of distributed control systems: A tutorial and survey
inferred← citeshttps://doi.org/10.1016/j.isatra.2024.04.015openalex-snapshot
Resilient distributed optimization for cyber–physical systems under adversarial environments: An event-based method
inferred← citeshttps://doi.org/10.1016/j.jastp.2025.106418openalex-snapshot
Characterizing long-term cosmic ray time series with geometric network curvature metrics
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.038openalex-snapshot
A survey of size counting in population protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.020openalex-snapshot
Uniform bipartition in the population protocol model with arbitrary graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114324openalex-snapshot
On geometric shape construction via growth operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115073openalex-snapshot
Asynchronous fully-decentralized SGD in the cluster-based model
inferred← citeshttps://doi.org/10.1145/1189256.1189258openalex-snapshot
Speculative execution in a distributed file system
inferred← citeshttps://doi.org/10.1145/28869.28876openalex-snapshot
Optimal clock synchronization
inferred← citeshttps://doi.org/10.1145/3409964.3461788openalex-snapshot
Finding Subgraphs in Highly Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3444692openalex-snapshot
A Survey on Edge Performance Benchmarking
inferred← citeshttps://doi.org/10.1145/3465084.3467901openalex-snapshot
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
inferred← citeshttps://doi.org/10.1145/3477114.3488761openalex-snapshot
Redundancy in cost functions for Byzantine fault-tolerant federated learning
inferred← citeshttps://doi.org/10.1145/3490148.3538590openalex-snapshot
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
inferred← citeshttps://doi.org/10.1145/3605098.3635918openalex-snapshot
Efficient Time Slot Recovery Protocol for Wireless Networks
inferred← citeshttps://doi.org/10.1145/3700838.3703660openalex-snapshot
A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1
inferred← citeshttps://doi.org/10.1177/1550147718762086openalex-snapshot
Cluster-based efficient information dissemination in dynamic networks
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.