AC0 Pseudorandomness of Natural Operations. - Zachary Remscrim; Michael Sipser (Electron. Colloquium Comput. Complex., 2013)

Smart Metering of Variable Power Loads. - Warit Wichakool; Zachary Remscrim; Uzoma A. Orji; Steven B. Leeb (IEEE Trans. Smart Grid, 2015)

The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling. - Zachary Remscrim (Electron. Colloquium Comput. Complex., 2016)

Algebraic methods in pseudorandomness and circuit complexity. - Zachary Remscrim (2016)

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

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

The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem. - Zachary Remscrim (ICALP, 2020)

Eliminating Intermediate Measurements in Space-Bounded Quantum Computation. - Bill Fefferman; Zachary Remscrim (Electron. Colloquium Comput. Complex., 2020)

Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines. - Zachary Remscrim (ITCS, 2021)