On the public citation graph

VoroNet: A scalable object network based on Voronoi tessellations

0 signed · 64 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/11549468_126openalex-snapshot
Long Range Contacts in Overlay Networks
inferredcites →https://doi.org/10.1007/11561927_46openalex-snapshot
Could any Graph be Turned into a Small-World?
inferredcites →https://doi.org/10.1007/3-540-45414-4_19openalex-snapshot
Efficient Routing in Networks with Long Range Contacts
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-45545-0_10openalex-snapshot
Robust Geometric Computation Based on Topological Consistency
inferredcites →https://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferredcites →https://doi.org/10.1016/j.tcs.2005.12.008openalex-snapshot
Could any graph be turned into a small-world?
inferredcites →https://doi.org/10.1017/cbo9781139172998openalex-snapshot
Algorithmic Geometry
inferredcites →https://doi.org/10.1038/35022643openalex-snapshot
Navigation in a small world
inferredcites →https://doi.org/10.1109/5.163412openalex-snapshot
Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic
inferredcites →https://doi.org/10.1109/icc.2003.1204216openalex-snapshot
Localized routing for wireless ad hoc networks
inferredcites →https://doi.org/10.1109/ipdps.2007.370210openalex-snapshot
VoroNet: A scalable object network based on Voronoi tessellations
inferredcites →https://doi.org/10.1145/1073814.1073827openalex-snapshot
Skip-webs
inferredcites →https://doi.org/10.1145/335305.335325openalex-snapshot
The small-world phenomenon
inferredcites →https://doi.org/10.1145/383059.383071openalex-snapshot
Chord

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118601365.ch5openalex-snapshot
Large‐Scale Peer‐to‐Peer Game Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-78446-5_15openalex-snapshot
Peer-to-Peer Metadata Management for Knowledge Discovery Applications in Grids
inferred← citeshttps://doi.org/10.1007/978-3-031-22677-9_23openalex-snapshot
AS-cast: Lock Down the Traffic of Decentralized Content Indexing at the Edge
inferred← citeshttps://doi.org/10.1007/978-3-031-55182-6openalex-snapshot
Foundations of Vector Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-319-23237-9_24openalex-snapshot
Omentum - A Peer-to-Peer Approach for Internet-Scale Virtual Microscopy
inferred← citeshttps://doi.org/10.1007/978-3-319-96247-4_14openalex-snapshot
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_23openalex-snapshot
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_10openalex-snapshot
Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-38541-4_18openalex-snapshot
Distributed Architecture for a Peer-to-Peer-Based Virtual Microscope
inferred← citeshttps://doi.org/10.1007/s13174-011-0037-8openalex-snapshot
Placement of applications in computing clouds using Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.future.2015.07.020openalex-snapshot
dragon: Multidimensional range queries on distributed aggregation trees
inferred← citeshttps://doi.org/10.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.04.008openalex-snapshot
Multidimensional range queries on hierarchical Voronoi overlays
inferred← citeshttps://doi.org/10.1109/access.2020.3023479openalex-snapshot
AoI-Based Multicast Routing Over Voronoi Overlays With Minimal Overhead
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.2012.6181030openalex-snapshot
An architecture for complex P2P systems
inferred← citeshttps://doi.org/10.1109/cit.2011.97openalex-snapshot
VoroStore -- A Secure and Reliable Data Storage for Peer-to-Peer-Based MMVEs
inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00040openalex-snapshot
Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data
inferred← citeshttps://doi.org/10.1109/cse.2009.293openalex-snapshot
Efficient Broadcast on Area of Interest in Voronoi Overlays
inferred← citeshttps://doi.org/10.1109/dsn.2010.5544919openalex-snapshot
Blue Banana: resilience to avatar mobility in distributed MMOGs
inferred← citeshttps://doi.org/10.1109/grid.2008.4662796openalex-snapshot
RW-OGS: An optimized randomwalk protocol for resource discovery in large scale dynamic Grids
inferred← citeshttps://doi.org/10.1109/icacea.2015.7164762openalex-snapshot
A novel replica placement strategy using binary item-to-item collaborative filtering for efficient voronoi-based cloud-oriented content delivery network
inferred← citeshttps://doi.org/10.1109/icdcs.2009.70openalex-snapshot
Autonomous Resource Selection for Decentralized Utility Computing
inferred← citeshttps://doi.org/10.1109/icdcs.2014.37openalex-snapshot
Polystyrene: the Decentralized Data Shape That Never Dies
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.120openalex-snapshot
A Distributed Greedy Heuristic for Computing Voronoi Tessellations with Applications Towards Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/iscc.2008.4625648openalex-snapshot
VoRaQue: Range queries on Voronoi overlays
inferred← citeshttps://doi.org/10.1109/netgames.2013.6820617openalex-snapshot
Manycraft: Scaling minecraft to millions
inferred← citeshttps://doi.org/10.1109/p2p.2010.5569973openalex-snapshot
Hivory: Range Queries on Hierarchical Voronoi Overlays
inferred← citeshttps://doi.org/10.1109/p2p.2014.6934297openalex-snapshot
LAYSTREAM: Composing standard gossip protocols for live video streaming
inferred← citeshttps://doi.org/10.1109/percomw.2011.5766938openalex-snapshot
P2P network for storage and query of a spatio-temporal flow of events
inferred← citeshttps://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferred← citeshttps://doi.org/10.1145/2382570.2382573openalex-snapshot
The XtreemOS Resource Selection Service
inferred← citeshttps://doi.org/10.1145/2543581.2543583openalex-snapshot
XL peer-to-peer pub/sub systems
inferred← citeshttps://doi.org/10.1145/3709693openalex-snapshot
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
inferred← citeshttps://doi.org/10.1186/s43067-025-00271-4openalex-snapshot
Comparison of approaches for tessellating a business area using Voronoi diagrams
inferred← citeshttps://doi.org/10.13140/2.1.2152.8964openalex-snapshot
Approximate Nearest Neighbor Search Small World Approach
inferred← citeshttps://doi.org/10.13140/rg.2.1.3046.1283openalex-snapshot
Growing homophilic networks are natural optimal navigable small worlds
inferred← citeshttps://doi.org/10.1371/journal.pone.0158162openalex-snapshot
Growing Homophilic Networks Are Natural Navigable Small Worlds
inferred← citeshttps://doi.org/10.14778/3476249.3476255openalex-snapshot
A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search
inferred← citeshttps://doi.org/10.15514/syrcose-2010-4-30openalex-snapshot
Metrized Small World Approach for Nearest Neighbor Search
inferred← citeshttps://doi.org/10.26083/tuprints-00002198openalex-snapshot
Peer-to-Peer Concepts for Emergency First Response
inferred← citeshttps://doi.org/10.3103/s1060992x13030090openalex-snapshot
Pattern recognition and increasing of the computational efficiency of a parallel realization of the probabilistic neural network with homogeneity testing
inferred← citeshttps://doi.org/10.4018/978-1-61520-686-5.ch036openalex-snapshot
Enforcing Fairness in Asynchronous Collaborative Environments
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1207openalex-snapshot
Optimally Efficient Prefix Search and Multicast in Structured P2P Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1603.09320openalex-snapshot
Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02788openalex-snapshot
Efficient Spatial Nearest Neighbor Queries Based on Multi-layer Voronoi Diagrams
inferred← citeshttps://doi.org/10.57709/8514368openalex-snapshot
Building Robust Distributed Infrastructure Networks
inferred← citeshttps://doi.org/10.70675/8ffae108zb3f6z4059z927dz2dc41d9f81b6openalex-snapshot
Scalable location-temporal range query processing for structured peer-to-peer networks
showing the first 48 of 49 · page through all 49
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.