On the public citation graph

Complexity of Quantum Uniform and Nonuniform Automata

https://doi.org/10.1007/11505877_7
0 signed · 46 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.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-27477-4_15openalex-snapshot
Communication Complexity
inferredcites →https://doi.org/10.1007/3-540-44612-5openalex-snapshot
Mathematical foundations of computer science 2000 : 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28-September 1, 2000 : proceedings
inferredcites →https://doi.org/10.1007/3-540-44612-5_9openalex-snapshot
On the Lower Bounds for One-Way Quantum Automata
inferredcites →https://doi.org/10.1007/3-540-44669-9_8openalex-snapshot
On Computational Power of Quantum Branching Programs
inferredcites →https://doi.org/10.1007/3-540-44968-x_46openalex-snapshot
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction
inferredcites →https://doi.org/10.1007/3-540-45465-9_30openalex-snapshot
Quantum and Stochastic Branching Programs of Bounded Width
inferredcites →https://doi.org/10.1007/3-540-56939-1_76openalex-snapshot
Lower bounds for one-way probabilistic communication complexity
inferredcites →https://doi.org/10.1007/978-3-662-03442-2openalex-snapshot
Communication Complexity and Parallel Computing
inferredcites →https://doi.org/10.1007/bfb0029945openalex-snapshot
Communication complexity
inferredcites →https://doi.org/10.1016/j.tcs.2004.12.031openalex-snapshot
Quantum branching programs and space-bounded nonuniform quantum complexity
inferredcites →https://doi.org/10.1016/s0019-9958(63)90290-0openalex-snapshot
Probabilistic automata
inferredcites →https://doi.org/10.1109/sfcs.1997.646094openalex-snapshot
On the power of quantum finite state automata
inferredcites →https://doi.org/10.1109/sfcs.1998.743469openalex-snapshot
1-way quantum finite automata: strengths, weaknesses and generalizations
inferredcites →https://doi.org/10.1109/sffcs.1999.814608openalex-snapshot
Optimal lower bounds for quantum automata and random access codes
inferredcites →https://doi.org/10.1137/1.9780898719789openalex-snapshot
Branching Programs and Binary Decision Diagrams
inferredcites →https://doi.org/10.1137/s0097539799353443openalex-snapshot
Characterizations of 1-Way Quantum Finite Automata
inferredcites →https://doi.org/10.1145/225058.225277openalex-snapshot
On randomized one-round communication complexity
inferredcites →https://doi.org/10.1145/242224.242503openalex-snapshot
Theory of computing
inferredcites →https://doi.org/10.1145/276698.276708openalex-snapshot
Quantum circuits with mixed states
inferredcites →https://doi.org/10.1145/335305.335396openalex-snapshot
On quantum and probabilistic communication
inferredcites →https://doi.org/10.1145/335305.335403openalex-snapshot
Computing with highly mixed states (extended abstract)
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0003136openalex-snapshot
Computing with highly mixed states

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-319-09704-6_6openalex-snapshot
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_20openalex-snapshot
Unary Probabilistic and Quantum Automata on Promise Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_13openalex-snapshot
Nondeterministic Unitary OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_16openalex-snapshot
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_14openalex-snapshot
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
inferred← citeshttps://doi.org/10.1007/978-3-319-94631-3_15openalex-snapshot
Error-Free Affine, Unitary, and Probabilistic OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_9openalex-snapshot
Classical and Quantum Computations with Restricted Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-87442-3_1openalex-snapshot
Some Observations on Two-Way Finite Automata with Quantum and Classical States
inferred← citeshttps://doi.org/10.1007/s11047-022-09904-3openalex-snapshot
Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies
inferred← citeshttps://doi.org/10.1007/s11128-017-1799-0openalex-snapshot
Unary probabilistic and quantum automata on promise problems
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.1134/s106373972560219xopenalex-snapshot
Shallow Circuit Implementation for the Phase Form of Quantum Hashing and Local-Sensitive Hashing on IBMQ Noisy Emulators
inferred← citeshttps://doi.org/10.1134/s199508021606007xopenalex-snapshot
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
inferred← citeshttps://doi.org/10.1134/s199508022302021xopenalex-snapshot
Deterministic Construction of QFAs Based on the Quantum Fingerprinting Technique
inferred← citeshttps://doi.org/10.2478/qic-2025-0028openalex-snapshot
Implementation of Quantum Fourier Transform and Quantum Hashing for Quantum Devices with Arbitrary Qubit Connectivity Graphs
inferred← citeshttps://doi.org/10.26421/qic24.3-4-4openalex-snapshot
Quantum algorithms for SCS and text assembling problems
inferred← citeshttps://doi.org/10.26907/0021-3446-2025-1-3-14openalex-snapshot
On the complexity of computing the “Shuffled Inequality” function in classical and quantum NOBDDs
inferred← citeshttps://doi.org/10.26907/2541-7746.2024.4.470-484openalex-snapshot
Quantum and classical nondeterministic OBDDs
inferred← citeshttps://doi.org/10.3103/s1066369x2570001xopenalex-snapshot
On the Complexity of Computing the Shuffled Inequality Function in Classical and Quantum NOBDDs
inferred← citeshttps://doi.org/10.3390/math10010143openalex-snapshot
Quantum and Classical Log-Bounded Automata for the Online Disjointness Problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0604085openalex-snapshot
A Polynomial-Time Algorithm for the Equivalence between Quantum Sequential Machines
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.