On the public citation graph
Faster Compressed Quadtrees
0 signed · 23 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/978-3-319-02432-5_14openalex-snapshot
Compact Querieable Representations of Raster Data
inferredcites →https://doi.org/10.1007/978-3-642-20877-5_21openalex-snapshot
Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/j.is.2013.08.003openalex-snapshot
Compact representation of Web graphs with extended functionality
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.042openalex-snapshot
Compressed data structures: Dictionaries and data-aware measures
inferredcites →https://doi.org/10.1145/2601073openalex-snapshot
Fully Functional Static and Dynamic Succinct Trees
inferredcites →https://doi.org/10.1145/358728.358741openalex-snapshot
An effective way to represent quadtrees
inferredcites →https://doi.org/10.48550/arxiv.0909.3137openalex-snapshot
Succinct Representation of Well-Spaced Point Clouds
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_18openalex-snapshot
Succinct Quadtrees for Road Data
inferred← citeshttps://doi.org/10.1016/j.is.2016.03.004openalex-snapshot
Aggregated 2D range queries on clustered points
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.012openalex-snapshot
Efficient computation of spatial queries over points stored in k2-tree compact data structures
inferred← citeshttps://doi.org/10.1109/dcc.2019.00018openalex-snapshot
A Compact Representation of Raster Time Series
inferred← citeshttps://doi.org/10.1137/1.9781611974782.45openalex-snapshot
Near-Optimal (Euclidean) Metric Compression
inferred← citeshttps://doi.org/10.1145/3514231openalex-snapshot
Optimal Joins Using Compressed Quadtrees
inferred← citeshttps://doi.org/10.1186/s40537-021-00443-9openalex-snapshot
An analysis of the graph processing landscape
inferred← citeshttps://doi.org/10.3390/ijgi9090497openalex-snapshot
The Spatial-Comprehensiveness (S-COM) Index: Identifying Optimal Spatial Extents in Volunteered Geographic Information Point Datasets
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2020.21openalex-snapshot
Optimal Joins Using Compact Data Structures
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.