Krišjānis Prūsis
Krišjānis Prūsis
Verifierad e-postadress på lu.lv
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
Error-free affine, unitary, and probabilistic OBDDs
R Ibrahimov, K Khadiev, K Prūsis, A Yakaryılmaz
International Journal of Foundations of Computer Science, 1-21, 2021
142021
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
122016
Stationary states in quantum walk search
K Prūsis, J Vihrovs, TG Wong
Physical Review A 94 (3), 032334, 2016
122016
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
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
112014
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
92014
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 block sensitivity and fractional block sensitivity
A Ambainis, K Prūsis, J Vihrovs
Lobachevskii Journal of Mathematics 39 (7), 967-969, 2018
22018
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
12014
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
Quantum lower and upper bounds for 2D-grid and dyck language
J Smotrovs, J Iraids, A Ambainis, Y Shen, V Kļevickis, K Khadiev, ...
Exact affine counter automata
K Prusis, K Khadiev, A Yakaryilmaz, J Vihrovs, M Nakanishi
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–17