On the public citation graph
Succinct indexes for strings, binary relations and multilabeled trees
0 signed · 80 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/11764298_12openalex-snapshot
Engineering the LOUDS Succinct Tree Representation
inferredcites →https://doi.org/10.1007/11780441_27openalex-snapshot
Statistical Encoding of Succinct Data Structures
inferredcites →https://doi.org/10.1007/3-540-44888-8_10openalex-snapshot
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
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-30213-1_23openalex-snapshot
An Alphabet-Friendly FM-Index
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
inferredcites →https://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.015openalex-snapshot
Adaptive searching in succinctly encoded binary relations and tree-structured documents
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.041openalex-snapshot
Optimal lower bounds for rank and select indexes
inferredcites →https://doi.org/10.1016/s0196-6774(03)00043-9openalex-snapshot
A linear lower bound on index size for text retrieval
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/icde.2006.178openalex-snapshot
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
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.1137/s0097539703436722openalex-snapshot
Fully Dynamic Orthogonal Range Reporting on RAM
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/1082036.1082043openalex-snapshot
Boosting textual compression in optimal linear time
inferredcites →https://doi.org/10.1145/1198513.1198516openalex-snapshot
Succinct ordinal trees with level-ancestor queries
inferredcites →https://doi.org/10.1145/1290672.1290680openalex-snapshot
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
inferredcites →https://doi.org/10.5555/1070432.1070435openalex-snapshot
Lower bounds on the size of selection and rank indexes
inferredcites →https://doi.org/10.5555/1070432.1070437openalex-snapshot
A categorization theorem on suffix arrays with applications to space efficient text indexes
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/1283383.1283445openalex-snapshot
Ultra-succinct representation of ordered trees
inferredcites →https://doi.org/10.5555/1283383.1283456openalex-snapshot
Succinct indexes for strings, binary relations and multi-labeled trees
inferredcites →https://doi.org/10.5555/313852.314087openalex-snapshot
Efficient suffix trees on secondary storage
inferredcites →https://doi.org/10.5555/644108.644210openalex-snapshot
Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time
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_638openalex-snapshot
Rank and Select Operations on Sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_1openalex-snapshot
Succinct Data Structures for Families of Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_16openalex-snapshot
The Function-Inversion Problem: Barriers and Opportunities
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_638-1openalex-snapshot
Rank and Select Operations on Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_50openalex-snapshot
Succinct Data Structures for Path Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_56openalex-snapshot
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_3openalex-snapshot
Design of Practical Succinct Data Structures for Large Data Collections
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_43openalex-snapshot
Dynamic Compressed Strings with Random Access
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/978-3-642-40273-9_15openalex-snapshot
Succinct and Implicit Data Structures for Computational Geometry
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-642-40273-9_8openalex-snapshot
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_21openalex-snapshot
Succinct Indices for Path Minimum, with Applications to Path Reporting
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_74openalex-snapshot
Compressed Data Structures for Dynamic Sequences
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.1007/s00453-014-9894-4openalex-snapshot
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
inferred← citeshttps://doi.org/10.1007/s00453-015-9990-0openalex-snapshot
Compressed String Dictionary Search with Edit Distance One
inferred← citeshttps://doi.org/10.1007/s00453-016-0170-7openalex-snapshot
Succinct Indices for Path Minimum, with Applications
inferred← citeshttps://doi.org/10.1007/s00453-020-00710-wopenalex-snapshot
Succinct Encodings for Families of Interval Graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.007openalex-snapshot
Space efficient data structures for dynamic orthogonal range counting
inferred← citeshttps://doi.org/10.1016/j.ic.2013.10.003openalex-snapshot
Compact binary relation representations with rich functionality
inferred← citeshttps://doi.org/10.1016/j.is.2014.06.002openalex-snapshot
The wavelet matrix: An efficient wavelet tree for large alphabets
inferred← citeshttps://doi.org/10.1016/j.jda.2016.10.001openalex-snapshot
Grammar compressed sequences with rank/select support
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.019openalex-snapshot
On compressing permutations and adaptive sorting
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.011openalex-snapshot
Fast construction of wavelet trees
inferred← citeshttps://doi.org/10.1109/dcc58796.2024.00036openalex-snapshot
Rank and Select on Degenerate Strings
inferred← citeshttps://doi.org/10.1109/tnet.2020.2984761openalex-snapshot
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces
inferred← citeshttps://doi.org/10.1137/1.9781611973105.62openalex-snapshot
Optimal Dynamic Sequence Representations
inferred← citeshttps://doi.org/10.1137/130908245openalex-snapshot
Optimal Dynamic Sequence Representations
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/2629339openalex-snapshot
Optimal Lower and Upper Bounds for Representing Sequences
inferred← citeshttps://doi.org/10.1145/2670128openalex-snapshot
General Document Retrieval in Compact Space
inferred← citeshttps://doi.org/10.1145/2745754.2745778openalex-snapshot
Dynamic Data Structures for Document Collections and Graphs
inferred← citeshttps://doi.org/10.11606/d.45.2008.tde-19102009-002745openalex-snapshot
Filtros para a busca e extração de padrões aproximados em cadeias biológicas
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.48550/arxiv.1304.6023openalex-snapshot
Spaces, Trees and Colors: The Algorithmic Landscape of Document Retrieval on Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1220openalex-snapshot
Efficient Compressed Wavelet Trees over Large Alphabets
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
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.