The Complexity of Probabilistic versus Quantum Finite Automata. - Gatis Midrijanis (SOFSEM, 2002)

A Polynomial Quantum Query Lower Bound for the Set Equality Problem. - Gatis Midrijanis (ICALP, 2004)

Three lines proof of the lower bound for the matrix rigidity - Gatis Midrijanis (CoRR, 2005)

On parallel composition of zero-knowledge proofs with black-box quantum simulators. - Rahul Jain 001; Alexandra Kolla; Gatis Midrijanis; Ben W. Reichardt (Quantum Inf. Comput., 2009)