On the public citation graph
Correctness of Gossip-Based Membership under Message Loss
0 signed · 32 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/bf02579431openalex-snapshot
On the connectivity of randomm-orientable graphs and digraphs
inferredcites →https://doi.org/10.1007/s00440-005-0434-7openalex-snapshot
Evolving sets, mixing and heat kernel bounds
inferredcites →https://doi.org/10.1007/s10922-005-4441-xopenalex-snapshot
CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays
inferredcites →https://doi.org/10.1016/j.automatica.2006.12.020openalex-snapshot
Stability robustness of networked control systems with respect to packet loss
inferredcites →https://doi.org/10.1016/j.comnet.2009.03.008openalex-snapshot
Brahms: Byzantine resilient random membership sampling
inferredcites →https://doi.org/10.1016/j.jpdc.2008.07.011openalex-snapshot
Araneola: A scalable reliable multicast system for dynamic environments
inferredcites →https://doi.org/10.1016/j.phycom.2008.01.006openalex-snapshot
On coding for reliable communication over packet networks
inferredcites →https://doi.org/10.1017/s0963548306007978openalex-snapshot
Sampling Regular Graphs and a Peer-to-Peer Network
inferredcites →https://doi.org/10.1145/1365815.1365817openalex-snapshot
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/316194.316233openalex-snapshot
The end-to-end effects of Internet path selection
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/945506.945507openalex-snapshot
Lightweight probabilistic broadcast
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20752openalex-snapshot
Cover time and mixing time of random walks on dynamic graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24550-3_37openalex-snapshot
Brief Announcement: A Stable and Robust Membership Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_21openalex-snapshot
Node Sampling Using Random Centrifugal Walks
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_15openalex-snapshot
Faster Rumor Spreading: Breaking the logn Barrier
inferred← citeshttps://doi.org/10.1007/s00446-011-0143-7openalex-snapshot
Distributed data clustering in sensor networks
inferred← citeshttps://doi.org/10.1007/s00446-015-0258-3openalex-snapshot
DEX: self-healing expanders
inferred← citeshttps://doi.org/10.1007/s00446-017-0312-4openalex-snapshot
Breaking the $$\log n$$ log n barrier on rumor spreading
inferred← citeshttps://doi.org/10.1016/j.jocs.2015.09.001openalex-snapshot
Node sampling using Random Centrifugal Walks
inferred← citeshttps://doi.org/10.1109/pdp.2011.60openalex-snapshot
Converging Quickly to Independent Uniform Random Topologies
inferred← citeshttps://doi.org/10.1109/qest.2011.39openalex-snapshot
A Modeling Framework for Gossip-based Information Spread
inferred← citeshttps://doi.org/10.1145/1582716.1582743openalex-snapshot
Correctness of gossip-based membership under message loss
inferred← citeshttps://doi.org/10.1145/1959045.1959063openalex-snapshot
Distributed computing column 41 computing over dynamic networks
inferred← citeshttps://doi.org/10.1145/2034575.2034592openalex-snapshot
Distributed computing column 43
inferred← citeshttps://doi.org/10.1145/2034575.2034593openalex-snapshot
Sybil defenses via social networks
inferred← citeshttps://doi.org/10.1145/3386164.3386180openalex-snapshot
Epidemic System Conversion on Industry 4.0's Perspective Under Dynamic Network Condition
inferred← citeshttps://doi.org/10.17760/d20467217openalex-snapshot
Algorithms for network resource allocation under adversarial dynamics and assignment constraints
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.