On the public citation graph

Efficient Implementation of Rank and Select Functions for Succinct Representation

0 signed · 44 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.1006/jagm.2000.1151openalex-snapshot
Space Efficient Suffix Trees
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45061-0_29openalex-snapshot
Succinct Representations of Permutations
inferredcites →https://doi.org/10.1007/3-540-45061-0_30openalex-snapshot
Succinct Dynamic Dictionaries and Trees
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-49382-2_17openalex-snapshot
Space Efficient Suffix Trees
inferredcites →https://doi.org/10.1016/0166-218x(84)90126-4openalex-snapshot
On the succinct representation of graphs
inferredcites →https://doi.org/10.1016/s0019-9958(83)80004-7openalex-snapshot
Succinct representations of graphs
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
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.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/335305.335351openalex-snapshot
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
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/365411.365458openalex-snapshot
An experimental study of an opportunistic index
inferredcites →https://doi.org/10.5555/545381.545410openalex-snapshot
Succinct representations of lcp information and improvements in the compressed suffix arrays
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/11764298_12openalex-snapshot
Engineering the LOUDS Succinct Tree Representation
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-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-319-47846-3_16openalex-snapshot
Formal Verification of the rank Algorithm for Succinct Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_12openalex-snapshot
Broadword Implementation of Rank/Select Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_19openalex-snapshot
Compressed Prefix Sums
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/s10115-016-0999-8openalex-snapshot
Compressed double-array tries for string dictionaries supporting fast lookup
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.001openalex-snapshot
Space-efficient construction of Lempel–Ziv compressed text indexes
inferred← citeshttps://doi.org/10.1093/comjnl/bxw103openalex-snapshot
Compressed Bit vectors Based on Variable-to-Fixed Encodings
inferred← citeshttps://doi.org/10.1109/candar.2014.93openalex-snapshot
Direct Accessible Filter Using Succinct Data Structure for Packet Filtering
inferred← citeshttps://doi.org/10.1109/candar.2015.86openalex-snapshot
Storage-Efficient Tree Structure with Level-Ordered Unary Degree Sequence for Packet Classification
inferred← citeshttps://doi.org/10.1109/iacs.2014.6841955openalex-snapshot
A fast and compact hybrid memory resident datastore for text analytics with autonomic memory allocation
inferred← citeshttps://doi.org/10.11185/imt.5.1022openalex-snapshot
Succinct Semi-structured Data Mining Based on FREQT
inferred← citeshttps://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferred← citeshttps://doi.org/10.1137/1.9781611972894.13openalex-snapshot
Theory and Practise of Monotone Minimal Perfect Hashing
inferred← citeshttps://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferred← citeshttps://doi.org/10.1145/1353343.1353354openalex-snapshot
Engineering succinct DOM
inferred← citeshttps://doi.org/10.1145/1412228.1455263openalex-snapshot
Succinct backward-DAWG-matching
inferred← citeshttps://doi.org/10.1145/1671970.1883684openalex-snapshot
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
inferred← citeshttps://doi.org/10.1145/1963190.2025378openalex-snapshot
Theory and practice of monotone minimal perfect hashing
inferred← citeshttps://doi.org/10.18653/v1/w19-3105openalex-snapshot
On the Compression of Lexicon Transducers
inferred← citeshttps://doi.org/10.21437/interspeech.2018-1333openalex-snapshot
Statistical Model Compression for Small-Footprint Natural Language Understanding
inferred← citeshttps://doi.org/10.25439/rmt.27354450openalex-snapshot
Scalable succinct indexing for large text collections
inferred← citeshttps://doi.org/10.3115/1667583.1667689openalex-snapshot
A succinct N-gram language model
inferred← citeshttps://doi.org/10.3233/fi-2009-0066openalex-snapshot
Simple Random Access Compression
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.