On the public citation graph

Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator

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.
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.1002/(sici)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-popenalex-snapshot
Tight Bounds on Quantum Searching
inferredcites →https://doi.org/10.1007/3-540-45061-0openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/978-3-030-19311-9_13openalex-snapshot
Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs
inferredcites →https://doi.org/10.1007/978-3-030-19955-5_20openalex-snapshot
On the Quantum and Classical Complexity of Solving Subtraction Games
inferredcites →https://doi.org/10.1007/978-3-030-34500-6_17openalex-snapshot
Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
inferredcites →https://doi.org/10.1007/978-3-030-61739-4_6openalex-snapshot
Quantum-over-Classical Advantage in Solving Multiplayer Games
inferredcites →https://doi.org/10.1007/978-3-030-87809-2_1openalex-snapshot
Quantum Algorithms for String Processing
inferredcites →https://doi.org/10.1007/978-3-030-87993-8_5openalex-snapshot
Quantum Algorithm for Dyck Language with Multiple Types of Brackets
inferredcites →https://doi.org/10.1007/s00453-002-0976-3openalex-snapshot
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
inferredcites →https://doi.org/10.1007/s00453-015-0060-4openalex-snapshot
Quantum Pattern Matching Fast on Average
inferredcites →https://doi.org/10.1007/s11047-021-09863-1openalex-snapshot
Classical and quantum algorithms for constructing text from dictionary problem
inferredcites →https://doi.org/10.1007/s11128-020-02939-4openalex-snapshot
Upperbounds on the probability of finding marked connected components using quantum walks
inferredcites →https://doi.org/10.1016/j.cosrev.2010.09.007openalex-snapshot
Streaming techniques and data aggregation in networks of tiny artefacts
inferredcites →https://doi.org/10.1016/s1570-8667(03)00010-8openalex-snapshot
String matching in O(n+m) quantum time
inferredcites →https://doi.org/10.1017/cbo9780511800191openalex-snapshot
Advanced Data Structures
inferredcites →https://doi.org/10.1090/conm/305/05215openalex-snapshot
Quantum amplitude amplification and estimation
inferredcites →https://doi.org/10.1103/physreva.64.022307openalex-snapshot
Grover algorithm with zero theoretical failure rate
inferredcites →https://doi.org/10.1109/intech.2013.6653693openalex-snapshot
Sorting N elements using quantum entanglement sets
inferredcites →https://doi.org/10.1109/lisat.2016.7494107openalex-snapshot
Quantum sort algorithm based on entanglement qubits {00, 11}
inferredcites →https://doi.org/10.1137/1.9781611977073.109openalex-snapshot
Near-Optimal Quantum Algorithms for String Problems
inferredcites →https://doi.org/10.1137/s0097539705447311openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1137/s0097539791195877openalex-snapshot
Computing with Noisy Information
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1142/9789813272880_0181openalex-snapshot
UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY
inferredcites →https://doi.org/10.1142/s0129054115500239openalex-snapshot
The Frequent Items Problem in Online Streaming Under Various Performance Measures
inferredcites →https://doi.org/10.1145/1008731.1008735openalex-snapshot
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1145/1457838.1457895openalex-snapshot
File searching using variable length keys
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/780542.780553openalex-snapshot
Quantum time-space tradeoffs for sorting
inferredcites →https://doi.org/10.14778/1454159.1454225openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1561/0400000002openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.26599/bdma.2019.9020016openalex-snapshot
On quantum methods for machine learning problems part I: Quantum tools
inferredcites →https://doi.org/10.33581/1561-4085-2021-24-3-207-221openalex-snapshot
Classical and Quantum Algorithms for Assembling a Text from a Dictionary
inferredcites →https://doi.org/10.4086/toc.2016.v012a018openalex-snapshot
inferredcites →https://doi.org/10.4230/lipics.ccc.2015.537openalex-snapshot
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.52openalex-snapshot
Randomized Communication vs. Partition Number.
inferredcites →https://doi.org/10.4230/lipics.mfcs.2020.8openalex-snapshot
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
inferredcites →https://doi.org/10.4230/lipics.stacs.2014.482openalex-snapshot
An optimal quantum algorithm for the oracle identification problem
inferredcites →https://doi.org/10.4230/lipics.tqc.2020.2openalex-snapshot
Improved Approximate Degree Bounds For k-distinctness
inferredcites →https://doi.org/10.48550/arxiv.1907.06840openalex-snapshot
The Quantum Version Of Classification Decision Tree Constructing Algorithm C5.0
inferredcites →https://doi.org/10.6028/nist.ir.8318openalex-snapshot
DADS:

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-38906-1_32openalex-snapshot
External-Memory Sorting with Comparison Errors
inferred← citeshttps://doi.org/10.1007/978-3-031-63742-1_10openalex-snapshot
Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_5openalex-snapshot
Quantum Algorithm for the Multiple String Matching Problem
inferred← citeshttps://doi.org/10.1088/1751-8121/ada744openalex-snapshot
Optimization and design for multi-valued quantum comparator circuits
inferred← citeshttps://doi.org/10.1134/s106373972360084xopenalex-snapshot
Quantum Algorithm for Searching of Two Sets Intersection
inferred← citeshttps://doi.org/10.1134/s1995080223020191openalex-snapshot
Quantum Algorithm for Dynamic Programming Approach for DAGs and Applications
inferred← citeshttps://doi.org/10.1145/3558481.3591093openalex-snapshot
Optimal Parallel Sorting with Comparison Errors
inferred← citeshttps://doi.org/10.20948/dms-2022-13openalex-snapshot
Lower bound of quantum request complexity of radix sort
inferred← citeshttps://doi.org/10.20948/dms-2022-22openalex-snapshot
Search tree with probabilistic key comparison and quantum string sorting
inferred← citeshttps://doi.org/10.26421/qic24.3-4-4openalex-snapshot
Quantum algorithms for SCS and text assembling problems
inferred← citeshttps://doi.org/10.3389/fbinf.2026.1802517openalex-snapshot
A foundational quantum framework for multi-pattern string matching in k-mer detection
inferred← citeshttps://doi.org/10.3390/math10214032openalex-snapshot
Preface to the Special Issue on “Quantum Computing Algorithms and Computational Complexity”
inferred← citeshttps://doi.org/10.3390/math11224707openalex-snapshot
Noisy Tree Data Structures and Quantum Applications
inferred← citeshttps://doi.org/10.64898/2025.12.21.695808openalex-snapshot
Quantum implementation of multi-pattern string matching for k-mer detection
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.