On the public citation graph
DEX: Self-Healing Expanders
0 signed · 37 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-3-0346-0332-4openalex-snapshot
Discrete Groups, Expanding Graphs and Invariant Measures
inferredcites →https://doi.org/10.1007/s00446-008-0071-3openalex-snapshot
The expansion and mixing time of skip graphs with applications
inferredcites →https://doi.org/10.1007/s00446-010-0099-zopenalex-snapshot
Towards worst-case churn resistant peer-to-peer systems
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.peva.2005.01.002openalex-snapshot
Random walks in peer-to-peer networks: Algorithms and evaluation
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferredcites →https://doi.org/10.1109/focs.2006.77openalex-snapshot
Towards Secure and Scalable Computation in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/infcom.2003.1209234openalex-snapshot
Distributed construction of random expander networks
inferredcites →https://doi.org/10.1109/ipdps.2008.4536326openalex-snapshot
Picking up the Pieces: Self-Healing in reconfigurable networks
inferredcites →https://doi.org/10.1109/reldis.2005.16openalex-snapshot
Distributed Construction of a Fault-Tolerant Network from a Tree
inferredcites →https://doi.org/10.1109/sfcs.2001.959925openalex-snapshot
Building low-diameter P2P networks
inferredcites →https://doi.org/10.1137/090769752openalex-snapshot
Correctness of Gossip-Based Membership under Message Loss
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/s0097539794268765openalex-snapshot
A Chernoff Bound for Random Walks on Expander Graphs
inferredcites →https://doi.org/10.1145/1273340.1273350openalex-snapshot
Novel architectures for P2P applications
inferredcites →https://doi.org/10.1145/1582716.1582741openalex-snapshot
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
inferredcites →https://doi.org/10.1145/1582716.1582742openalex-snapshot
The flip markov chain and a randomising P2P protocol
inferredcites →https://doi.org/10.48550/arxiv.1305.4675openalex-snapshot
Algorithms for Self-Healing Networks
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-3-030-03232-6_16openalex-snapshot
Relays: A New Approach for the Finite Departure Problem in Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_34openalex-snapshot
Explicit Expanding Expanders
inferred← citeshttps://doi.org/10.1007/s00453-016-0269-xopenalex-snapshot
Explicit Expanding Expanders
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.022openalex-snapshot
Compact routing messages in self-healing trees
inferred← citeshttps://doi.org/10.1109/focs.2015.29openalex-snapshot
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1145/2833312.2833328openalex-snapshot
Compact routing messages in self-healing trees
inferred← citeshttps://doi.org/10.1145/2902945.2902959openalex-snapshot
Distributed Algorithmic Foundations of Dynamic Networks
inferred← citeshttps://doi.org/10.1145/2935764.2935783openalex-snapshot
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
inferred← citeshttps://doi.org/10.1145/3087801.3087827openalex-snapshot
Distributed MST and Routing in Almost Mixing Time
inferred← citeshttps://doi.org/10.1145/3369740.3369786openalex-snapshot
Fully Compact Routing in Low Memory Self-Healing Trees
inferred← citeshttps://doi.org/10.17760/d20247295openalex-snapshot
Robust local algorithms for communication and stability in distributed networks
inferred← citeshttps://doi.org/10.3390/fi16020043openalex-snapshot
A Spectral Gap-Based Topology Control Algorithm for Wireless Backhaul Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03042openalex-snapshot
Self-healing Routing and Other Problems in Compact Memory.
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.