On the public citation graph

https://doi.org/10.4086/toc.2016.v012a018

0 signed · 63 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.1006/jcss.2002.1826openalex-snapshot
Quantum Lower Bounds by Quantum Arguments
inferredcites →https://doi.org/10.1007/11672142_13openalex-snapshot
Quantum Algorithms for Matching and Network Flows
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-0653-8openalex-snapshot
Matrix Analysis
inferredcites →https://doi.org/10.1007/978-3-540-24618-3_11openalex-snapshot
Quantum Query Complexity for Some Graph Problems
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_63openalex-snapshot
Impossibility of a Quantum Speed-Up with a Faulty Oracle
inferredcites →https://doi.org/10.1007/bf00736012openalex-snapshot
Quantum mechanical interaction-free measurements
inferredcites →https://doi.org/10.1007/s00224-008-9118-xopenalex-snapshot
Quantum Algorithms for Matching Problems
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.019openalex-snapshot
On the power of Ambainis lower bounds
inferredcites →https://doi.org/10.1016/s0304-3975(01)00144-xopenalex-snapshot
Complexity measures and decision tree complexity: a survey
inferredcites →https://doi.org/10.1038/nature04523openalex-snapshot
Counterfactual quantum computation through quantum interrogation
inferredcites →https://doi.org/10.1063/1.523304openalex-snapshot
The Zeno’s paradox in quantum theory
inferredcites →https://doi.org/10.1073/pnas.43.9.842openalex-snapshot
TWO THEOREMS IN GRAPH THEORY
inferredcites →https://doi.org/10.1098/rspa.2000.0714openalex-snapshot
Counterfactual computation
inferredcites →https://doi.org/10.1103/physrevlett.103.230501openalex-snapshot
Counterfactual Quantum Cryptography
inferredcites →https://doi.org/10.1103/physrevlett.110.170502openalex-snapshot
Protocol for Direct Counterfactual Quantum Communication
inferredcites →https://doi.org/10.1103/physrevlett.112.208901openalex-snapshot
Comment on “Protocol for Direct Counterfactual Quantum Communication”
inferredcites →https://doi.org/10.1103/physrevlett.74.4763openalex-snapshot
Interaction-Free Measurement
inferredcites →https://doi.org/10.1103/physrevlett.98.160403openalex-snapshot
Impossibility of the Counterfactual Computation for All Possible Outcomes
inferredcites →https://doi.org/10.1109/focs.2004.53openalex-snapshot
Quantum Speed-Up of Markov Chain Based Algorithms
inferredcites →https://doi.org/10.1109/focs.2011.75openalex-snapshot
Quantum Query Complexity of State Conversion
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/0215006openalex-snapshot
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1137/0220062openalex-snapshot
CREW PRAM s and Decision Trees
inferredcites →https://doi.org/10.1137/050644719openalex-snapshot
Quantum Query Complexity of Some Graph Problems
inferredcites →https://doi.org/10.1137/090745854openalex-snapshot
Search via Quantum Walk
inferredcites →https://doi.org/10.1137/1.9781611973082.44openalex-snapshot
Reflections for quantum query algorithms
inferredcites →https://doi.org/10.1137/1.9781611973105.106openalex-snapshot
Nested Quantum Walks with Quantum Data Structures
inferredcites →https://doi.org/10.1137/s0097539705447311openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/1008908.1008920openalex-snapshot
Conjugate coding
inferredcites →https://doi.org/10.1145/1250790.1250867openalex-snapshot
Negative weights make adversaries stronger
inferredcites →https://doi.org/10.1145/2213977.2213985openalex-snapshot
Span programs for functions with constant-sized 1-certificates
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/502090.502097openalex-snapshot
Quantum lower bounds by polynomials
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.26421/qic8.8-9-11openalex-snapshot
A panoply of quantum algorithms
inferredcites →https://doi.org/10.4086/cjtcs.2013.004openalex-snapshot
inferredcites →https://doi.org/10.4086/tocopenalex-snapshot
Theory of Computing
inferredcites →https://doi.org/10.4230/lipics.icalp.2019.8openalex-snapshot
A Quantum Algorithm for Finding the Minimum
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.48550/arxiv.quant-ph/0606092openalex-snapshot
The limits of counterfactual computation
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0607101openalex-snapshot
Counterfactual computation revisited
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0612159openalex-snapshot
Weak Measurements and Counterfactual Computation

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-83508-8_39openalex-snapshot
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-87809-2_1openalex-snapshot
Quantum Algorithms for String Processing
inferred← citeshttps://doi.org/10.1007/s42484-022-00080-2openalex-snapshot
Simplified quantum algorithm for the oracle identification problem
inferred← citeshttps://doi.org/10.1038/npjqi.2015.23openalex-snapshot
Quantum algorithms: an overview
inferred← citeshttps://doi.org/10.1109/smartcomp-companion70724.2026.00039openalex-snapshot
Quantum k-means based on Quantum Local Sensitive Hashing with Application to Irrigation Machine Sensors Data Clustering
inferred← citeshttps://doi.org/10.1109/telfor63250.2024.10819126openalex-snapshot
Optimized Red-Black Trees for the Most Frequent String Problem in Noisy Comparison Models
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/3106700.3106710openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3519269openalex-snapshot
Time- and Query-optimal Quantum Algorithms Based on Decision Trees
inferred← citeshttps://doi.org/10.22331/q-2020-03-02-241openalex-snapshot
Quantum Speedup Based on Classical Decision Trees
inferred← citeshttps://doi.org/10.22331/q-2025-06-23-1777openalex-snapshot
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
inferred← citeshttps://doi.org/10.33581/1561-4085-2021-24-3-207-221openalex-snapshot
Classical and Quantum Algorithms for Assembling a Text from a Dictionary
inferred← citeshttps://doi.org/10.3390/math10030377openalex-snapshot
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
inferred← citeshttps://doi.org/10.3390/math11224707openalex-snapshot
Noisy Tree Data Structures and Quantum Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1701.06806openalex-snapshot
A Survey of Quantum Learning Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1912.02176openalex-snapshot
Quantum Query Complexity of Dyck Languages with Bounded Height
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.