On the public citation graph

Scalable blind search and broadcasting over Distributed Hash Tables

0 signed · 31 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.
Claim with ORCID
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.
See reference health

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/978-3-540-30183-7_9openalex-snapshot
Comparing the Performance of Distributed Hash Tables Under Churn
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_28openalex-snapshot
Efficient Broadcast in Structured P2P Networks
inferredcites →https://doi.org/10.1109/ccnc.2005.1405138openalex-snapshot
A P2P overlay architecture for personalized resource discovery, access, and sharing over the internet
inferredcites →https://doi.org/10.1109/icdcs.2002.1022237openalex-snapshot
Improving search in peer-to-peer networks
inferredcites →https://doi.org/10.1109/iscc.2006.157openalex-snapshot
Tag Routing for Efficient Blind Search in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/p2p.2006.4openalex-snapshot
Analytical Study on Improving DHT Lookup Performance under Churn
inferredcites →https://doi.org/10.1137/s0036144598347035openalex-snapshot
Matrices, Vector Spaces, and Information Retrieval
inferredcites →https://doi.org/10.1145/1065983.1065999openalex-snapshot
Peer-to-peer internet telephony using SIP
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.383071openalex-snapshot
Chord
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/514203.514206openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/584792.584842openalex-snapshot
A local search mechanism for peer-to-peer networks
inferredcites →https://doi.org/10.1145/584838.584842openalex-snapshot
A local search mechanism for peer-to-peer networks
inferredcites →https://doi.org/10.1145/774763.774777openalex-snapshot
pSearch
inferredcites →https://doi.org/10.2307/417141openalex-snapshot
WordNet: An electronic lexical database . Ed. by Christiane Fellbaum. Cambridge, MA: MIT Press, 1998. Pp. xxii, 423.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.comcom.2010.09.005openalex-snapshot
PISA: A framework for integrating uncooperative peers into P2P-based federated search
inferred← citeshttps://doi.org/10.1016/j.future.2012.08.009openalex-snapshot
MatchTree: Flexible, scalable, and fault-tolerant wide-area resource discovery with distributed matchmaking and aggregation
inferred← citeshttps://doi.org/10.1109/ccgrid.2014.14openalex-snapshot
Elastic MapReduce Execution
inferred← citeshttps://doi.org/10.1109/ccnc.2009.4784805openalex-snapshot
Optimally Efficient Multicast in Structured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/ccnc.2011.5766542openalex-snapshot
Considering complex search techniques in DHTs under churn
inferred← citeshttps://doi.org/10.1109/ic2e.2013.15openalex-snapshot
Katana: Generalized Data Processing on Peer-to-Peer Overlays
inferred← citeshttps://doi.org/10.1109/ipdps.2011.315openalex-snapshot
Parallel Processing Framework on a P2P System Using Map and Reduce Primitives
inferred← citeshttps://doi.org/10.1109/srds.2014.40openalex-snapshot
Overnesia: A Resilient Overlay Network for Virtual Super-Peers
inferred← citeshttps://doi.org/10.1145/2287076.2287105openalex-snapshot
PonD
inferred← citeshttps://doi.org/10.1504/ijipt.2008.019291openalex-snapshot
Management of peer-to-peer overlays
inferred← citeshttps://doi.org/10.3923/itj.2008.728.736openalex-snapshot
TapMulti: A Scalable and Low-Delay Application-Layer Multicast Protocol on Tapestry Overlay Network
inferred← citeshttps://doi.org/10.4108/icst.collaboratecom.2010.43openalex-snapshot
On the design of autonomic, decentralized VPNs
inferred← citeshttps://doi.org/10.7763/ijiee.2012.v2.70openalex-snapshot
Model of Complex Searching Over Structured P2POverlay under Dynamic Environment
inferred← citeshttps://doi.org/10.7763/ijmlc.2015.v5.492openalex-snapshot
The Comparison between Forward and Backward Chaining
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.