Author image not provided
 Kaspars Balodis

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.60
Citation Count3
Publication count5
Publication years2011-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




BOOKMARK & SHARE


5 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 5 of 5
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
August 2013 FCT'13: Proceedings of the 19th international conference on Fundamentals of Computation Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We show a family of languages that can be recognized by a family of linear-size alternating one-way finite automata with one alternation but cannot be recognized by any family of polynomial-size bounded-error two-way probabilistic finite automata with the expected runtime bounded by a polynomial. In terms of finite automata complexity ...

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
October 2011 MEMICS'11: Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F(<f(0), f(1),⋯,f(n)>) is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation ...



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