On the public citation graph

Optimized succinct data structures for massive data

https://doi.org/10.1002/spe.2198
0 signed · 131 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/3-540-48523-6_56openalex-snapshot
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
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-02008-7_9openalex-snapshot
Storage and Retrieval of Individual Genomes
inferredcites →https://doi.org/10.1007/978-3-642-13509-5_24openalex-snapshot
Compression, Indexing, and Retrieval for Massive String Data
inferredcites →https://doi.org/10.1007/978-3-642-24583-1_18openalex-snapshot
Fixed Block Compression Boosting in FM-Indexes
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/978-3-642-31265-6_2openalex-snapshot
Wavelet Trees for All
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.1021/ci200235eopenalex-snapshot
Anatomy of High-Performance 2D Similarity Calculations
inferredcites →https://doi.org/10.1109/roedunet.2011.5993702openalex-snapshot
The never ending problem of counting bits efficiently
inferredcites →https://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferredcites →https://doi.org/10.1145/1216370.1216371openalex-snapshot
A survey on peer-to-peer key management for mobile ad hoc networks
inferredcites →https://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferredcites →https://doi.org/10.1145/1412228.1412229openalex-snapshot
A backtracking-based algorithm for hypertree decomposition
inferredcites →https://doi.org/10.1145/1412228.1455268openalex-snapshot
Compressed text indexes
inferredcites →https://doi.org/10.1145/2348283.2348317openalex-snapshot
Efficient in-memory top-k document retrieval
inferredcites →https://doi.org/10.1145/2444016.2461327openalex-snapshot
Compressed suffix trees
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.18725/oparu-3911openalex-snapshot
Compressed suffix trees: design, construction, and applications
inferredcites →https://doi.org/10.48550/arxiv.0712.3360openalex-snapshot
Compressed Text Indexes:From Theory to Practice!
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.1002/spe.2314openalex-snapshot
Practically efficient array initialization
inferred← citeshttps://doi.org/10.1002/spe.2431openalex-snapshot
A Bloom filter based semi‐index on q‐grams
inferred← citeshttps://doi.org/10.1002/spe.2481openalex-snapshot
Sampled suffix array with minimizers
inferred← citeshttps://doi.org/10.1002/spe.2791openalex-snapshot
Compact Fenwick trees for dynamic ranking and selection
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_794openalex-snapshot
Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_18openalex-snapshot
Fast Wavelet Tree Construction in Practice
inferred← citeshttps://doi.org/10.1007/978-3-030-23873-5_6openalex-snapshot
Cache-Efficient FM-Index Variants for Mapping of DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-27618-8_7openalex-snapshot
Succinct BWT-Based Sequence Prediction
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_32openalex-snapshot
A Practical Alphabet-Partitioning Rank/Select Data Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_33openalex-snapshot
Adaptive Succinctness
inferred← citeshttps://doi.org/10.1007/978-3-319-02432-5_18openalex-snapshot
Adding Compression and Blended Search to a Compact Two-Level Suffix Array
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_28openalex-snapshot
From Theory to Practice: Plug and Play with Succinct Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_37openalex-snapshot
Improved and Extended Locating Functionality on Compressed Suffix Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-23826-5_28openalex-snapshot
Sampling the Suffix Array with Minimizers
inferred← citeshttps://doi.org/10.1007/978-3-319-58274-0_16openalex-snapshot
FM-index for Dummies
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_20openalex-snapshot
Faster Practical Block Compression for Rank/Select Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_639-1openalex-snapshot
Monotone Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_794-1openalex-snapshot
Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_794-2openalex-snapshot
Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-44753-6_6openalex-snapshot
Efficient Indexed Alignment of Contigs to Optical Maps
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_1openalex-snapshot
Minimal and Monotone Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/978-981-15-1275-9_37openalex-snapshot
Compendious and Succinct Data Structures for Big Data
inferred← citeshttps://doi.org/10.1007/s00453-018-0475-9openalex-snapshot
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.02.004openalex-snapshot
Scalable generation of scale-free graphs
inferred← citeshttps://doi.org/10.1016/j.is.2013.08.003openalex-snapshot
Compact representation of Web graphs with extended functionality
inferred← citeshttps://doi.org/10.1016/j.is.2017.12.001openalex-snapshot
Rank and select: Another lesson learned
inferred← citeshttps://doi.org/10.1016/j.is.2020.101668openalex-snapshot
ER -index: A referential index for encrypted genomic databases
inferred← citeshttps://doi.org/10.1016/j.is.2021.101756openalex-snapshot
Rank/select queries over mutable bitmaps
inferred← citeshttps://doi.org/10.1016/j.isci.2021.102687openalex-snapshot
Dynamic partitioning of search patterns for approximate pattern matching using search schemes
inferred← citeshttps://doi.org/10.1016/j.jda.2015.01.006openalex-snapshot
Improved and extended locating functionality on compressed suffix arrays
inferred← citeshttps://doi.org/10.1016/j.jda.2016.12.001openalex-snapshot
A space efficient direct access data structure
inferred← citeshttps://doi.org/10.1016/j.jda.2017.04.001openalex-snapshot
Parallel lightweight wavelet tree, suffix array and FM-index construction
inferred← citeshttps://doi.org/10.1016/j.softx.2024.101681openalex-snapshot
BSuccinct: Rust libraries and programs focused on succinct data structures
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.002openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.005openalex-snapshot
Bitvectors
inferred← citeshttps://doi.org/10.1038/s41587-020-0731-9openalex-snapshot
Targeted nanopore sequencing by real-time mapping of raw electrical signal with UNCALLED
inferred← citeshttps://doi.org/10.1073/pnas.1903436117openalex-snapshot
Mismatch-tolerant, alignment-free sequence classification using multiple spaced seeds and multiindex Bloom filters
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac656openalex-snapshot
GBZ file format for pangenome graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae217openalex-snapshot
Conway–Bromage–Lyndon (CBL): an exact, dynamic representation of k-mer sets
inferred← citeshttps://doi.org/10.1093/bioinformatics/btx596openalex-snapshot
FMtree: a fast locating algorithm of FM-indexes for genomic data
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf102openalex-snapshot
Engineering rank/select data structures for large-alphabet strings
inferred← citeshttps://doi.org/10.1098/rsta.2013.0135openalex-snapshot
String search experimentation using massive data
inferred← citeshttps://doi.org/10.1101/2022.05.19.492613openalex-snapshot
Succinct k -mer Sets Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform *
inferred← citeshttps://doi.org/10.1101/2024.01.29.577700openalex-snapshot
Conway-Bromage-Lyndon (CBL): an exact, dynamic representation of k -mer sets
inferred← citeshttps://doi.org/10.1101/434795openalex-snapshot
Improving on hash-based probabilistic sequence classification using multiple spaced seeds and multi-index Bloom filters
inferred← citeshttps://doi.org/10.1109/access.2019.2949655openalex-snapshot
Energy Consumption in Compact Integer Vectors: A Study Case
inferred← citeshttps://doi.org/10.1109/bhi.2014.6864438openalex-snapshot
Practical distributed computation of maximal exact matches in the cloud
inferred← citeshttps://doi.org/10.1109/dcc.2014.49openalex-snapshot
A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing
inferred← citeshttps://doi.org/10.1109/dcc.2014.87openalex-snapshot
Hybrid Compression of Bitvectors for the FM-Index
inferred← citeshttps://doi.org/10.1109/dcc.2015.7openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1109/dcc.2016.61openalex-snapshot
A Space Efficient Direct Access Data Structure
inferred← citeshttps://doi.org/10.1109/dcc.2016.94openalex-snapshot
Faster, Minuter
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00029openalex-snapshot
Smaller RLZ-Compressed Suffix Arrays
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00036openalex-snapshot
Speeding up compact planar graphs by using shallower trees
inferred← citeshttps://doi.org/10.1109/icdm65498.2025.00049openalex-snapshot
Fast Sampling for Privacy-Preserving Lazy Multiplicative Weight Update
inferred← citeshttps://doi.org/10.1109/ickii55100.2022.9983552openalex-snapshot
Extendable B-tree on Multi-channel Nonvolatile Memory Devices
inferred← citeshttps://doi.org/10.1109/icmtma.2015.31openalex-snapshot
An Efficient Massive Data Retrieval Algorithm Based on Modified Top-k Query
inferred← citeshttps://doi.org/10.1109/sccc49216.2019.8966420openalex-snapshot
Compressed Data Structures for Astronomical Content-Aware Resource Search
inferred← citeshttps://doi.org/10.1109/sccc51225.2020.9281244openalex-snapshot
A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences
inferred← citeshttps://doi.org/10.1109/sccc57464.2022.10000377openalex-snapshot
A CPU-Parallel Implementation of Pattern Matching for the Hybrid Index
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2796064openalex-snapshot
A Simplified Description of Child Tables for Sequence Similarity Search
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2884701openalex-snapshot
Accelerating Sequence Alignments Based on FM-Index Using the Intel KNL Processor
inferred← citeshttps://doi.org/10.1109/tkde.2013.129openalex-snapshot
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays
inferred← citeshttps://doi.org/10.1109/tkde.2021.3114401openalex-snapshot
Practical High-Order Entropy-Compressed Text Self-Indexing
inferred← citeshttps://doi.org/10.1137/1.9781611975055openalex-snapshot
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)
inferred← citeshttps://doi.org/10.1137/1.9781611976007.14openalex-snapshot
RecSplit: Minimal Perfect Hashing via Recursive Splitting
inferred← citeshttps://doi.org/10.1137/1.9781611976472.4openalex-snapshot
A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018788openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3018787.3018789openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3018787.3018790openalex-snapshot
Preliminaries and Notation
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018803openalex-snapshot
Conclusion and Future Work
inferred← citeshttps://doi.org/10.1145/3018787.3018804openalex-snapshot
References
inferred← citeshttps://doi.org/10.1145/3043958openalex-snapshot
Practical Compact Indexes for Top- k Document Retrieval
inferred← citeshttps://doi.org/10.1145/3166072.3166080openalex-snapshot
Efficient In-Memory, List-Based Text Inversion
inferred← citeshttps://doi.org/10.1145/3243176.3243198openalex-snapshot
Log(graph)
inferred← citeshttps://doi.org/10.1145/3295500.3356211openalex-snapshot
Distributed enhanced suffix arrays
inferred← citeshttps://doi.org/10.1145/3514231openalex-snapshot
Optimal Joins Using Compressed Quadtrees
inferred← citeshttps://doi.org/10.1145/3524060openalex-snapshot
A Learned Approach to Design Compressed Rank/Select Data Structures
inferred← citeshttps://doi.org/10.1145/3812648openalex-snapshot
Adaptive Set Intersection via Trie Partition Certificates
inferred← citeshttps://doi.org/10.1186/1748-7188-8-25openalex-snapshot
Data compression for sequencing data
inferred← citeshttps://doi.org/10.14288/1.0387155openalex-snapshot
Improving sequence analysis with probabilistic data structures and algorithms
inferred← citeshttps://doi.org/10.1515/bpasts-2017-0046openalex-snapshot
Compact and hash based variants of the suffix array
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.48550/arxiv.1311.1249openalex-snapshot
From Theory to Practice: Plug and Play with Succinct Data Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1405.5919openalex-snapshot
Two simple full-text indexes based on the suffix array
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2348openalex-snapshot
Sampling the suffix array with minimizers
inferred← citeshttps://doi.org/10.48550/arxiv.1706.00990openalex-snapshot
A Fast x86 Implementation of Select
inferred← citeshttps://doi.org/10.48550/arxiv.2010.15879openalex-snapshot
Log(Graph): A Near-Optimal High-Performance Graph Representation
inferred← citeshttps://doi.org/10.5220/0007258201490154openalex-snapshot
Vectorized Character Counting for Faster Pattern Matching
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.