Classical and Quantum Computations with Restricted Memory
From MaRDI portal
Recommendations
Cites work
- Analysis of the two-particle controlled interacting quantum walks
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Branching Programs and Binary Decision Diagrams
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Competitive analysis of maintaining frequent items of a stream
- Data streams: algorithms and applications.
- Design and analysis of randomized algorithms. Introduction to design paradigms.
- Developments in Language Theory
- Discrete-time interacting quantum walks and quantum hash schemes
- Extension of the hierarchy for k-OBDDs of small width
- Hierarchy theorems for kOBDDs and kIBDDs
- scientific article; zbMATH DE number 1696662 (Why is no real title available?)
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- scientific article; zbMATH DE number 1775455 (Why is no real title available?)
- scientific article; zbMATH DE number 1839432 (Why is no real title available?)
- scientific article; zbMATH DE number 2102760 (Why is no real title available?)
- Interaction in Quantum Communication
- Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
- Lower Bounds for Las Vegas Automata by Information Theory
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
- On lower bounds for read-\(k\)-times branching programs
- On quantum and probabilistic communication: Las Vegas and one-way protocols
- On the computational power of probabilistic and quantum branching program
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Random Cayley graphs and expanders
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
- Small-Bias Sets for Nonabelian Groups
- Succinctness of two-way probabilistic and quantum finite automata
- Superiority of exact quantum automata for promise problems
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- The power of nondeterminism and randomness for oblivious branching programs
- Two-way finite automata with quantum and classical states.
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- Width hierarchy for \(k\)-OBDD of small width
Cited in
(12)- The fast algorithm for online \(k\)-server problem on trees
- Two-way and one-way quantum and classical automata with advice for online minimization problems
- Quantum online streaming algorithms with logarithmic memory
- Quantum and classical simulation of quantum branching programs
- scientific article; zbMATH DE number 4179292 (Why is no real title available?)
- scientific article; zbMATH DE number 2086395 (Why is no real title available?)
- scientific article; zbMATH DE number 2095528 (Why is no real title available?)
- Quantum versus classical online streaming algorithms with logarithmic size of memory
- Deterministic construction of QFAs based on the quantum fingerprinting technique
- Time efficient implementation for online k-server problem on trees
- Quantum online algorithms with respect to space and advice complexity
- Efficient algorithms for quantum hashing
This page was built for publication: Classical and Quantum Computations with Restricted Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163622)
