Unions of Identifiable Classes of Total Recursive Functions. - Kalvis Apsitis; Rusins Freivalds; Martins Krikis; Raimonds Simanovskis; Juris Smotrovs (AII, 1992)

Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference. - Andris Ambainis; Juris Smotrovs (AII/ALT, 1994)

Unions of identifiable families of languages. - Kalvis Apsitis; Rusins Freivalds; Raimonds Simanovskis; Juris Smotrovs (ICGI, 1996)

Effects of Kolmogorov Complexity Present in Inductive Inference as Well. - Andris Ambainis; Kalvis Apsitis; Cristian Calude; Rusins Freivalds; Marek Karpinski; Tomas Larfeldt; Iveta Sala; Juris Smotrovs (ALT, 1997)

Closedness Properties in Team Learning of Recursive Functions. - Juris Smotrovs (EuroCOLT, 1997)

Closedness Properties in EX-Identification of Recursive Functions. - Kalvis Apsitis; Rusins Freivalds; Raimonds Simanovskis; Juris Smotrovs (ALT, 1998)

Closedness properties in ex-identification. - Kalvis Apsitis; Rusins Freivalds; Raimonds Simanovskis; Juris Smotrovs (Theor. Comput. Sci., 2001)

Multi-letter Reversible and Quantum Finite Automata. - Aleksandrs Belovs; Ansis Rosmanis; Juris Smotrovs (Developments in Language Theory, 2007)

A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases. - Aleksandrs Belovs; Juris Smotrovs (MMICS, 2008)

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)

Worst Case Analysis of Non-local Games. - Andris Ambainis; Arturs Backurs; Kaspars Balodis; Agnis Skuskovniks; Juris Smotrovs; Madars Virza (SOFSEM, 2013)

Optimal quantum query bounds for almost all Boolean functions. - Andris Ambainis; Arturs Backurs; Juris Smotrovs; Ronald de Wolf (STACS, 2013)

Exact Quantum Query Complexity of EXACT and THRESHOLD. - Andris Ambainis; Janis Iraids; Juris Smotrovs (TQC, 2013)

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

Separations in Query Complexity Based on Pointer Functions. - Andris Ambainis; Kaspars Balodis; Aleksandrs Belovs; Troy Lee; Miklos Santha; Juris Smotrovs (Electron. Colloquium Comput. Complex., 2015)

Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. - Scott Aaronson; Andris Ambainis; Janis Iraids; Martins Kokainis; Juris Smotrovs (CCC, 2016)

Quantum Lower Bounds for 2D-Grid and Dyck Language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Krisjanis Prusis; Juris Smotrovs (CoRR, 2019)

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Kamil Khadiev; Vladislavs Klevickis; Krisjanis Prusis; Yixin Shen 001; Juris Smotrovs; Jevgenijs Vihrovs (MFCS, 2020)

Representing polynomial of CONNECTIVITY. - Janis Iraids; Juris Smotrovs (CoRR, 2021)

Representing polynomial of ST-CONNECTIVITY. - Janis Iraids; Juris Smotrovs (Discret. Math. Theor. Comput. Sci., 2023)

Quantum bounds for 2D-grid and Dyck language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Kamil Khadiev; Vladislavs Klevickis; Krisjanis Prusis; Yixin Shen 001; Juris Smotrovs; Jevgenijs Vihrovs (Quantum Inf. Process., 2023)