On the public citation graph
General Document Retrieval in Compact Space
0 signed · 65 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/978-3-540-73437-6_22openalex-snapshot
Space-Efficient Algorithms for Document Retrieval
inferredcites →https://doi.org/10.1007/978-3-540-73437-6_23openalex-snapshot
Compressed Text Indexes with Fast Locate
inferredcites →https://doi.org/10.1007/978-3-540-75530-2_21openalex-snapshot
Implicit Compression Boosting with Applications to Self-indexing
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-03784-9_1openalex-snapshot
Range Quantile Queries: Another Virtue of Wavelet Trees
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_57openalex-snapshot
Optimal Trade-Offs for Succinct String Indexes
inferredcites →https://doi.org/10.1007/978-3-642-15781-3_17openalex-snapshot
Top-k Ranked Document Search in General Text Databases
inferredcites →https://doi.org/10.1007/978-3-642-17514-5_27openalex-snapshot
Alphabet Partitioning for Compressed Rank/Select and Applications
inferredcites →https://doi.org/10.1007/978-3-642-31265-6_14openalex-snapshot
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
inferredcites →https://doi.org/10.1016/j.ipm.2012.08.003openalex-snapshot
DACs: Bringing direct access to variable-length codes
inferredcites →https://doi.org/10.1016/j.jda.2006.03.011openalex-snapshot
Succinct data structures for flexible text retrieval systems
inferredcites →https://doi.org/10.1016/j.jda.2012.07.005openalex-snapshot
Improved compressed indexes for full-text document retrieval
inferredcites →https://doi.org/10.1016/j.tcs.2006.09.014openalex-snapshot
A simple optimal representation for balanced parentheses
inferredcites →https://doi.org/10.1016/j.tcs.2011.12.002openalex-snapshot
New algorithms on wavelet trees and applications to information retrieval
inferredcites →https://doi.org/10.1016/j.tcs.2012.08.004openalex-snapshot
Colored range queries and document retrieval
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.1109/5.892708openalex-snapshot
Off-line dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.1999.755679openalex-snapshot
Offline dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.2008.79openalex-snapshot
Re-pair Achieves High-Order Entropy
inferredcites →https://doi.org/10.1109/dcc.2013.43openalex-snapshot
Faster Compact Top-k Document Retrieval
inferredcites →https://doi.org/10.1109/focs.2009.19openalex-snapshot
Space-Efficient Framework for Top-k String Retrieval Problems
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/090779759openalex-snapshot
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
inferredcites →https://doi.org/10.1137/1.9780898714906openalex-snapshot
Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th 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.9781611972894.13openalex-snapshot
Theory and Practise of Monotone Minimal Perfect Hashing
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/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/1963190.2025378openalex-snapshot
Theory and practice of monotone minimal perfect hashing
inferredcites →https://doi.org/10.1145/2000807.2000820openalex-snapshot
Succinct indexes for strings, binary relations and multilabeled trees
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.3390/a5020214openalex-snapshot
An Online Algorithm for Lightweight Grammar-Based Compression
inferredcites →https://doi.org/10.48550/arxiv.1006.5354openalex-snapshot
Optimal Trade-Off for Succinct String 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/1195881.1195885openalex-snapshot
Succinct suffix arrays based on run-length encoding
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/1496770.1496856openalex-snapshot
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
inferredcites →https://doi.org/10.5555/1873601.1873614openalex-snapshot
Fully-functional succinct trees
inferredcites →https://doi.org/10.5555/545381.545469openalex-snapshot
Efficient algorithms for document retrieval problems
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-3-319-19929-0_18openalex-snapshot
Compact Indexes for Flexible Top-$$k$$ Retrieval
inferred← citeshttps://doi.org/10.1007/s10791-017-9297-7openalex-snapshot
Document retrieval on repetitive string collections
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.12.033openalex-snapshot
Efficient indexing for semantic search
inferred← citeshttps://doi.org/10.1016/j.ic.2019.01.006openalex-snapshot
Lempel–Ziv compressed structures for document retrieval
inferred← citeshttps://doi.org/10.1093/comjnl/bxw103openalex-snapshot
Compressed Bit vectors Based on Variable-to-Fixed Encodings
inferred← citeshttps://doi.org/10.1109/dcc.2017.21openalex-snapshot
Improved Queryable Representations of Rasters
inferred← citeshttps://doi.org/10.1109/icetech.2016.7569283openalex-snapshot
DSSM with text hashing technique for text document retrieval in next-generation search engine for big data and data analytics
inferred← citeshttps://doi.org/10.1137/140998949openalex-snapshot
Time-Optimal Top-$k$ Document Retrieval
inferred← citeshttps://doi.org/10.1145/3043958openalex-snapshot
Practical Compact Indexes for Top- k Document Retrieval
inferred← citeshttps://doi.org/10.48550/arxiv.1408.3093openalex-snapshot
Rank, select and access in grammar-compressed strings
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.