On the public citation graph

Dynamic Entropy-Compressed Sequences and Full-Text Indexes

https://doi.org/10.1007/11780441_28
0 signed · 73 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/11496656_5openalex-snapshot
Succinct Suffix Arrays Based on Run-Length Encoding
inferredcites →https://doi.org/10.1007/11602613_113openalex-snapshot
Space-Efficient Construction of LZ-Index
inferredcites →https://doi.org/10.1007/11780441_27openalex-snapshot
Statistical Encoding of Succinct Data Structures
inferredcites →https://doi.org/10.1007/11786986_49openalex-snapshot
The Myriad Virtues of Wavelet Trees
inferredcites →https://doi.org/10.1007/3-540-44634-6_39openalex-snapshot
Succinct Dynamic Data Structures
inferredcites →https://doi.org/10.1007/3-540-51542-9_5openalex-snapshot
Optimal algorithms for List Indexing and Subset Rank
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_26openalex-snapshot
Constructing Compressed Suffix Arrays with Large Alphabets
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-27801-6_34openalex-snapshot
Compressed Index for a Dynamic Collection of Texts
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/s00453-001-0051-5openalex-snapshot
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.013openalex-snapshot
Rank and select revisited and extended
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.018openalex-snapshot
Fast BWT in small space by blockwise suffix sorting
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.1016/s1570-8667(03)00066-2openalex-snapshot
Indexing text using the Ziv–Lempel trie
inferredcites →https://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
inferredcites →https://doi.org/10.1109/sfcs.2003.1238199openalex-snapshot
Breaking a time-and-space barrier in constructing full-text indices
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
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.1145/1082036.1082039openalex-snapshot
Indexing compressed text
inferredcites →https://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferredcites →https://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferredcites →https://doi.org/10.1145/1240233.1240244openalex-snapshot
Compressed indexes for dynamic text collections
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.1184/r1/6604220openalex-snapshot
Compact Representations of Ordered Sets
inferredcites →https://doi.org/10.5555/1109557.1109599openalex-snapshot
Rank/select operations on large alphabets: a tool for text indexing
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.5555/982792.982796openalex-snapshot
Tight bounds for the partial-sums problem
inferredcites →https://doi.org/10.5555/982792.982888openalex-snapshot
When indexing equals compression: experiments with compressing suffix arrays and applications
inferredcites →https://doi.org/10.5555/982792.982892openalex-snapshot
Compression boosting in optimal linear time using the Burrows-Wheeler Transform
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.1002/spe.2791openalex-snapshot
Compact Fenwick trees for dynamic ranking and selection
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_17openalex-snapshot
Engineering a Compressed Suffix Tree Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_46openalex-snapshot
A Framework for Dynamizing Succinct Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_12openalex-snapshot
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_22openalex-snapshot
Space-Efficient Algorithms for Document Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_21openalex-snapshot
Implicit Compression Boosting with Applications to Self-indexing
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_32openalex-snapshot
Fully-Compressed Suffix Trees
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/s00453-013-9792-1openalex-snapshot
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
inferred← citeshttps://doi.org/10.1007/s41870-021-00683-1openalex-snapshot
A comprehensive analysis of wavelet tree based indexing schemes in GIR systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.027openalex-snapshot
Optimal prefix and suffix queries on texts
inferred← citeshttps://doi.org/10.1016/j.is.2012.06.005openalex-snapshot
Succinct nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.jda.2009.02.007openalex-snapshot
Dynamic extended suffix arrays
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.016openalex-snapshot
A four-stage algorithm for updating a Burrows–Wheeler transform
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.021openalex-snapshot
Dynamic rank/select structures with applications to run-length encoded texts
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa546openalex-snapshot
Succinct dynamic de Bruijn graphs
inferred← citeshttps://doi.org/10.1109/dcc.2008.67openalex-snapshot
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9173968openalex-snapshot
O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression
inferred← citeshttps://doi.org/10.1109/sccc.2010.46openalex-snapshot
Operators over Compressed Integer Encodings
inferred← citeshttps://doi.org/10.1109/tit.2020.2999909openalex-snapshot
Local Decode and Update for Big Data Compression
inferred← citeshttps://doi.org/10.1109/tnet.2014.2357051openalex-snapshot
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
inferred← citeshttps://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferred← citeshttps://doi.org/10.1145/1352431.1352495openalex-snapshot
The SBC-tree
inferred← citeshttps://doi.org/10.1145/1353343.1353407openalex-snapshot
The SBC-tree
inferred← citeshttps://doi.org/10.1145/2745754.2745778openalex-snapshot
Dynamic Data Structures for Document Collections and Graphs
inferred← citeshttps://doi.org/10.1145/3432999openalex-snapshot
Indexing Highly Repetitive String Collections, Part II
inferred← citeshttps://doi.org/10.1145/3448016.3457256openalex-snapshot
Worst-Case Optimal Graph Joins in Almost No Space
inferred← citeshttps://doi.org/10.2298/csis110606004mopenalex-snapshot
Wavelet trees: A survey
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.785openalex-snapshot
Efficient Indexing for Structured and Unstructured Data
inferred← citeshttps://doi.org/10.3390/a2031105openalex-snapshot
Approximate String Matching with Compressed Indexes
inferred← citeshttps://doi.org/10.36244/icj.2019.2.7openalex-snapshot
R3D3: A Doubly Opportunistic Data Structure for Compressing and Indexing Massive Data
inferred← citeshttps://doi.org/10.46298/dmtcs.3541openalex-snapshot
Optimal Prefix and Suffix Queries on Texts
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3360openalex-snapshot
Compressed Text Indexes:From Theory to Practice!
inferred← citeshttps://doi.org/10.48550/arxiv.1106.5076openalex-snapshot
Dynamic Range Selection in Linear Space
inferred← citeshttps://doi.org/10.48550/arxiv.1503.05977openalex-snapshot
Dynamic Data Structures for Document Collections and Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06866openalex-snapshot
Compressed Data Structures for Dynamic Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.2008.08828openalex-snapshot
On the Use of Quasiorders in Formal Language Theory
inferred← citeshttps://doi.org/10.48550/arxiv.2103.05460openalex-snapshot
Dynamic Range Mode Enumeration
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.