Juris Smotrovs

According to our database, Juris Smotrovs authored at least 21 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Quantum bounds for 2D-grid and Dyck language.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs

Quantum Inf. Process., May, 2023

2021

Representing polynomial of CONNECTIVITY.

Janis Iraids, Juris Smotrovs

CoRR, 2021

2020

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, Juris Smotrovs, Jevgenijs Vihrovs

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Quantum Lower Bounds for 2D-Grid and Dyck Language.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Krisjanis Prusis, Juris Smotrovs

CoRR, 2019

2016

Polynomials, Quantum Query Complexity, and Grothendieck's Inequality.

Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

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

2013

Parameterized Quantum Query Complexity of Graph Collision

Andris Ambainis, Kaspars Balodis, Janis Iraids, Raitis Ozols, Juris Smotrovs

CoRR, 2013

Exact Quantum Query Complexity of EXACT and THRESHOLD.

Andris Ambainis, Janis Iraids, Juris Smotrovs

Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

Optimal quantum query bounds for almost all Boolean functions.

Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Worst Case Analysis of Non-local Games.

Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012

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

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

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

2008

A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases.

Aleksandrs Belovs, Juris Smotrovs

Proceedings of the Mathematical Methods in Computer Science, 2008

2007

Multi-letter Reversible and Quantum Finite Automata.

Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2001

Closedness properties in ex-identification.

Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs

Theor. Comput. Sci., 2001

1998

Closedness Properties in EX-Identification of Recursive Functions.

Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Closedness Properties in Team Learning of Recursive Functions.

Juris Smotrovs

Proceedings of the Computational Learning Theory, Third European Conference, 1997

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

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

Unions of identifiable families of languages.

Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs

Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

1994

Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference.

Andris Ambainis, Juris Smotrovs

Proceedings of the Algorithmic Learning Theory, 1994

1992

Unions of Identifiable Classes of Total Recursive Functions.

Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs

Proceedings of the Analogical and Inductive Inference, 1992