Zachary Remscrim

According to our database1, Zachary Remscrim authored at least 9 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Eliminating Intermediate Measurements in Space-Bounded Quantum Computation.
Electron. Colloquium Comput. Complex., 2020

Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines.
CoRR, 2020

The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
The Limitations of Few Qubits: One-way and Two-way Quantum Finite Automata and the Group Word Problem.
Electron. Colloquium Comput. Complex., 2019

The Power of a Single Qubit: Two-way Quantum/Classical Finite Automata and the Word Problem for Linear Groups.
Electron. Colloquium Comput. Complex., 2019

2016
Algebraic methods in pseudorandomness and circuit complexity.
PhD thesis, 2016

The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling.
Electron. Colloquium Comput. Complex., 2016

2015
Smart Metering of Variable Power Loads.
IEEE Trans. Smart Grid, 2015

2013
AC<sup>0</sup> Pseudorandomness of Natural Operations.
Electron. Colloquium Comput. Complex., 2013


  Loading...