On the public citation graph
Deterministic Sampling–A New Technique for Fast Pattern Matching
0 signed · 115 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-642-82456-2_1openalex-snapshot
Open Problems in Stringology
inferredcites →https://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferredcites →https://doi.org/10.1016/0020-0190(89)90206-8openalex-snapshot
An efficient parallel algorithm for random sampling
inferredcites →https://doi.org/10.1016/0020-0190(90)90140-sopenalex-snapshot
Finding an approximate median with high probability in constant parallel time
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/s0019-9958(85)80031-0openalex-snapshot
Optimal parallel algorithms for string matching
inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot
Two theorems on random polynomial time
inferredcites →https://doi.org/10.1109/tit.1959.1057491openalex-snapshot
Minimum-scan pattern recognition
inferredcites →https://doi.org/10.1137/0206048openalex-snapshot
On the Worst-Case Behavior of String-Searching Algorithms
inferredcites →https://doi.org/10.1137/0213027openalex-snapshot
Simulation of Parallel Random Access Machines by Circuits
inferredcites →https://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferredcites →https://doi.org/10.1137/0219072openalex-snapshot
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.1307/mmj/1028998766openalex-snapshot
The equation $a^M=b^Nc^P$ in a free group.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1995.1047openalex-snapshot
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
inferred← citeshttps://doi.org/10.1006/inco.1998.2705openalex-snapshot
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM
inferred← citeshttps://doi.org/10.1006/jagm.1996.0844openalex-snapshot
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
inferred← citeshttps://doi.org/10.1007/11496656_23openalex-snapshot
Two Dimensional Parameterized Matching
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_34openalex-snapshot
On the Complexity of Determining the Period of a String
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_1openalex-snapshot
Probabilistic analysis of generalized suffix trees
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_3openalex-snapshot
On a parallel-algorithms method for string matching problems (overview)
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_72openalex-snapshot
Two-dimensional pattern matching in linear time and small space
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_32openalex-snapshot
Efficient string matching on coded texts
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_36openalex-snapshot
Constant-space string matching with smaller number of comparisons: sequential sampling
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_93openalex-snapshot
N-cube string matching algorithm with long texts
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_110openalex-snapshot
Distributed string matching algorithm on the N-cube
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_10openalex-snapshot
Parallel string matching algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_44openalex-snapshot
Duel and Sweep Algorithm for Order-Preserving Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_6openalex-snapshot
Generalized Function Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_7openalex-snapshot
Alternative Algorithms for Bit-Parallel String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-04003-0_6openalex-snapshot
Regularization and Suboptimal Solutions in Learning from Data
inferred← citeshttps://doi.org/10.1007/978-3-642-10210-3_24openalex-snapshot
Theoretical Issues of Cluster Pattern Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_2openalex-snapshot
On Efficient Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_7openalex-snapshot
Constant-Time Word-Size String Matching
inferred← citeshttps://doi.org/10.1007/978-981-96-5051-4_5openalex-snapshot
Quantum Machine Learning (QML)
inferred← citeshttps://doi.org/10.1007/bf01188584openalex-snapshot
Multiple filtration and approximate pattern matching
inferred← citeshttps://doi.org/10.1007/bfb0049432openalex-snapshot
Work-time optimal parallel prefix matching
inferred← citeshttps://doi.org/10.1007/s00236-024-00464-wopenalex-snapshot
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
inferred← citeshttps://doi.org/10.1007/s00453-015-0060-4openalex-snapshot
Quantum Pattern Matching Fast on Average
inferred← citeshttps://doi.org/10.1007/s00453-022-01092-xopenalex-snapshot
Near-Optimal Quantum Algorithms for String Problems
inferred← citeshttps://doi.org/10.1007/s446-002-8028-1openalex-snapshot
Deterministic broadcasting in ad hoc radio networks
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90020-aopenalex-snapshot
Two-dimensional pattern matching by sampling
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90136-wopenalex-snapshot
A string-matching algorithm for the CREW PRAM
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00052-2openalex-snapshot
Designing algorithms by expectations
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00058-1openalex-snapshot
New algorithms for the LCA problem and the binary tree reconstruction problem
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90003-uopenalex-snapshot
Efficient pattern matching with scaling
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90197-2openalex-snapshot
Efficient CRCW-PRAM algorithms for universal substring searching
inferred← citeshttps://doi.org/10.1016/1049-9660(92)90032-xopenalex-snapshot
Image analysis and computer vision: 1991
inferred← citeshttps://doi.org/10.1016/j.ipm.2013.01.001openalex-snapshot
A deterministic resampling method using overlapping document clusters for pseudo-relevance feedback
inferred← citeshttps://doi.org/10.1016/j.jda.2006.10.001openalex-snapshot
Generalized function matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.013openalex-snapshot
Towards optimal packed string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.034openalex-snapshot
Improved characters distance sampling for online and offline text searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115120openalex-snapshot
A note on quantum divide and conquer for minimal string rotation
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00178-2openalex-snapshot
Faster broadcasting in unknown radio networks
inferred← citeshttps://doi.org/10.1016/s0129-0657(01)00087-4openalex-snapshot
STRING MATCHING ARTIFICIAL NEURAL NETWORKS
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00088-9openalex-snapshot
Inplace 2D matching in compressed images
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00097-xopenalex-snapshot
Faster algorithms for string matching with k mismatches
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00162-7openalex-snapshot
Parallel two dimensional witness computation
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00010-8openalex-snapshot
String matching in O(n+m) quantum time
inferred← citeshttps://doi.org/10.1051/ita/1996300605211openalex-snapshot
Efficient string matching on packed texts
inferred← citeshttps://doi.org/10.1093/comjnl/bxag075openalex-snapshot
Monotonic run length text sampling and fake sampled positions
inferred← citeshttps://doi.org/10.1109/3477.718520openalex-snapshot
Matching of complex patterns by energy minimization
inferred← citeshttps://doi.org/10.1109/3477.718523openalex-snapshot
Optimal neural network algorithm for on-line string matching
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493509openalex-snapshot
A multipattern matching algorithm using sampling and bit index
inferred← citeshttps://doi.org/10.1109/icips.1997.669126openalex-snapshot
A new approach to two-dimensional pattern matching allowing errors
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366862openalex-snapshot
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
inferred← citeshttps://doi.org/10.1109/ted.2015.2394479openalex-snapshot
Optimization of Klystron Designs Using Deterministic Sampling Methods
inferred← citeshttps://doi.org/10.1109/tit.2017.2746566openalex-snapshot
Efficient Low-Redundancy Codes for Correcting Multiple Deletions
inferred← citeshttps://doi.org/10.1137/0222017openalex-snapshot
Recursive Star-Tree Parallel Data Structure
inferred← citeshttps://doi.org/10.1137/0222070openalex-snapshot
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
inferred← citeshttps://doi.org/10.1137/1.9781611973730.36openalex-snapshot
Internal Pattern Matching Queries in a Text and Applications
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch132openalex-snapshot
Efficient Low-Redundancy Codes for Correcting Multiple Deletions
inferred← citeshttps://doi.org/10.1137/1.9781611977073.109openalex-snapshot
Near-Optimal Quantum Algorithms for String Problems
inferred← citeshttps://doi.org/10.1137/23m1567618openalex-snapshot
Internal Pattern Matching Queries in a Text and Applications
inferred← citeshttps://doi.org/10.1137/s0097539792190157openalex-snapshot
Parallel Suffix–Prefix-Matching Algorithm and Applications
inferred← citeshttps://doi.org/10.1137/s0097539792226321openalex-snapshot
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
inferred← citeshttps://doi.org/10.1137/s009753979528007xopenalex-snapshot
Constant-Time Randomized Parallel String Matching
inferred← citeshttps://doi.org/10.1137/s0097539795298321openalex-snapshot
Two-Dimensional Periodicity in Rectangular Arrays
inferred← citeshttps://doi.org/10.1137/s0895480101390308openalex-snapshot
Three-Dimensional Periodicity and Its Application to Pattern Matching
inferred← citeshttps://doi.org/10.1142/9789812709394_0053openalex-snapshot
MOTIF DISCOVERY FIXING MISMATCH POSITIONS
inferred← citeshttps://doi.org/10.1142/s0218001401001349openalex-snapshot
OPTIMALLY FAST CRCW-PRAM TESTING 2D-ARRAYS FOR EXISTENCE OF REPETITIVE PATTERNS
inferred← citeshttps://doi.org/10.1142/s0218001498000476openalex-snapshot
Extracting Common Subtrees from Decision Trees
inferred← citeshttps://doi.org/10.1145/129712.129719openalex-snapshot
Alphabet independent two dimensional matching
inferred← citeshttps://doi.org/10.1145/129712.129720openalex-snapshot
A constant-time optimal parallel string-matching algorithm
inferred← citeshttps://doi.org/10.1145/165231.165242openalex-snapshot
Optimal parallel two dimensional pattern matching
inferred← citeshttps://doi.org/10.1145/195058.195164openalex-snapshot
Symmetry breaking for suffix tree construction
inferred← citeshttps://doi.org/10.1145/210332.210341openalex-snapshot
A constant-time optimal parallel string-matching algorithm
inferred← citeshttps://doi.org/10.1145/215399.215451openalex-snapshot
Optimal parallel dictionary matching and compression (extended abstract)
inferred← citeshttps://doi.org/10.1145/225058.225289openalex-snapshot
Work-time-optimal parallel algorithms for string problems
inferred← citeshttps://doi.org/10.1145/227234.227246openalex-snapshot
Programming parallel algorithms
inferred← citeshttps://doi.org/10.1145/258492.258498openalex-snapshot
Three-dimensional pattern matching
inferred← citeshttps://doi.org/10.1145/2650220openalex-snapshot
Two-Dimensional Parameterized Matching
inferred← citeshttps://doi.org/10.1145/3672395openalex-snapshot
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching
inferred← citeshttps://doi.org/10.1145/383962.384040openalex-snapshot
Distributed multi-broadcast in unknown radio networks
inferred← citeshttps://doi.org/10.1201/9781420011296.ch30openalex-snapshot
Parallel Algorithms on Strings
inferred← citeshttps://doi.org/10.21236/ada263549openalex-snapshot
Class Notes: Programming Parallel Algorithms CS 15-840B (Fall 1992)
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.423openalex-snapshot
Optimal Packed String Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1816openalex-snapshot
Quantum pattern matching fast on average
inferred← citeshttps://doi.org/10.48550/arxiv.2110.09696openalex-snapshot
Near-Optimal Quantum Algorithms for String Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0107011openalex-snapshot
Distributed Broadcast in Wireless Networks with Unknown Topology
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0011049openalex-snapshot
String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time
inferred← citeshttps://doi.org/10.5555/338219.338641openalex-snapshot
Faster algorithms for string matching with k mismatches
inferred← citeshttps://doi.org/10.5555/365411.365756openalex-snapshot
Selective families, superimposed codes, and broadcasting on unknown radio networks
inferred← citeshttps://doi.org/10.7146/brics.v1i42.21600openalex-snapshot
Efficient String Matching on Coded Texts
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.