Juris Smotrovs

Most-cited papers

Separations in query complexity based on pointer functions
A. Ambainis, K. Balodis, Aleksandrs Belovs, Troy Lee +2 more
2015Symposium on the Theory of Computing74 citations Open access
Semantic Scholar
Exact quantum query complexity of EXACT and THRESHOLD
A. Ambainis, Janis Iraids, Juris Smotrovs
2013Theory of Quantum Computation, Communication, and Cryptography31 citations
Semantic Scholar
Separations in Query Complexity Based on Pointer Functions
A. Ambainis, K. Balodis, Aleksandrs Belovs, Troy Lee +2 more
2017Journal of the ACM29 citations Open access
Semantic Scholar
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality
S. Aaronson, A. Ambainis, Janis Iraids, M. Kokainis +1 more
2015Cybersecurity and Cyberforensics Conference29 citations
Semantic Scholar
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
A. Ambainis, K. Balodis, Janis Iraids, K. Khadiev +5 more
2020International Symposium on Mathematical Foundations of Computer Science22 citations
Semantic Scholar
Multi-letter Reversible and Quantum Finite Automata
Aleksandrs Belovs, A. Rosmanis, Juris Smotrovs
2007International Conference on Developments in Language Theory17 citations
Semantic Scholar
Quantum Strategies Are Better Than Classical in Almost Any XOR Game
A. Ambainis, A. Backurs, K. Balodis, Dmitrijs Kravčenko +3 more
2011International Colloquium on Automata, Languages and Programming16 citations Open access
Semantic Scholar
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
Aleksandrs Belovs, Juris Smotrovs
2008Mathematical Methods in Computer Science13 citations Open access
Semantic Scholar
Unions of Identifiable Classes of Total Recursive Functions
K. Apsitis, R. Freivalds, Martins Krikis, Raimonds Simanovskis +1 more
1992Analogical and Inductive Inference10 citations
Semantic Scholar
UvA-DARE (Digital Academic Repository) Optimal quantum query bounds for almost all Boolean functions
A. Ambainis, A. Backurs, Juris Smotrovs, R. de Wolf
9 citations
Semantic Scholar
Parameterized Quantum Query Complexity of Graph Collision
A. Ambainis, K. Balodis, Janis Iraids, Raitis Ozols +1 more
2013arXiv.org8 citations
Semantic Scholar
Effects of Kolmogorov Complexity Present in Inductive Inference as Well
A. Ambainis, K. Apsitis, Cristian S. Calude, R. Freivalds +4 more
1997International Conference on Algorithmic Learning Theory7 citations
Semantic Scholar
Quantum bounds for 2D-grid and Dyck language
A. Ambainis, K. Balodis, Janis Iraids, K. Khadiev +5 more
2023Quantum Information Processing4 citations
Semantic Scholar
Closedness properties in ex-identification
K. Apsitis, R. Freivalds, Raimonds Simanovskis, Juris Smotrovs
2001Theoretical Computer Science3 citations Open access
Semantic Scholar
Closedness Properties in Team Learning of Recursive Functions
Juris Smotrovs
1997European Conference on Computational Learning Theory3 citations
Semantic Scholar
Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference
A. Ambainis, Juris Smotrovs
1994AII/ALT3 citations
Semantic Scholar
Quantum Lower Bounds for 2D-Grid and Dyck Language
A. Ambainis, K. Balodis, Janis Iraids, Krisjanis Prusis +1 more
2019arXiv.org2 citations
Semantic Scholar
Closedness Properties in EX-Identification of Recursive Functions
K. Apsitis, R. Freivalds, Raimonds Simanovskis, Juris Smotrovs
1998International Conference on Algorithmic Learning Theory2 citations
Semantic Scholar
Unions of identifiable families of languages
K. Apsitis, R. Freivalds, Raimonds Simanovskis, Juris Smotrovs
1996International Conference on Graphics and Interaction2 citations
Semantic Scholar
Worst Case Analysis of Non-local Games
A. Ambainis, A. Backurs, K. Balodis, Agnis Skuskovniks +2 more
2011Conference on Current Trends in Theory and Practice of Informatics1 citations
Semantic Scholar
Representing polynomial of CONNECTIVITY
Janis Iraids, Juris Smotrovs
2021arXiv.org0 citations
Semantic Scholar
Representing polynomial of ST-CONNECTIVITY
Janis Iraids, Juris Smotrovs
2021Discrete Mathematics & Theoretical Computer Science0 citations Open access
Semantic Scholar
Team Learning and Quasi-Closedness inInductive Inference ?
A. Ambainis, Juris Smotrovs
20000 citations
Semantic Scholar
Closedness properties in inductive inference
Juris Smotrovs
19990 citations
Semantic Scholar
s of Ident i f iable Families of Languages *
K. Apsitis, Fl'eivalds, Raimonds Simanovskis, Juris Smotrovs
0 citations
Semantic Scholar