On the public citation graph
Statistical Encoding of Succinct Data Structures
0 signed · 72 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/11496656_5openalex-snapshot
Succinct Suffix Arrays Based on Run-Length Encoding
inferredcites →https://doi.org/10.1007/3-540-40996-3_35openalex-snapshot
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
inferredcites →https://doi.org/10.1007/3-540-45061-0_29openalex-snapshot
Succinct Representations of Permutations
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/978-3-540-30213-1_23openalex-snapshot
An Alphabet-Friendly FM-Index
inferredcites →https://doi.org/10.1016/s1570-8667(03)00066-2openalex-snapshot
Indexing text using the Ziv–Lempel trie
inferredcites →https://doi.org/10.1109/sfcs.1997.646100openalex-snapshot
Succinct representation of balanced parentheses, static trees and planar graphs
inferredcites →https://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
inferredcites →https://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
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/s0097539797331105openalex-snapshot
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
inferredcites →https://doi.org/10.1145/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
inferredcites →https://doi.org/10.1145/1135777.1135891openalex-snapshot
Compressing and searching XML data via two zips
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.5555/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
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
inferredcites →https://doi.org/10.7146/brics.v5i28.19434openalex-snapshot
Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11780441_28openalex-snapshot
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_332openalex-snapshot
Rank and Select Operations on Binary Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_6openalex-snapshot
Can We Locally Compute Sparse Connected Subgraphs?
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_35openalex-snapshot
Optimal Query Time for Encoding Range Majority
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_16openalex-snapshot
Simple Compression Code Supporting Random Access and Fast String Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_18openalex-snapshot
Simple Space-Time Trade-Offs for AESA
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_23openalex-snapshot
Compressed Text Indexes with Fast Locate
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_33openalex-snapshot
Improved Dynamic Rank-Select Entropy-Bound Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_61openalex-snapshot
Hash, Displace, and Compress
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_57openalex-snapshot
Optimal Trade-Offs for Succinct String Indexes
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_33openalex-snapshot
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_27openalex-snapshot
Alphabet Partitioning for Compressed Rank/Select and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_43openalex-snapshot
CRAM: Compressed Random Access Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_22openalex-snapshot
Improved Address-Calculation Coding of Integer Arrays
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_14openalex-snapshot
Random Access to High-Order Entropy Compressed Text
inferred← citeshttps://doi.org/10.1007/s00453-012-9726-3openalex-snapshot
Efficient Fully-Compressed Sequence Representations
inferred← citeshttps://doi.org/10.1007/s00453-013-9767-2openalex-snapshot
Optimal Indexes for Sparse Bit Vectors
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.012openalex-snapshot
A simple storage scheme for strings achieving entropy bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.013openalex-snapshot
Rank and select revisited and extended
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.022openalex-snapshot
Rank/select on dynamic compressed sequences and applications
inferred← citeshttps://doi.org/10.1109/dcc.2008.45openalex-snapshot
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
inferred← citeshttps://doi.org/10.1109/dcc.2013.19openalex-snapshot
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00072openalex-snapshot
Towards Better Compressed Representations
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00025openalex-snapshot
Practical Implementations of Compressed RAM
inferred← citeshttps://doi.org/10.1109/jsait.2023.3240187openalex-snapshot
Local Decoding in Distributed Compression
inferred← citeshttps://doi.org/10.1109/sccc49216.2019.8966418openalex-snapshot
A Compact Rank/Select Data Structure for the Streaming Model
inferred← citeshttps://doi.org/10.1109/tit.2020.2999909openalex-snapshot
Local Decode and Update for Big Data Compression
inferred← citeshttps://doi.org/10.1137/090779759openalex-snapshot
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
inferred← citeshttps://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferred← citeshttps://doi.org/10.1145/1367064.1367072openalex-snapshot
Dynamic entropy-compressed sequences and full-text indexes
inferred← citeshttps://doi.org/10.1145/1874590.1874597openalex-snapshot
A web search engine model based on index-query bit-level compression
inferred← citeshttps://doi.org/10.1145/2000807.2000820openalex-snapshot
Succinct indexes for strings, binary relations and multilabeled trees
inferred← citeshttps://doi.org/10.1145/3798129.3800833openalex-snapshot
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
inferred← citeshttps://doi.org/10.3233/fi-2009-0066openalex-snapshot
Simple Random Access Compression
inferred← citeshttps://doi.org/10.4018/978-1-4666-2157-2.ch019openalex-snapshot
Development of a Novel Compressed Index-Query Web Search Engine Model
inferred← citeshttps://doi.org/10.4018/jitwe.2011070103openalex-snapshot
Development of a Novel Compressed Index-Query Web Search Engine Model
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2019.11openalex-snapshot
Entropy Lower Bounds for Dictionary Compression
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.22openalex-snapshot
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before
inferred← citeshttps://doi.org/10.48550/arxiv.0911.4981openalex-snapshot
Efficient Fully-Compressed Sequence Representations
inferred← citeshttps://doi.org/10.48550/arxiv.1006.5354openalex-snapshot
Optimal Trade-Off for Succinct String Indexes
inferred← citeshttps://doi.org/10.48550/arxiv.1011.1708openalex-snapshot
CRAM: Compressed Random Access Memory
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2157openalex-snapshot
Optimal Indexes for Sparse Bit Vectors
inferred← citeshttps://doi.org/10.48550/arxiv.1304.0917openalex-snapshot
A Succinct Grammar Compression
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06149openalex-snapshot
Optimal Query Time for Encoding Range Majority
inferred← citeshttps://doi.org/10.5282/edoc.7505openalex-snapshot
Data Structures for Efficient String Algorithms
inferred← citeshttps://doi.org/10.5555/1283383.1283456openalex-snapshot
Succinct indexes for strings, binary relations and multi-labeled 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.