Author image not provided
 Juris Smotrovs

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.23
Citation Count16
Publication count13
Publication years1992-2017
Available for download2
Average downloads per article108.50
Downloads (cumulative)217
Downloads (12 Months)150
Downloads (6 Weeks)15
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


13 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 13 of 13
Sort by:

1 published by ACM
September 2017 Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 102,   Downloads (Overall): 102

Full text available: PDFPDF
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total Boolean function is given by the function f on n = 2 k bits defined by a complete binary tree of NAND gates of depth k , which achieves R ...
Keywords: query complexity, Decision trees, quantum algorithms

2 published by ACM
June 2016 STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 3,   Downloads (12 Months): 48,   Downloads (Overall): 115

Full text available: PDFPDF
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function f on n =2 k bits defined by a complete binary tree of NAND gates of depth k , which achieves R 0 ...
Keywords: Monte Carlo, Randomized algorithms, Deterministic algorithms, Las Vegas, Quantum algorithms

3
May 2016 CCC '16: Proceedings of the 31st Conference on Computational Complexity
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Bibliometrics:
Citation Count: 0

We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function f is computable by a 1-query quantum algorithm with error bounded by ε < 1/2 iff f can be approximated by a degree-2 polynomial with error bounded by ε' < 1/2. This ...
Keywords: Grothendieck's inequality, quantum algorithms, boolean functions, approximation by polynomials

4
July 2012 ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n , the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... ...

5
December 2008 Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch bounds with equality is given and applied for the ...

6
July 2007 DLT'07: Proceedings of the 11th international conference on Developments in language theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

The regular language ( a + b )* a (the words in alphabet { a, b } having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many ...

7
October 2001 Theoretical Computer Science - Algorithmic learning theory: Volume 268 Issue 2, 17 October 2001
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 2

In this paper we investigate in which cases unions of identifiable classes are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we and n ...

8
October 1998 ALT '98: Proceedings of the 9th International Conference on Algorithmic Learning Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them ...

9
October 1997 ALT '97: Proceedings of the 8th International Conference on Algorithmic Learning Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1


10
March 1997 EuroCOLT '97: Proceedings of the Third European Conference on Computational Learning Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2


11
September 1996 ICG! '96: Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1


12
October 1994 AII '94: Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


13
October 1992 AII '92: Proceedings of the International Workshop on Analogical and Inductive Inference
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us