On the public citation graph

Engineering the LOUDS Succinct Tree Representation

0 signed · 69 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/11427186_28openalex-snapshot
Efficient Implementation of Rank and Select Functions for Succinct Representation
inferredcites →https://doi.org/10.1007/3-540-62034-6_35openalex-snapshot
Tables
inferredcites →https://doi.org/10.1007/978-3-540-27801-6_12openalex-snapshot
A Simple Optimal Representation for Balanced Parentheses
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_84openalex-snapshot
Succinct Representations of Functions
inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
inferredcites →https://doi.org/10.1016/j.tcs.2006.09.014openalex-snapshot
A simple optimal representation for balanced parentheses
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1137/s0097539702411381openalex-snapshot
Orderly Spanning Trees with Applications
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/75427.75429openalex-snapshot
A random binary tree generator
inferredcites →https://doi.org/10.5555/313852.314087openalex-snapshot
Efficient suffix trees on secondary storage
inferredcites →https://doi.org/10.5555/982792.982794openalex-snapshot
Succinct ordinal trees with level-ancestor queries

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-1-4939-2864-4_332openalex-snapshot
Rank and Select Operations on Bit Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_29openalex-snapshot
Improved ESP-index: A Practical Self-index for Highly Repetitive Texts
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_16openalex-snapshot
An(other) Entropy-Bounded Compressed Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_19openalex-snapshot
Compressed Prefix Sums
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_34openalex-snapshot
On the Size of Succinct Indices
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_3openalex-snapshot
k2-Trees for Compact Web Graph Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_39openalex-snapshot
ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_332-2openalex-snapshot
Rank and Select Operations on Bit Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_20openalex-snapshot
Dynamizing Succinct Tree Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_20openalex-snapshot
Succinct Representations of Ordinal Trees
inferred← citeshttps://doi.org/10.1007/s00453-021-00872-1openalex-snapshot
Adaptive Succinctness
inferred← citeshttps://doi.org/10.1007/s10115-015-0873-0openalex-snapshot
A compression method of double-array structures using linear functions
inferred← citeshttps://doi.org/10.1016/j.ipm.2009.08.004openalex-snapshot
New methods for compression of MP double array by compact management of suffixes
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.12.002openalex-snapshot
Representation of ordered trees with a given degree distribution
inferred← citeshttps://doi.org/10.1016/j.jda.2012.07.009openalex-snapshot
ESP-index: A compressed index based on edit-sensitive parsing
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.012openalex-snapshot
Faster entropy-bounded compressed suffix trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.005openalex-snapshot
Succinct data structure for dynamic trees with faster queries
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.005openalex-snapshot
Bitvectors
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.009openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxw103openalex-snapshot
Compressed Bit vectors Based on Variable-to-Fixed Encodings
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006324openalex-snapshot
b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches
inferred← citeshttps://doi.org/10.1109/dcc.2018.00032openalex-snapshot
Compact Representations of Event Sequences
inferred← citeshttps://doi.org/10.1109/dcc58796.2024.00033openalex-snapshot
Space-Efficient Data Structures for Polyominoes and Bar Graphs
inferred← citeshttps://doi.org/10.1109/iacs.2014.6841955openalex-snapshot
A fast and compact hybrid memory resident datastore for text analytics with autonomic memory allocation
inferred← citeshttps://doi.org/10.1109/iccea.2010.64openalex-snapshot
Customized Tries for Weighted Key Completion
inferred← citeshttps://doi.org/10.1109/innovate-data.2017.9openalex-snapshot
Practical String Dictionary Compression Using String Dictionary Encoding
inferred← citeshttps://doi.org/10.1109/iwcia.2015.7449451openalex-snapshot
Trie compact representation using double-array structures with string labels
inferred← citeshttps://doi.org/10.1109/sccc51225.2020.9281244openalex-snapshot
A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences
inferred← citeshttps://doi.org/10.1137/1.9781611972900.9openalex-snapshot
Succinct Trees in Practice
inferred← citeshttps://doi.org/10.1137/1.9781611972924.15openalex-snapshot
Robust Mobile Route Planning with Limited Connectivity
inferred← citeshttps://doi.org/10.1145/1353343.1353354openalex-snapshot
Engineering succinct DOM
inferred← citeshttps://doi.org/10.1145/1367064.1367068openalex-snapshot
Balanced parentheses strike back
inferred← citeshttps://doi.org/10.1145/2000807.2000820openalex-snapshot
Succinct indexes for strings, binary relations and multilabeled trees
inferred← citeshttps://doi.org/10.1145/2601073openalex-snapshot
Fully Functional Static and Dynamic Succinct Trees
inferred← citeshttps://doi.org/10.1145/3183713.3196931openalex-snapshot
SuRF
inferred← citeshttps://doi.org/10.1145/3326458.3326930openalex-snapshot
Representation of Recipe Flow Graphs in Succinct Data Structures
inferred← citeshttps://doi.org/10.1145/3627703.3650072openalex-snapshot
Trinity: A Fast Compressed Multi-attribute Data Store
inferred← citeshttps://doi.org/10.1504/ijista.2015.074331openalex-snapshot
A new compression method for double-array structures by a hierarchical representation
inferred← citeshttps://doi.org/10.18178/ijfcc.2016.5.6.476openalex-snapshot
An Implementation Method of Trie Structure Using Xorshift
inferred← citeshttps://doi.org/10.18653/v1/w17-4002openalex-snapshot
Transliterated Mobile Keyboard Input via Weighted Finite-State Transducers
inferred← citeshttps://doi.org/10.18653/v1/w19-3105openalex-snapshot
On the Compression of Lexicon Transducers
inferred← citeshttps://doi.org/10.21437/interspeech.2011-248openalex-snapshot
Unary data structures for language models
inferred← citeshttps://doi.org/10.2197/ipsjjip.20.228openalex-snapshot
Efficient Classification with Conjunctive Features
inferred← citeshttps://doi.org/10.3115/1667583.1667689openalex-snapshot
A succinct N-gram language model
inferred← citeshttps://doi.org/10.3115/1699648.1699701openalex-snapshot
Polynomial to linear
inferred← citeshttps://doi.org/10.3390/app10155266openalex-snapshot
An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization
inferred← citeshttps://doi.org/10.3390/app10238530openalex-snapshot
Ext-LOUDS: A Space Efficient Extended LOUDS Index for Superset Query
inferred← citeshttps://doi.org/10.48550/arxiv.0905.0768openalex-snapshot
Fully-Functional Static and Dynamic Succinct Trees
inferred← citeshttps://doi.org/10.48550/arxiv.0907.2089openalex-snapshot
Fast In-Memory XPath Search over Compressed Text and Tree Indexes
inferred← citeshttps://doi.org/10.48550/arxiv.1101.0080openalex-snapshot
A Searchable Compressed Edit-Sensitive Parsing
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2157openalex-snapshot
Optimal Indexes for Sparse Bit Vectors
inferred← citeshttps://doi.org/10.48550/arxiv.1301.5468openalex-snapshot
Broadword Implementation of Parenthesis Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01009openalex-snapshot
Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
inferred← citeshttps://doi.org/10.5555/1283383.1283456openalex-snapshot
Succinct indexes for strings, binary relations and multi-labeled trees
inferred← citeshttps://doi.org/10.5555/1873601.1873614openalex-snapshot
Fully-functional succinct trees
inferred← citeshttps://doi.org/10.62370/hbds.v25i2.274490openalex-snapshot
Exploring the Potential of k^n-Tree for Efficient Representation of n-ary Relations
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.