Juris Smotrovs

Department of Computer Science, University of Latvia, Rīga, Latvia

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers19 papers

Sort

By YearBy Citation

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

Andris Ambainis,Kaspars Balodis,Jānis Iraids,Kamil Khadiev, Vladislavs Kļevickis,Krišjānis Prūsis, Yixin Shen,Juris Smotrovs,Jevgēnijs Vihrovs

MFCS, pp.14, (2020)

EIBibtex

Quantum Lower Bounds for 2D-Grid and Dyck Language

Ambainis Andris,Balodis Kaspars,Iraids Jānis,Prūsis Krišjānis,Smotrovs Juris

Bibtex

Separations in Query Complexity Based on Pointer Functions

Andris Ambainis,Kaspars Balodis,Aleksandrs Belovs,Troy Lee,Miklos Santha,Juris Smotrovs

J. ACM, no. 5 (2017): 32:1-32:24

Cited by54EIBibtex

Separations in Query Complexity Based on Pointer Functions

Andris Ambainis,Kaspars Balodis,Aleksandrs Belovs,Troy Lee,Miklos Santha,Juris Smotrovs

Journal of the ACM, no. 5 (2017): 1-24

Cited by54EIBibtex

Polynomials, Quantum Query Complexity, and Grothendieck's Inequality

Scott Aaronson,Andris Ambainis,Jānis Iraids, Mārtiņs Kokainis,Juris Smotrovs

Conference on Computational Complexity, (2016): 19

Cited by12EIBibtex

Optimal quantum query bounds for almost all Boolean functions

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

STACS, pp.446-453, (2013)

Cited by7EIBibtex

Worst Case Analysis of Non-local Games

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

SOFSEM, pp.121-132, (2013)

Cited by1EIBibtex

Parameterized Quantum Query Complexity of Graph Collision

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

CoRR, (2013)

Cited by5EIBibtex

Exact quantum query complexity of EXACT and THRESHOLD

Andris Ambainis,Janis Iraids,Juris Smotrovs

conference on theory of quantum computation communication and cryptography, (2013): 263-269

Cited by13EIBibtex

Quantum strategies are better than classical in almost any XOR game

Andris Ambainis,Artūrs Bačkurs,Kaspars Balodis,Dmitrijs Kravčenko,Raitis Ozols,Juris Smotrovs,Madars Virza

international colloquium on automata languages and programming, (2012): 25-37

Cited by10EIBibtex

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

Aleksandrs Belovs,Juris Smotrovs

MMICS, pp.50-69, (2008)

Cited by9EIBibtex

Multi-letter reversible and quantum finite automata

Aleksandrs Belovs,Ansis Rosmanis,Juris Smotrovs

Developments in Language Theory, pp.60-71, (2007)

Cited by25EIBibtex

Closedness properties in ex-identification

Kalvis Apsītis,Rīsiņš Freivalds,Raimonds Simanovskis,Juris Smotrovs

Theor. Comput. Sci., no. 2 (2001): 367-393

Cited by5EIBibtex

Closedness Properties in EX-Identification of Recursive Functions

Kalvis Apsitis,Rusins Freivalds,Raimonds Simanovskis,Juris Smotrovs

ALT, (1998): 46-60

Cited by1EIBibtex

Closedness Properties in Team Learning of Recursive Functions

Juris Smotrovs

EuroCOLT, pp.79-93, (1997)

Cited by2EIBibtex

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): 244-259

Cited by7EIBibtex

Unions of identifiable families of languages

Kalvis Apsitis,Rusins Freivalds,Raimonds Simanovskis,Juris Smotrovs

ICGI, pp.48-58, (1996)

Cited by5EIBibtex

Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference

Andris Ambainis,Juris Smotrovs

AII/ALT, pp.10-25, (1994)

Cited by4EIBibtex

Unions of Identifiable Classes of Total Recursive Functions

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

AII, (1992): 99-107

Cited by15EIBibtex

View All

Base Info Papers Patents Projects