On the public citation graph
Practical Locality-Awareness for Large Scale Information Sharing
0 signed · 43 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/3-540-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/3-540-45748-8_5openalex-snapshot
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_15openalex-snapshot
Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead
inferredcites →https://doi.org/10.1145/1007912.1007916openalex-snapshot
Compact name-independent routing with minimum stretch
inferredcites →https://doi.org/10.1145/1367064.1367077openalex-snapshot
Compact name-independent routing with minimum stretch
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3342openalex-snapshot
An effective single‐hop distributed hash table with high lookup performance and low traffic overhead
inferred← citeshttps://doi.org/10.1007/11847366_30openalex-snapshot
HAND: An Overlay Optimization Algorithm in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-09751-0_1openalex-snapshot
Peer-to-Peer Networking and Applications: Synopsis and Research Directions
inferred← citeshttps://doi.org/10.1007/978-1-4471-4552-3_5openalex-snapshot
On the Feasibility of Dynamic, Efficient, and Scalable Name-Based Discovery Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_33openalex-snapshot
Shades: Expediting Kademlia’s Lookup Process
inferred← citeshttps://doi.org/10.1007/s00453-010-9398-9openalex-snapshot
Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1016/b978-0-12-374214-8.x0001-3openalex-snapshot
P2P Networking and Applications
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.12.041openalex-snapshot
An application layer multicast approach based on topology-aware clustering
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.01.014openalex-snapshot
Shades: Expediting Kademlia’s lookup process
inferred← citeshttps://doi.org/10.1016/j.robot.2019.02.005openalex-snapshot
Shared representations of actions for alternative suggestion with incomplete information
inferred← citeshttps://doi.org/10.1109/icdcsw.2006.76openalex-snapshot
Network-Aware Overlays with Network Coordinates
inferred← citeshttps://doi.org/10.1109/icde.2006.50openalex-snapshot
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
inferred← citeshttps://doi.org/10.1109/icra.2012.6224755openalex-snapshot
Improvisational goal-oriented action recommendation under incomplete knowledge base
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370659openalex-snapshot
PON: Exploiting Proximity on Overlay Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160951openalex-snapshot
Relaxed-2-Chord: Efficiency, flexibility and provable stretch
inferred← citeshttps://doi.org/10.1109/p2p.2006.17openalex-snapshot
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
inferred← citeshttps://doi.org/10.1109/p2p.2007.13openalex-snapshot
Fabric: Synergistic Proximity Neighbour Selection Method
inferred← citeshttps://doi.org/10.1109/p2p.2013.6688703openalex-snapshot
Kaleidoscope: Adding colors to Kademlia
inferred← citeshttps://doi.org/10.1109/smc.2013.692openalex-snapshot
The Representation of Weighted Action-Coupled Semantic Network and Spreading Activation Model for Improvisational Action
inferred← citeshttps://doi.org/10.1109/srds.2008.31openalex-snapshot
Towards Reliable Reputations for Dynamic Networked Systems
inferred← citeshttps://doi.org/10.1109/tencon.2005.301136openalex-snapshot
Improved Dynamic Multimedia Resource Adaptation-based Peer-to-Peer System through Locality-based Clustering and Service
inferred← citeshttps://doi.org/10.1109/tst.2012.6151903openalex-snapshot
Rise and fall of the peer-to-peer empire
inferred← citeshttps://doi.org/10.1145/1146381.1146403openalex-snapshot
On the topologies formed by selfish peers
inferred← citeshttps://doi.org/10.1145/1658939.1658956openalex-snapshot
Scaling all-pairs overlay routing
inferred← citeshttps://doi.org/10.1145/1921168.1921195openalex-snapshot
Scalable routing on flat names
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.4230/dagsemproc.06131.5openalex-snapshot
Taming Dynamic and Selfish Peers
inferred← citeshttps://doi.org/10.48550/arxiv.0903.4113openalex-snapshot
Overlay Structure for Large Scale Content Sharing: Leveraging Geography as the Basis for Routing Locality
inferred← citeshttps://doi.org/10.48550/arxiv.1302.6156openalex-snapshot
Scalable Routing on Flat Names
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0508021openalex-snapshot
Toward Compact Interdomain Routing
inferred← citeshttps://doi.org/10.70675/a3e3460cz2738z496dz96e9z0344437dee1bopenalex-snapshot
Towards federated social infrastructures for plug-based decentralized social 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.