On the public citation graph
Output-Sensitive Autocompletion Search
0 signed · 56 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/11786986_49openalex-snapshot
The Myriad Virtues of Wavelet Trees
inferredcites →https://doi.org/10.1007/11880561_11openalex-snapshot
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory
inferredcites →https://doi.org/10.1007/11880561_13openalex-snapshot
Output-Sensitive Autocompletion Search
inferredcites →https://doi.org/10.1007/s007990050041openalex-snapshot
Lexically-generated subject hierarchies for browsing large collections
inferredcites →https://doi.org/10.1016/s0022-0000(03)00028-xopenalex-snapshot
Two-dimensional substring indexing
inferredcites →https://doi.org/10.1109/2.60879openalex-snapshot
The Reactive Keyboard: a predictive typing aid
inferredcites →https://doi.org/10.1109/sfcs.2000.892088openalex-snapshot
New data structures for orthogonal range searching
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
inferredcites →https://doi.org/10.1145/22627.22391openalex-snapshot
Autocompletion in full text transaction entry: a method for humanized input
inferredcites →https://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/303976.304010openalex-snapshot
On two-dimensional indexability and optimal range search indexing
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.1145/336597.336666openalex-snapshot
Scalable browsing for large collections
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/985921.986014openalex-snapshot
A commonsense approach to predictive text entry
inferredcites →https://doi.org/10.22028/d291-25983openalex-snapshot
Efficient index structures for and applications of the CompleteSearch engine
inferredcites →https://doi.org/10.5555/338219.338634openalex-snapshot
Adaptive set intersections, unions, and differences
inferredcites →https://doi.org/10.5555/982792.982888openalex-snapshot
When indexing equals compression: experiments with compressing suffix arrays and applications
inferredcites →https://doi.org/10.6028/nist.sp.500-261openalex-snapshot
The thirteenth text REtrieval conference, TREC 2004
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.2516openalex-snapshot
Practical rearrangement methods for dynamic double‐array dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_22openalex-snapshot
Space-Efficient Algorithms for Document Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-17616-6_19openalex-snapshot
Efficient Interactive Smart Keyword Search
inferred← citeshttps://doi.org/10.1007/978-3-642-22351-8_2openalex-snapshot
Location-Based Instant Search
inferred← citeshttps://doi.org/10.1007/s00778-011-0218-xopenalex-snapshot
Efficient fuzzy full-text type-ahead search
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.1007/s10791-022-09416-9openalex-snapshot
Applying burst-tries for error-tolerant prefix search
inferred← citeshttps://doi.org/10.1016/j.is.2015.08.008openalex-snapshot
Practical compressed string dictionaries
inferred← citeshttps://doi.org/10.1021/acs.chemrev.6b00851openalex-snapshot
Information Retrieval and Text Mining Technologies for Chemistry
inferred← citeshttps://doi.org/10.1109/ctems.2018.8769132openalex-snapshot
Review on Query Auto-Completion
inferred← citeshttps://doi.org/10.1109/wi-iat.2009.364openalex-snapshot
DBLP-SSE: A DBLP Search Support Engine
inferred← citeshttps://doi.org/10.1109/wi-iat.2012.217openalex-snapshot
COMMA: A Result-Oriented Composite Autocompletion Method for E-marketplaces
inferred← citeshttps://doi.org/10.1145/1526709.1526760openalex-snapshot
Efficient interactive fuzzy keyword search
inferred← citeshttps://doi.org/10.1145/1874590.1874591openalex-snapshot
Extracting authoring information based on keywords and semantic search
inferred← citeshttps://doi.org/10.1145/1877766.1877768openalex-snapshot
Engineering basic algorithms of an in-memory text search engine
inferred← citeshttps://doi.org/10.1145/2806416.2806435openalex-snapshot
A Network-Aware Approach for Searching As-You-Type in Social Media
inferred← citeshttps://doi.org/10.1177/01655515261487153openalex-snapshot
A study of user interactions with “Query AutoCompletion” and “Related Searches” on the Google search engine
inferred← citeshttps://doi.org/10.1561/1500000055openalex-snapshot
A Survey of Query Auto Completion in Information Retrieval
inferred← citeshttps://doi.org/10.17485/ijst/v13i11.2020-32openalex-snapshot
Instant fuzzy search using probabilistic-correlation based ranking
inferred← citeshttps://doi.org/10.22028/d291-25983openalex-snapshot
Efficient index structures for and applications of the CompleteSearch engine
inferred← citeshttps://doi.org/10.23940/ijpe.19.04.p20.12471254openalex-snapshot
Compression Method of Factor Oracle by Triple-Array Structures
inferred← citeshttps://doi.org/10.3233/wia-140284openalex-snapshot
Composite match autocompletion (COMMA): A semantic result-oriented autocompletion technique for e-marketplaces
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6023openalex-snapshot
Spaces, Trees and Colors: The Algorithmic Landscape of Document Retrieval on Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1507.08107openalex-snapshot
A Network-Aware Approach for Searching As-You-Type in Social Media (Extended Version)
inferred← citeshttps://doi.org/10.5555/2457524.2457644openalex-snapshot
COMMA: A Result-Oriented Composite Autocompletion Method for E-marketplaces
inferred← citeshttps://doi.org/10.5916/jkosme.2015.39.6.656openalex-snapshot
Performance Analysis of a Korean Word Autocomplete System and New Evaluation Metrics
showing the first 30 of 31 · page through all 31
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.