On the public citation graph
F‐Chord: Improved uniform routing on Chord
0 signed · 24 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.1109/jsac.2003.818784openalex-snapshot
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
inferredcites →https://doi.org/10.1109/jsac.2003.818805openalex-snapshot
On the Fundamental Tradeoffs Between Routing Table Size and Network Diameter in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/ptpsys.2004.13openalex-snapshot
Non-Uniform Deterministic Routing on F-Chord (α)
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1142/9789812798107openalex-snapshot
Combinatorial Group Testing and Its Applications
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.3036openalex-snapshot
Structural‐based tunneling: preserving mutual anonymity for circular P2P networks
inferred← citeshttps://doi.org/10.1002/ett.3012openalex-snapshot
Binary search routing equivalent (BSRE): a circular design for structured P2P networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-5483-0_3openalex-snapshot
Hierarchical Neighbor Maintenance
inferred← citeshttps://doi.org/10.1007/978-94-007-1839-5_181openalex-snapshot
Hierarchical Base-k Chord Based on Semantic Networks
inferred← citeshttps://doi.org/10.1088/1742-6596/910/1/012022openalex-snapshot
Novel Search Schemes for Distributed Cooperative Data Centers
inferred← citeshttps://doi.org/10.1109/ccnc.2015.7157949openalex-snapshot
Preserving receiver's anonymity for circular structured P2P networks
inferred← citeshttps://doi.org/10.1109/cdee.2010.58openalex-snapshot
T-Chord: A Two-Layer Routing Model for Chord
inferred← citeshttps://doi.org/10.1109/csss.2012.181openalex-snapshot
Analysis and Improvement of Chord Protocol
inferred← citeshttps://doi.org/10.1109/icaci.2012.6463146openalex-snapshot
Research of higher order Chord routing algorithm
inferred← citeshttps://doi.org/10.1109/scc.2015.80openalex-snapshot
MIDEP: Multiparty Identity Establishment Protocol for Decentralized Collaborative Services
inferred← citeshttps://doi.org/10.1155/2014/830682openalex-snapshot
A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks
inferred← citeshttps://doi.org/10.12694/scpe.v15i1.968openalex-snapshot
TTL-Chord: A Chord-based Approach for Semantic Web Services Discovery
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.