| Sensitivity versus certificate complexity of boolean functions A Ambainis, K Prūsis, J Vihrovs International Computer Science Symposium in Russia, 16-28, 2016 | 25 | 2016 |
| Quantum speedups for exponential-time dynamic programming algorithms A Ambainis, K Balodis, J Iraids, M Kokainis, K Prūsis, J Vihrovs Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 12 | 2019 |
| Stationary states in quantum walk search K Prūsis, J Vihrovs, TG Wong Physical Review A 94 (3), 032334, 2016 | 10 | 2016 |
| A tight lower bound on certificate complexity in terms of block sensitivity and sensitivity A Ambainis, K Prūsis International Symposium on Mathematical Foundations of Computer Science, 33-44, 2014 | 10 | 2014 |
| Doubling the success of quantum walk search using internal-state measurements K Prūsis, J Vihrovs, TG Wong Journal of Physics A: Mathematical and Theoretical 49 (45), 455301, 2016 | 9 | 2016 |
| Zero-error affine, unitary, and probabilistic obdds R Ibrahimov, K Khadiev, K Prusis, J Vihrovs, A Yakaryilmaz arXiv preprint arXiv:1703.07184, 2017 | 8 | 2017 |
| Error-free affine, unitary, and probabilistic OBDDs R Ibrahimov, K Khadiev, K Prūsis, A Yakaryılmaz International Conference on Descriptional Complexity of Formal Systems, 175-187, 2018 | 7 | 2018 |
| Oscillatory localization of quantum walks analyzed by classical electric circuits A Ambainis, K Prūsis, J Vihrovs, TG Wong Physical Review A 94 (6), 062324, 2016 | 7 | 2016 |
| An inverse distance-based potential field function for overlapping point set visualization J Vihrovs, K Prūsis, K Freivalds, P Ručevskis, V Krebs 2014 International Conference on Information Visualization Theory and …, 2014 | 6 | 2014 |
| Exact affine counter automata M Nakanishi, K Khadiev, K Prūsis, J Vihrovs, A Yakaryılmaz arXiv preprint arXiv:1703.04281, 2017 | 3 | 2017 |
| On block sensitivity and fractional block sensitivity A Ambainis, K Prūsis, J Vihrovs Lobachevskii Journal of Mathematics 39 (7), 967-969, 2018 | 2 | 2018 |
| All Classical Adversary Methods are Equivalent for Total Functions A Ambainis, M Kokainis, K Prūsis, J Vihrovs, A Zajakins arXiv preprint arXiv:1709.08985, 2017 | 1 | 2017 |
| A potential field function for overlapping point set and graph cluster visualization J Vihrovs, K Prūsis, K Freivalds, P Ručevskis, V Krebs International Joint Conference on Computer Vision, Imaging and Computer …, 2014 | 1 | 2014 |
| Quantum Lower Bounds for 2D-Grid and Dyck Language A Ambainis, K Balodis, J Iraids, K Prūsis, J Smotrovs arXiv preprint arXiv:1911.12638, 2019 | | 2019 |
| A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity K Prusis, A Ambainis arXiv preprint arXiv:1402.5078, 2014 | | 2014 |
| Exact affine counter automata K Prusis, K Khadiev, A Yakaryilmaz, J Vihrovs, M Nakanishi | | |
Jevgēnijs VihrovsResearcher, University of LatviaVerified email at lu.lv
