Boolean Functions with a Low Polynomial Degree. - Raitis Ozols (IFIP Student Forum, 2004)

Size of Nondeterministic and Deterministic Automata for Certain Languages. - Raitis Ozols; Rusins Freivalds; Laura Mancinska; Maris Ozols (FCS, 2005)

Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. - Raitis Ozols; Rusins Freivalds; Jevgenijs Ivanovs; Elina Kalnina; Lelde Lace; Masahiro Miyakawa; Hisayuki Tatsumi; Daina Taimina (SOFSEM, 2005)

Quantum strategies are better than classical in almost any XOR game - Andris Ambainis; Arturs Backurs; Kaspars Balodis; Dmitry Kravchenko; Raitis Ozols; Juris Smotrovs; Madars Virza (CoRR, 2011)

Quantum Strategies Are Better Than Classical in Almost Any XOR Game. - Andris Ambainis; Arturs Backurs; Kaspars Balodis; Dmitrijs Kravcenko; Raitis Ozols; Juris Smotrovs; Madars Virza (ICALP (1), 2012)

Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification. - Andris Ambainis; Arturs Backurs; Nikolajs Nahimovs; Raitis Ozols; Alexander Rivosh (TQC, 2012)

Parameterized Quantum Query Complexity of Graph Collision - Andris Ambainis; Kaspars Balodis; Janis Iraids; Raitis Ozols; Juris Smotrovs (CoRR, 2013)