Krisjanis Prusis

Most-cited papers

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
A. Ambainis, K. Balodis, Janis Iraids, M. Kokainis +2 more
2018ACM-SIAM Symposium on Discrete Algorithms110 citations
Semantic Scholar
Sensitivity Versus Certificate Complexity of Boolean Functions
A. Ambainis, Krisjanis Prusis, J. Vihrovs
2015Computer Science Symposium in Russia25 citations
Semantic Scholar
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
A. Ambainis, K. Balodis, Janis Iraids, K. Khadiev +5 more
2020International Symposium on Mathematical Foundations of Computer Science22 citations
Semantic Scholar
Error-Free Affine, Unitary, and Probabilistic OBDDs
R. Ibrahimov, K. Khadiev, Krisjanis Prusis, A. Yakaryılmaz
2018Workshop on Descriptional Complexity of Formal Systems19 citations Open access
Semantic Scholar
An inverse distance-based potential field function for overlapping point set visualization
J. Vihrovs, Krisjanis Prusis, Kārlis Freivalds, Peteris Rucevskis +1 more
2014International Conference on Information Visualization Theory and Applications13 citations Open access
Semantic Scholar
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
A. Ambainis, Krisjanis Prusis
2014International Symposium on Mathematical Foundations of Computer Science12 citations Open access
Semantic Scholar
Doubling the success of quantum walk search using internal-state measurements
Krisjanis Prusis, J. Vihrovs, Thomas G. Wong
201511 citations Open access
Semantic Scholar
All Classical Adversary Methods Are Equivalent for Total Functions
A. Ambainis, M. Kokainis, Krisjanis Prusis, J. Vihrovs +1 more
2017Symposium on Theoretical Aspects of Computer Science8 citations Open access
Semantic Scholar
Zero-Error Affine, Unitary, and Probabilistic OBDDs
R. Ibrahimov, K. Khadiev, Krisjanis Prusis, J. Vihrovs +1 more
20177 citations
Semantic Scholar
Quantum speedups for treewidth
Vladislavs Klevickis, Krisjanis Prusis, J. Vihrovs
2022Theory of Quantum Computation, Communication, and Cryptography5 citations
Semantic Scholar
Quantum bounds for 2D-grid and Dyck language
A. Ambainis, K. Balodis, Janis Iraids, K. Khadiev +5 more
2023Quantum Information Processing4 citations
Semantic Scholar
Exact Affine Counter Automata
Masaki Nakanishi, K. Khadiev, Krisjanis Prusis, J. Vihrovs +1 more
2017International Journal of Foundations of Computer Science4 citations Open access
Semantic Scholar
On Block Sensitivity and Fractional Block Sensitivity
A. Ambainis, Krisjanis Prusis, J. Vihrovs
2018Lobachevskii Journal of Mathematics3 citations Open access
Semantic Scholar
A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization
J. Vihrovs, Krisjanis Prusis, Kārlis Freivalds, Peteris Rucevskis +1 more
2014VISIGRAPP2 citations Open access
Semantic Scholar
Oscillatory Localization of Quantum Walks by Classical Electric Circuits
A. Ambainis, Krisjanis Prusis, J. Vihrovs, Thomas G. Wong
20161 citations
Semantic Scholar
Certification complexity of Boolean functions
Chandrima Kayal, Sophie Laplante, É. Larroque, Krisjanis Prusis +1 more
20260 citations
Semantic Scholar
Boolean Functions with Minimal Spectral Sensitivity
Krisjanis Prusis, J. Vihrovs
2024arXiv.org0 citations
Semantic Scholar