On the public citation graph

Ultra-succinct representation of ordered trees with applications

0 signed · 82 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.1006/jagm.2000.1151openalex-snapshot
Space Efficient Suffix Trees
inferredcites →https://doi.org/10.1007/11533719_57openalex-snapshot
Opportunistic Data Structures for Range Queries
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_52openalex-snapshot
Succinct Data Structures for Searchable Partial Sums
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_84openalex-snapshot
Succinct Representations of Functions
inferredcites →https://doi.org/10.1007/978-3-540-49382-2_17openalex-snapshot
Space Efficient Suffix Trees
inferredcites →https://doi.org/10.1007/978-3-540-69903-3_17openalex-snapshot
A Uniform Approach Towards Succinct Representation of Trees
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_38openalex-snapshot
Universal Succinct Representations of Trees?
inferredcites →https://doi.org/10.1007/s00224-006-1198-xopenalex-snapshot
Compressed Suffix Trees with Full Functionality
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.1016/j.tcs.2006.12.012openalex-snapshot
A simple storage scheme for strings achieving entropy bounds
inferredcites →https://doi.org/10.1016/s0020-0190(01)00298-8openalex-snapshot
Time-space trade-offs for compressed suffix arrays
inferredcites →https://doi.org/10.1016/s0196-6774(03)00087-7openalex-snapshot
New text indexing functionalities of the compressed suffix arrays
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/1.9781611973075.13openalex-snapshot
Fully-Functional Succinct Trees
inferredcites →https://doi.org/10.1137/s0097539700369909openalex-snapshot
Low Redundancy in Static Dictionaries with Constant Query Time
inferredcites →https://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
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/1082036.1082039openalex-snapshot
Indexing compressed text
inferredcites →https://doi.org/10.1145/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
inferredcites →https://doi.org/10.1145/1198513.1198516openalex-snapshot
Succinct ordinal trees with level-ancestor queries
inferredcites →https://doi.org/10.1145/1367064.1367068openalex-snapshot
Balanced parentheses strike back
inferredcites →https://doi.org/10.1145/1498698.1594228openalex-snapshot
Engineering a compressed suffix tree implementation
inferredcites →https://doi.org/10.1145/1613676.1613680openalex-snapshot
Compressing and indexing labeled trees, with applications
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.5555/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
inferredcites →https://doi.org/10.5555/1283383.1283445openalex-snapshot
Ultra-succinct representation of ordered trees
inferredcites →https://doi.org/10.5555/1873601.1873614openalex-snapshot
Fully-functional succinct trees
inferredcites →https://doi.org/10.5555/545381.545411openalex-snapshot
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
inferredcites →https://doi.org/10.5555/644108.644250openalex-snapshot
High-order entropy-compressed text indexes

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_430openalex-snapshot
Compressing and Indexing Structured Text
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_641openalex-snapshot
Compressed Tree Representations
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_17openalex-snapshot
A Comparison of Empirical Tree Entropies
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_4openalex-snapshot
Depth First Representations of $$k^2$$-trees
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_20openalex-snapshot
Succinct Preferential-Attachment Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_1openalex-snapshot
Parallel Construction of Succinct Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_51openalex-snapshot
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_18openalex-snapshot
Succinct Quadtrees for Road Data
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_23openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_44openalex-snapshot
Compressed Directed Acyclic Word Graph with Application in Local Alignment
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_430-2openalex-snapshot
Compressing and Indexing Structured Text
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_641-1openalex-snapshot
Compressed Tree Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_23openalex-snapshot
A Succinct Grammar Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_20openalex-snapshot
Succinct Representations of Ordinal Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_44openalex-snapshot
Tree Compression Using String Grammars
inferred← citeshttps://doi.org/10.1007/s00453-012-9712-9openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-013-9794-zopenalex-snapshot
Compressed Directed Acyclic Word Graph with Application in Local Alignment
inferred← citeshttps://doi.org/10.1007/s00453-015-9969-xopenalex-snapshot
Succinct Dynamic Cardinal Trees
inferred← citeshttps://doi.org/10.1007/s00453-017-0279-3openalex-snapshot
Tree Compression Using String Grammars
inferred← citeshttps://doi.org/10.1007/s00453-017-0333-1openalex-snapshot
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
inferred← citeshttps://doi.org/10.1007/s00453-021-00872-1openalex-snapshot
Adaptive Succinctness
inferred← citeshttps://doi.org/10.1016/j.is.2020.101686openalex-snapshot
SJSON: A succinct representation for JSON documents
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.2016.09.002openalex-snapshot
Improved Range Minimum Queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.043openalex-snapshot
Simultaneous encodings for range and next/previous larger/smaller value queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.031openalex-snapshot
Simple and efficient fully-functional succinct trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.025openalex-snapshot
Parallel construction of succinct 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.1016/j.tcs.2022.11.010openalex-snapshot
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114180openalex-snapshot
Generation matrix: An embeddable matrix representation for hierarchical trees
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.009openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxac122openalex-snapshot
Practical Implementation of Encoding Range Top-2 Queries
inferred← citeshttps://doi.org/10.1098/rsta.2013.0131openalex-snapshot
Encoding range minima and range top-2 queries
inferred← citeshttps://doi.org/10.1109/dcc.2016.42openalex-snapshot
Improved Range Minimum Queries
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00018openalex-snapshot
Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number
inferred← citeshttps://doi.org/10.1109/isit.2019.8849372openalex-snapshot
Entropy Bounds for Grammar-Based Tree Compressors
inferred← citeshttps://doi.org/10.1137/1.9781611976465.47openalex-snapshot
On Locating Paths in Compressed Tries
inferred← citeshttps://doi.org/10.1137/130936889openalex-snapshot
Random Access to Grammar-Compressed Strings and Trees
inferred← citeshttps://doi.org/10.1145/2344422.2344432openalex-snapshot
Succinct ordinal trees based on tree covering
inferred← citeshttps://doi.org/10.1145/2601073openalex-snapshot
Fully Functional Static and Dynamic Succinct Trees
inferred← citeshttps://doi.org/10.1145/2656332openalex-snapshot
Fast Compressed Tries through Path Decompositions
inferred← citeshttps://doi.org/10.1145/3607471openalex-snapshot
Co-lexicographically Ordering Automata and Regular Languages - Part I
inferred← citeshttps://doi.org/10.3390/a14010014openalex-snapshot
Subpath Queries on Compressed Graphs: A Survey
inferred← citeshttps://doi.org/10.3390/a7040608openalex-snapshot
High-Order Entropy Compressed Bit Vectors with Rank/Select
inferred← citeshttps://doi.org/10.3934/dcdsb.2015.20.2419openalex-snapshot
Efficient computation of Lyapunov functions for Morse decompositions
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.70openalex-snapshot
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima
inferred← citeshttps://doi.org/10.48550/arxiv.1304.0917openalex-snapshot
A Succinct Grammar Compression
inferred← citeshttps://doi.org/10.48550/arxiv.1601.06939openalex-snapshot
Simple and Efficient Fully-Functional Succinct Trees
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.