On the public citation graph
Quickly Routing Searches Without Having to Move Content
0 signed · 62 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/11587552_5openalex-snapshot
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
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_9openalex-snapshot
Can Heterogeneity Make Gnutella Scalable?
inferredcites →https://doi.org/10.1007/978-3-540-30229-2_2openalex-snapshot
A Content Model for Evaluating Peer-to-Peer Searching Techniques
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_20openalex-snapshot
Studying Search Networks with SIL
inferredcites →https://doi.org/10.1103/physreve.64.046135openalex-snapshot
Search in power-law networks
inferredcites →https://doi.org/10.1109/glocom.2000.892042openalex-snapshot
Generating network topologies that obey power laws
inferredcites →https://doi.org/10.1109/icdcs.2002.1022237openalex-snapshot
Improving search in peer-to-peer networks
inferredcites →https://doi.org/10.1109/icdcs.2002.1022239openalex-snapshot
Routing indices for peer-to-peer systems
inferredcites →https://doi.org/10.1109/icde.2003.1260781openalex-snapshot
Designing a super-peer network
inferredcites →https://doi.org/10.1109/infcom.2003.1209239openalex-snapshot
Modeling peer-peer file sharing systems
inferredcites →https://doi.org/10.1109/sfcs.2001.959925openalex-snapshot
Building low-diameter P2P networks
inferredcites →https://doi.org/10.1145/1165389.945475openalex-snapshot
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
inferredcites →https://doi.org/10.1145/2591635.2667182openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/514191.514206openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/633025.633043openalex-snapshot
Replication strategies in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/775152.775229openalex-snapshot
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
inferredcites →https://doi.org/10.1145/863955.864000openalex-snapshot
Making gnutella-like P2P systems scalable
inferredcites →https://doi.org/10.1145/945445.945475openalex-snapshot
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
inferredcites →https://doi.org/10.5555/1045658.1045662openalex-snapshot
A content model for evaluating peer-to-peer searching techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11587552_5openalex-snapshot
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
inferred← citeshttps://doi.org/10.1007/978-3-540-77220-0_40openalex-snapshot
Structuring Unstructured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02472-6_8openalex-snapshot
Employing Data Driven Random Membership Subset Algorithm for QoS-Aware Peer-to-Peer Streaming
inferred← citeshttps://doi.org/10.1007/s00446-015-0246-7openalex-snapshot
Efficient distributed computation of distance sketches in networks
inferred← citeshttps://doi.org/10.1007/s10723-011-9189-9openalex-snapshot
A Read-Only Distributed Hash Table
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.10.005openalex-snapshot
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.01.002openalex-snapshot
Efficient random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1016/j.jss.2015.11.038openalex-snapshot
Alleviating the topology mismatch problem in distributed overlay networks: A survey
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.7.1971openalex-snapshot
An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/fgcn.2007.197openalex-snapshot
Routing Based Load Balancing for Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1109/his.2007.22openalex-snapshot
Performance Trade-off Exploration by Query-Trail-Mediated Topology Reconstruction in Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1109/icccn.2006.286312openalex-snapshot
Multi-Attribute Range Queries on Read-Only DHT
inferred← citeshttps://doi.org/10.1109/icpads.2009.98openalex-snapshot
Efficient Update Propagation by Speculating Replica Locations on Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195727openalex-snapshot
Near-optimal random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.309openalex-snapshot
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536254openalex-snapshot
DHT-assisted probabilistic exhaustive search in unstructured P2P networks
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470932openalex-snapshot
Deetoo: Scalable unstructured search built on a structured overlay
inferred← citeshttps://doi.org/10.1109/iti.2006.1708549openalex-snapshot
A distributed peer system for public administration content retrieval
inferred← citeshttps://doi.org/10.1109/pdcat.2009.49openalex-snapshot
A Biased k-Random Walk to Find Useful Files in Unstructured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/tc.2007.70837openalex-snapshot
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/tpds.2007.20openalex-snapshot
An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity
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/1151374.1151386openalex-snapshot
Random walk based node sampling in self-organizing networks
inferred← citeshttps://doi.org/10.1145/1582716.1582745openalex-snapshot
Fast distributed random walks
inferred← citeshttps://doi.org/10.1145/1993806.1993853openalex-snapshot
A tight unconditional lower bound on distributed randomwalk computation
inferred← citeshttps://doi.org/10.1145/2312005.2312060openalex-snapshot
Efficient computation of distance sketches in distributed networks
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.563openalex-snapshot
Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
inferred← citeshttps://doi.org/10.17863/cam.74543openalex-snapshot
The Impact of Randomisation in Load Balancing and Random Walks
inferred← citeshttps://doi.org/10.20965/jaciii.2013.p0872openalex-snapshot
On the Impact of Path Redundancy Awareness in Evolutionary P2P Networking
inferred← citeshttps://doi.org/10.2197/ipsjtrans.3.110openalex-snapshot
A Strategy for Efficient Update Propagation on Peer-to-Peer Based Content Distribution Networks
inferred← citeshttps://doi.org/10.3233/his-2008-5205openalex-snapshot
Query-trail-mediated topology reconstruction for exploring performance trade-off in unstructured P2P networks
inferred← citeshttps://doi.org/10.32657/10356/58914openalex-snapshot
Random walks in distributed networks and their applications
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2906openalex-snapshot
A Tight Lower Bound on Distributed Random Walk Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1210openalex-snapshot
Efficient Computation of Distance Sketches in Distributed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1363openalex-snapshot
Near-Optimal Random Walk Sampling in Distributed 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.