On the public citation graph

Micro‐ and macro‐optimizations of S aa T search

https://doi.org/10.1002/spe.2683
0 signed · 25 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/978-3-319-30671-1_30openalex-snapshot
Toward Reproducible Baselines: The Open-Source IR Reproducibility Challenge
inferredcites →https://doi.org/10.1007/s10791-016-9291-5openalex-snapshot
The role of index compression in score-at-a-time query evaluation
inferredcites →https://doi.org/10.1016/j.jss.2017.04.018openalex-snapshot
How developers micro-optimize Android apps
inferredcites →https://doi.org/10.1145/1148170.1148235openalex-snapshot
Pruned query evaluation using pre-computed impacts
inferredcites →https://doi.org/10.1145/2505515.2507860openalex-snapshot
Maintaining discriminatory power in quantized indexes
inferredcites →https://doi.org/10.1145/2682862.2682870openalex-snapshot
Compression, SIMD, and Postings Lists
inferredcites →https://doi.org/10.1145/2808194.2809477openalex-snapshot
Anytime Ranking for Impact-Ordered Indexes
inferredcites →https://doi.org/10.1145/3018661.3018726openalex-snapshot
A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation
inferredcites →https://doi.org/10.1145/3166072.3166073openalex-snapshot
Early Termination Heuristics for Score-at-a-Time Index Traversal
inferredcites →https://doi.org/10.1145/383952.383957openalex-snapshot
Vector-space ranking with effective early termination
inferredcites →https://doi.org/10.1145/956863.956944openalex-snapshot
Efficient query evaluation using a two-level retrieval process

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-031-88711-6_18openalex-snapshot
PEIR: Modeling Performance in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1016/j.future.2021.07.021openalex-snapshot
The NAS Parallel Benchmarks for evaluating C++ parallel programming frameworks on shared-memory architectures
inferred← citeshttps://doi.org/10.1109/tse.2024.3436623openalex-snapshot
Long Live the Image: On Enabling Resilient Production Database Containers for Microservice Applications
inferred← citeshttps://doi.org/10.1145/3397271.3401404openalex-snapshot
Supporting Interoperability Between Open-Source Search Engines with the Common Index File Format
inferred← citeshttps://doi.org/10.1145/3397271.3401413openalex-snapshot
JASSjr: The Minimalistic BM25 Search Engine for Teaching and Learning Information Retrieval
inferred← citeshttps://doi.org/10.1145/3467890openalex-snapshot
Anytime Ranking on Document-Ordered Indexes
inferred← citeshttps://doi.org/10.1145/3477495.3531657openalex-snapshot
A Common Framework for Exploring Document-at-a-Time and Score-at-a-Time Retrieval Methods
inferred← citeshttps://doi.org/10.1145/3576922openalex-snapshot
Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations
inferred← citeshttps://doi.org/10.1145/3726302.3730123openalex-snapshot
Search Efficiency for Score-at-a-Time Retrieval
inferred← citeshttps://doi.org/10.1145/3726302.3730197openalex-snapshot
Fast and Effective Early Termination for Simple Ranking Functions
inferred← citeshttps://doi.org/10.1145/3805712.3808554openalex-snapshot
Insights into the Efficiency of Open-Source Score-at-a-Time Search Engines: A Reproducibility Study
inferred← citeshttps://doi.org/10.2200/s01123ed1v01y202108hlt053openalex-snapshot
Pretrained Transformers for Text Ranking: BERT and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2003.08276openalex-snapshot
Supporting Interoperability Between Open-Source Search Engines with the Common Index File Format
inferred← citeshttps://doi.org/10.48550/arxiv.2110.11540openalex-snapshot
Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation
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.