Jevgēnijs Vihrovs
Jevgēnijs Vihrovs
Verifierad e-postadress på lu.lv - Startsida
Titel
Citeras av
Citeras av
År
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
352019
Sensitivity versus certificate complexity of boolean functions
A Ambainis, K Prūsis, J Vihrovs
International Computer Science Symposium in Russia, 16-28, 2016
302016
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
14*2016
Stationary states in quantum walk search
K Prūsis, J Vihrovs, TG Wong
Physical Review A 94 (3), 032334, 2016
122016
Size of sets with small sensitivity: A generalization of simon’s lemma
A Ambainis, J Vihrovs
International Conference on Theory and Applications of Models of Computation …, 2015
122015
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
112016
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
102014
Zero-error affine, unitary, and probabilistic obdds
R Ibrahimov, K Khadiev, K Prusis, J Vihrovs, A Yakaryilmaz
arXiv preprint arXiv:1703.07184, 2017
82017
Exact affine counter automata
M Nakanishi, K Khadiev, K Prūsis, J Vihrovs, A Yakaryılmaz
arXiv preprint arXiv:1703.04281, 2017
62017
All classical adversary methods are equivalent for total functions
A Ambainis, M Kokainis, K Prūsis, J Vihrovs, A Zajakins
ACM Transactions on Computation Theory (TOCT) 13 (1), 1-20, 2021
52021
Quantum lower and upper bounds for 2d-grid and dyck language
A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ...
arXiv preprint arXiv:2007.03402, 2020
52020
On the inner product predicate and a generalization of matching vector families
B Bauer, J Vihrovs, H Wee
arXiv preprint arXiv:1810.02396, 2018
32018
On block sensitivity and fractional block sensitivity
A Ambainis, K Prūsis, J Vihrovs
Lobachevskii Journal of Mathematics 39 (7), 967-969, 2018
22018
Quadratically Tight Relations for Randomized Query Complexity
R Jain, H Klauck, S Kundu, T Lee, M Santha, S Sanyal, J Vihrovs
Theory of Computing Systems 64 (1), 101-119, 2020
1*2020
Quadratically tight relations for randomized query complexity
R Jain, H Klauck, S Kundu, T Lee, M Santha, S Sanyal, J Vihrovs
International Computer Science Symposium in Russia, 207-219, 2018
12018
Quantum speedups for dynamic programming on -dimensional lattice graphs
A Glos, R Mori, J Vihrovs
arXiv preprint arXiv:2104.14384, 2021
2021
Limitations of Quantum Walks and Randomized Algorithms
J Vihrovs
Latvijas Universitāte, 2019
2019
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–17