Shape Recognition by a Finite Automaton Robot. - Robert Gmyr; Kristian Hinnenthal; Irina Kostitsyna; Fabian Kuhn; Dorian Rudolph; Christian Scheideler (MFCS, 2018)

Forming tile shapes with simple robots. - Robert Gmyr; Kristian Hinnenthal; Irina Kostitsyna; Fabian Kuhn; Dorian Rudolph; Christian Scheideler; Thim Strothmann (Nat. Comput., 2020)

On polynomially many queries to NP or QMA oracles. - Sevag Gharibian; Dorian Rudolph (Electron. Colloquium Comput. Complex., 2021)

Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement. - Sevag Gharibian; Dorian Rudolph (ITCS, 2023)

Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds. - Avantika Agarwal; Sevag Gharibian; Venkata Koppula; Dorian Rudolph (MFCS, 2024)

Quantum 2-SAT on low dimensional systems is QMA1-complete: Direct embeddings and black-box simulation. - Dorian Rudolph; Sevag Gharibian; Daniel Nagaj (CoRR, 2024)

Towards a universal gateset for QMA1. - Dorian Rudolph (CoRR, 2024)

On the Complexity of Pure-State Consistency of Local Density Matrices. - Jonas Kamminga; Dorian Rudolph (CoRR, 2024)

Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box Simulation. - Dorian Rudolph; Sevag Gharibian; Daniel Nagaj (ITCS, 2025)

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem. - Marco Aldi; Sevag Gharibian; Dorian Rudolph (Electron. Colloquium Comput. Complex., 2025)

Quantum k-SAT Related Hypergraph Problems. - Simon-Luca Kremer; Dorian Rudolph; Sevag Gharibian (CoRR, 2025)