On the public citation graph

A Learned Approach to Design Compressed Rank/Select Data Structures

0 signed · 77 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.1002/spe.2198openalex-snapshot
Optimized succinct data structures for massive data
inferredcites →https://doi.org/10.1002/spe.2203openalex-snapshot
Decoding billions of integers per second through vectorization
inferredcites →https://doi.org/10.1007/3-540-62034-6_35openalex-snapshot
Tables
inferredcites →https://doi.org/10.1007/978-1-4939-2864-4_332openalex-snapshot
Rank and Select Operations on Bit Strings
inferredcites →https://doi.org/10.1007/978-3-030-32686-9_33openalex-snapshot
Adaptive Succinctness
inferredcites →https://doi.org/10.1007/978-3-030-43883-8_2openalex-snapshot
Learned Data Structures
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_28openalex-snapshot
From Theory to Practice: Plug and Play with Succinct Data Structures
inferredcites →https://doi.org/10.1007/978-3-540-30213-1_23openalex-snapshot
An Alphabet-Friendly FM-Index
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_12openalex-snapshot
Broadword Implementation of Rank/Select Queries
inferredcites →https://doi.org/10.1007/978-3-540-89097-3_18openalex-snapshot
Practical Rank/Select Queries over Arbitrary Sequences
inferredcites →https://doi.org/10.1007/978-3-642-30850-5_26openalex-snapshot
Fast, Small, Simple Rank/Select on Bitmaps
inferredcites →https://doi.org/10.1007/s00453-010-9437-6openalex-snapshot
On Optimally Partitioning a Text to Improve Its Compression
inferredcites →https://doi.org/10.1007/s00453-011-9535-0openalex-snapshot
Lightweight Data Indexing and Compression in External Memory
inferredcites →https://doi.org/10.1007/s00453-013-9767-2openalex-snapshot
Optimal Indexes for Sparse Bit Vectors
inferredcites →https://doi.org/10.1007/s00778-014-0355-0openalex-snapshot
Maximum error-bounded Piecewise Linear Representation for online stream approximation
inferredcites →https://doi.org/10.1016/j.ipm.2018.05.007openalex-snapshot
Hybrid compression of inverted lists for reordered document collections
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.041openalex-snapshot
Optimal lower bounds for rank and select indexes
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/j.tcs.2021.04.015openalex-snapshot
On the performance of learned data structures
inferredcites →https://doi.org/10.1017/cbo9781139940023openalex-snapshot
Genome-Scale Algorithm Design
inferredcites →https://doi.org/10.1017/cbo9781316588284openalex-snapshot
Compact Data Structures
inferredcites →https://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferredcites →https://doi.org/10.1109/focs.2008.83openalex-snapshot
Succincter
inferredcites →https://doi.org/10.1109/sccc51225.2020.9281244openalex-snapshot
A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1137/1.9780898715583openalex-snapshot
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferredcites →https://doi.org/10.1137/1.9781611973075.11openalex-snapshot
Cell-Probe Lower Bounds for Succinct Partial Sums
inferredcites →https://doi.org/10.1137/1.9781611976472.4openalex-snapshot
A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
inferredcites →https://doi.org/10.1137/s0097539797331105openalex-snapshot
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
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.1109599openalex-snapshot
Rank/select operations on large alphabets
inferredcites →https://doi.org/10.1145/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
inferredcites →https://doi.org/10.1145/1132516.1132551openalex-snapshot
Time-space trade-offs for predecessor search
inferredcites →https://doi.org/10.1145/1198513.1198521openalex-snapshot
When indexing equals compression
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/1290672.1290680openalex-snapshot
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
inferredcites →https://doi.org/10.1145/1871437.1871592openalex-snapshot
VSEncoding
inferredcites →https://doi.org/10.1145/1963190.2025378openalex-snapshot
Theory and practice of monotone minimal perfect hashing
inferredcites →https://doi.org/10.1145/2433396.2433409openalex-snapshot
Quasi-succinct indices
inferredcites →https://doi.org/10.1145/2535933openalex-snapshot
Spaces, Trees, and Colors
inferredcites →https://doi.org/10.1145/2600428.2609615openalex-snapshot
Partitioned Elias-Fano indexes
inferredcites →https://doi.org/10.1145/3052773openalex-snapshot
Clustered Elias-Fano Indexes
inferredcites →https://doi.org/10.1145/321812.321820openalex-snapshot
Efficient Storage and Retrieval by Content and Address of Static Files
inferredcites →https://doi.org/10.1145/3313276.3316352openalex-snapshot
Optimal succinct rank data structure via approximate nonnegative tensor decomposition
inferredcites →https://doi.org/10.1145/3409371openalex-snapshot
Predecessor Search
inferredcites →https://doi.org/10.1145/358746.358758openalex-snapshot
An on-line algorithm for fitting straight lines between data ranges
inferredcites →https://doi.org/10.1145/950620.950622openalex-snapshot
Improving table compression with combinatorial optimization
inferredcites →https://doi.org/10.14778/2002974.2002975openalex-snapshot
Efficient parallel lists intersection and index compression algorithms using graphics processing units
inferredcites →https://doi.org/10.14778/3389133.3389135openalex-snapshot
The PGM-index
inferredcites →https://doi.org/10.4230/lipics.stacs.2009.1814openalex-snapshot
Compressed Representations of Permutations, and Applications

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.70013openalex-snapshot
Faster Wavelet Tree Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_17openalex-snapshot
Compressed String Dictionaries via Data-Aware Subtrie Compaction
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_19openalex-snapshot
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_16openalex-snapshot
Engineering a Textbook Approach to Index Massive String Dictionaries
inferred← citeshttps://doi.org/10.1016/j.is.2023.102316openalex-snapshot
CoCo-trie: Data-aware compression and indexing of strings
inferred← citeshttps://doi.org/10.1016/j.is.2024.102490openalex-snapshot
Two-level massive string dictionaries
inferred← citeshttps://doi.org/10.1016/j.simpat.2024.102960openalex-snapshot
Trie and LOUDS hybrid model for efficient e-commerce processing in cloud environment
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf102openalex-snapshot
Engineering rank/select data structures for large-alphabet strings
inferred← citeshttps://doi.org/10.1101/2024.02.08.579510openalex-snapshot
PLA-complexity of k -mer multisets
inferred← citeshttps://doi.org/10.1109/access.2022.3221520openalex-snapshot
Compressing and Querying Integer Dictionaries Under Linearities and Repetitions
inferred← citeshttps://doi.org/10.1109/access.2023.3295434openalex-snapshot
On Nonlinear Learned String Indexing
inferred← citeshttps://doi.org/10.1109/dcc58796.2024.00030openalex-snapshot
Faster Wavelet Tree Queries
inferred← citeshttps://doi.org/10.1109/dcc62719.2025.00028openalex-snapshot
Computing Consecutively Maximal Periodic Patterns Over APT Compressed Data
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00122openalex-snapshot
Learned Compression of Nonlinear Time Series with Random Access
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00349openalex-snapshot
BitTuner: A Toolbox for Automatically Configuring Learned Data Compressors
inferred← citeshttps://doi.org/10.1145/3768575openalex-snapshot
A Survey of Learned Indexes for the Multi-dimensional Space
inferred← citeshttps://doi.org/10.1145/3841175openalex-snapshot
Learned Indices for String Keys with Optimized Performance and O(N) Space Cost
inferred← citeshttps://doi.org/10.14778/3551793.3551848openalex-snapshot
Are updatable learned indexes ready?
inferred← citeshttps://doi.org/10.14778/3749646.3749650openalex-snapshot
Not Small Enough? SegPQ: A Learned Approach to Compress Product Quantization Codebooks
inferred← citeshttps://doi.org/10.14778/3785297.3785305openalex-snapshot
Eureka: Enabling Fine-Grained Access and Range Queries on Compressed Scientific Data via Data-Index Co-Compression
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2621048/v1openalex-snapshot
Efficient Integer Retrieving from Unordered Compressed Sequences
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2683061/v1openalex-snapshot
Efficient Integer Retrieval from Unordered Compressed Sequences
inferred← citeshttps://doi.org/10.2139/ssrn.7607969openalex-snapshot
Computing Pure Maximal Consecutive Periodic Patterns over APT Compressed Data
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.