On the public citation graph
Position-Restricted Substring Searching
0 signed · 83 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-30213-1_23openalex-snapshot
An Alphabet-Friendly FM-Index
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/sfcs.2000.892088openalex-snapshot
New data structures for orthogonal range searching
inferredcites →https://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
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.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.5555/545381.545411openalex-snapshot
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
inferredcites →https://doi.org/10.5555/644108.644250openalex-snapshot
High-order entropy-compressed text indexes
inferredcites →https://doi.org/10.5555/982792.982888openalex-snapshot
When indexing equals compression: experiments with compressing suffix arrays and applications
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-030-32686-9_28openalex-snapshot
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-02432-5_7openalex-snapshot
Position-Restricted Substring Searching over Small Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_30openalex-snapshot
Ranked Document Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_21openalex-snapshot
K 2-Treaps: Range Top-k Queries in Compact Space
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_16openalex-snapshot
Succinct Non-overlapping Indexing
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_16openalex-snapshot
Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_57openalex-snapshot
Finding Patterns in Given Intervals
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_3openalex-snapshot
Generalized Substring Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_18openalex-snapshot
Efficient Index for Retrieving Top-k Most Frequent Documents
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_8openalex-snapshot
On Entropy-Compressed Text Indexing in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_38openalex-snapshot
On Optimally Partitioning a Text to Improve Its Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_105openalex-snapshot
Range Non-overlapping Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_24openalex-snapshot
Compression, Indexing, and Retrieval for Massive String Data
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_26openalex-snapshot
Substring Range Reporting
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2openalex-snapshot
Mathematical Foundations of Computer Science 2012
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_68openalex-snapshot
Computing Lempel-Ziv Factorization Online
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_18openalex-snapshot
Orthogonal Range Searching for Text Indexing
inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_8openalex-snapshot
Orthogonal Range Search Data Structures
inferred← citeshttps://doi.org/10.1007/s00453-010-9437-6openalex-snapshot
On Optimally Partitioning a Text to Improve Its Compression
inferred← citeshttps://doi.org/10.1007/s00453-013-9792-1openalex-snapshot
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
inferred← citeshttps://doi.org/10.1007/s00453-019-00605-5openalex-snapshot
Succinct Non-overlapping Indexing
inferred← citeshttps://doi.org/10.1007/s00778-025-00935-7openalex-snapshot
Text indexing for long patterns using locally consistent anchors
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.027openalex-snapshot
Optimal prefix and suffix queries on texts
inferred← citeshttps://doi.org/10.1016/j.is.2014.06.002openalex-snapshot
The wavelet matrix: An efficient wavelet tree for large alphabets
inferred← citeshttps://doi.org/10.1016/j.is.2015.02.002openalex-snapshot
Data structures for temporal graphs based on compact sequence representations
inferred← citeshttps://doi.org/10.1016/j.is.2016.03.004openalex-snapshot
Aggregated 2D range queries on clustered points
inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.003openalex-snapshot
Efficient index for retrieving top-k most frequent documents
inferred← citeshttps://doi.org/10.1016/j.jda.2012.08.003openalex-snapshot
Succinct representations of weighted trees supporting path queries
inferred← citeshttps://doi.org/10.1016/j.jda.2012.09.002openalex-snapshot
On position restricted substring searching in succinct space
inferred← citeshttps://doi.org/10.1016/j.jda.2016.10.001openalex-snapshot
Grammar compressed sequences with rank/select support
inferred← citeshttps://doi.org/10.1016/j.jda.2017.10.001openalex-snapshot
Position-restricted substring searching over small alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.002openalex-snapshot
New algorithms on wavelet trees and applications to information retrieval
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.015openalex-snapshot
Improved algorithms for the range next value problem and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.010openalex-snapshot
Generalized substring compression
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.018openalex-snapshot
Extracting powers and periods in a word from its runs structure
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.006openalex-snapshot
I/O-efficient data structures for non-overlapping indexing
inferred← citeshttps://doi.org/10.1093/bib/bbag333openalex-snapshot
The sequence alignment problem: boundary conditions as the unifying principle
inferred← citeshttps://doi.org/10.1109/bigcomp.2017.7881724openalex-snapshot
Position-restricted approximate string matching with metric Hamming distance
inferred← citeshttps://doi.org/10.1109/ccp.2011.18openalex-snapshot
Backwards Search in Context Bound Text Transformations
inferred← citeshttps://doi.org/10.1109/ccp.2011.45openalex-snapshot
Pattern Matching on Sparse Suffix Trees
inferred← citeshttps://doi.org/10.1109/dcc.2008.67openalex-snapshot
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
inferred← citeshttps://doi.org/10.1109/dcc.2010.45openalex-snapshot
I/O-Efficient Compressed Text Indexes: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/dcc.2013.43openalex-snapshot
Faster Compact Top-k Document Retrieval
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00367openalex-snapshot
Space-Efficient Indexes for Uncertain Strings
inferred← citeshttps://doi.org/10.1109/la-web.2008.26openalex-snapshot
An Overview of Web Research in Chile
inferred← citeshttps://doi.org/10.1109/tkde.2022.3231780openalex-snapshot
Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search
inferred← citeshttps://doi.org/10.1137/1.9781611972818.14openalex-snapshot
Kernel-based Similarity Search in Massive Graph Databases with Wavelet Trees
inferred← citeshttps://doi.org/10.1137/1.9781611975055.2openalex-snapshot
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/1613676.1613680openalex-snapshot
Compressing and indexing labeled trees, with applications
inferred← citeshttps://doi.org/10.1145/3043958openalex-snapshot
Practical Compact Indexes for Top- k Document Retrieval
inferred← citeshttps://doi.org/10.14778/3598581.3598586openalex-snapshot
Text Indexing for Long Patterns: Anchors are All you Need
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1641openalex-snapshot
String Searching with Ranking Constraints and Uncertainty
inferred← citeshttps://doi.org/10.3233/fi-2010-283openalex-snapshot
Finding Patterns In Given Intervals
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1359openalex-snapshot
Improved Algorithms for the Range Next Value Problem and Applications
inferred← citeshttps://doi.org/10.46298/dmtcs.3541openalex-snapshot
Optimal Prefix and Suffix Queries on Texts
inferred← citeshttps://doi.org/10.48550/arxiv.0909.4893openalex-snapshot
Range Non-Overlapping Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1202.5233openalex-snapshot
Computing Lempel-Ziv Factorization Online
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5353openalex-snapshot
Faster Compact Top-k Document Retrieval
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0615openalex-snapshot
Orthogonal Range Searching for Text Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1220openalex-snapshot
Efficient Compressed Wavelet Trees over Large Alphabets
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.