On the public citation graph
Clustered Elias-Fano Indexes
0 signed · 55 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.1002/asi.4630270302openalex-snapshot
Relevance weighting of search terms
inferredcites →https://doi.org/10.1002/spe.2203openalex-snapshot
Decoding billions of integers per second through vectorization
inferredcites →https://doi.org/10.1007/978-1-84628-959-0openalex-snapshot
Variable-length Codes for Data Compression
inferredcites →https://doi.org/10.1007/978-3-540-71496-5_12openalex-snapshot
Sorting Out the Document Identifier Assignment Problem
inferredcites →https://doi.org/10.1007/978-3-642-04409-0_50openalex-snapshot
Entry Pairing in Inverted File
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.1016/j.websem.2011.04.004openalex-snapshot
Searching web data: An entity retrieval and high-performance indexing model
inferredcites →https://doi.org/10.1017/cbo9780511809071openalex-snapshot
Introduction to Information Retrieval
inferredcites →https://doi.org/10.1023/a:1013002601898openalex-snapshot
Binary Interpolative Coding for Effective Index Compression
inferredcites →https://doi.org/10.1023/b:inrt.0000048490.99518.5copenalex-snapshot
Inverted Index Compression Using Word-Aligned Binary Codes
inferredcites →https://doi.org/10.1108/k.2011.40.9_10.1555.5openalex-snapshot
Information Retrieval: Implementing and Evaluating Search Engines
inferredcites →https://doi.org/10.1109/icde.1998.655800openalex-snapshot
Compressing relations and indexes
inferredcites →https://doi.org/10.1109/icde.2006.150openalex-snapshot
Super-Scalar RAM-CPU Cache Compression
inferredcites →https://doi.org/10.1109/icde.2012.149openalex-snapshot
Earlybird: Real-Time Search at Twitter
inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
inferredcites →https://doi.org/10.1109/tnn.2005.845141openalex-snapshot
Survey of Clustering Algorithms
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.1145/1132956.1132959openalex-snapshot
Inverted files for text search engines
inferredcites →https://doi.org/10.1145/1277741.1277855openalex-snapshot
Heavy-tailed distributions and multi-keyword queries
inferredcites →https://doi.org/10.1145/1321440.1321546openalex-snapshot
Index compression is good, especially for random access
inferredcites →https://doi.org/10.1145/1390156openalex-snapshot
Proceedings of the 25th international conference on Machine learning - ICML '08
inferredcites →https://doi.org/10.1145/1526709.1526764openalex-snapshot
Inverted index compression and query processing with optimized document ordering
inferredcites →https://doi.org/10.1145/2063576.2063627openalex-snapshot
SIMD-based decoding of posting lists
inferredcites →https://doi.org/10.1145/2600428.2609615openalex-snapshot
Partitioned Elias-Fano indexes
inferredcites →https://doi.org/10.1145/2684822.2685297openalex-snapshot
Optimal Space-time Tradeoffs for Inverted Indexes
inferredcites →https://doi.org/10.1145/2911451.2911518openalex-snapshot
Leveraging Context-Free Grammar for Efficient Inverted Index Compression
inferredcites →https://doi.org/10.1145/2939672.2939862openalex-snapshot
Compressing Graphs and Indexes with Recursive Graph Bisection
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/956863.956944openalex-snapshot
Efficient query evaluation using a two-level retrieval process
inferredcites →https://doi.org/10.5555/1283383.1283494openalex-snapshot
k-means++: the advantages of careful seeding
inferredcites →https://doi.org/10.5860/choice.46-2715openalex-snapshot
Introduction to information retrieval
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.2556openalex-snapshot
Compact inverted index storage using general‐purpose compression libraries
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_52-1openalex-snapshot
Inverted Index Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_52-2openalex-snapshot
Inverted Index Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_52openalex-snapshot
Inverted Index Compression
inferred← citeshttps://doi.org/10.1007/s12539-025-00786-4openalex-snapshot
Dear-OMG: An Omics-General Compression Method for Genomics, Proteomics and Metabolomics Data
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac245openalex-snapshot
Sparse and skew hashing of K-mers
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf102openalex-snapshot
Engineering rank/select data structures for large-alphabet strings
inferred← citeshttps://doi.org/10.1109/iske.2017.8258806openalex-snapshot
An accident prediction approach based on XGBoost
inferred← citeshttps://doi.org/10.1109/tkde.2019.2911288openalex-snapshot
On Optimally Partitioning Variable-Byte Codes
inferred← citeshttps://doi.org/10.1109/tkde.2022.3208902openalex-snapshot
Tradeoff Options for Bipartite Graph Partitioning
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/3159652.3159663openalex-snapshot
Index Compression Using Byte-Aligned ANS Coding and Two-Dimensional Contexts
inferred← citeshttps://doi.org/10.1145/3289600.3290962openalex-snapshot
Fast Dictionary-Based Compression for Inverted Indexes
inferred← citeshttps://doi.org/10.1145/3415148openalex-snapshot
Techniques for Inverted Index Compression
inferred← citeshttps://doi.org/10.1145/3524060openalex-snapshot
A Learned Approach to Design Compressed Rank/Select Data Structures
inferred← citeshttps://doi.org/10.1145/3673791.3698419openalex-snapshot
Binary Interpolative Coding Revisited
inferred← citeshttps://doi.org/10.1145/3749098openalex-snapshot
Compressing Integer Lists with Contextual Arithmetic Trits
inferred← citeshttps://doi.org/10.1186/s13015-024-00251-9openalex-snapshot
Fulgor: a fast and compact k-mer index for large-scale matching and color queries
inferred← citeshttps://doi.org/10.48550/arxiv.1907.01032openalex-snapshot
On Slicing Sorted Integer 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.