Krisjanis Prusis

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 17

Top Topics

Prime Implicants

High Sensitivity

Bounded Treewidth

Top Venues

Int. J. Found. Comput. Sci.

Electron. Colloquium Comput. Complex.

Publications

Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs
Quantum bounds for 2D-grid and Dyck language. Quantum Inf. Process. 22 (5) (2023)
Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum speedups for treewidth. CoRR (2022)
Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Treewidth. TQC (2022)
Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs, Abuzer Yakaryilmaz
Exact Affine Counter Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz
Error-Free Affine, Unitary, and Probabilistic OBDDs. Int. J. Found. Comput. Sci. 32 (7) (2021)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins
All Classical Adversary Methods Are Equivalent for Total Functions. ACM Trans. Comput. Theory 13 (1) (2021)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. CoRR (2020)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. MFCS (2020)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA (2019)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Krisjanis Prusis, Juris Smotrovs
Quantum Lower Bounds for 2D-Grid and Dyck Language. CoRR (2019)
Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs
On Block Sensitivity and Fractional Block Sensitivity. CoRR (2018)
Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz
Error-Free Affine, Unitary, and Probabilistic OBDDs. DCFS (2018)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR (2018)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
All Classical Adversary Methods are Equivalent for Total Functions. STACS (2018)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
All Classical Adversary Methods are Equivalent for Total Functions. CoRR (2017)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
All Classical Adversary Methods are Equivalent for Total Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs
Sensitivity Versus Certificate Complexity of Boolean Functions. CSR (2016)
Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs
Sensitivity versus Certificate Complexity of Boolean Functions. CoRR (2015)
Andris Ambainis, Krisjanis Prusis
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. MFCS (2) (2014)
Jevgenijs Vihrovs, Krisjanis Prusis, Karlis Freivalds, Peteris Rucevskis, Valdis Krebs
An Inverse Distance-based Potential Field Function for Overlapping Point Set Visualization. IVAPP (2014)
Andris Ambainis, Krisjanis Prusis
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. Electron. Colloquium Comput. Complex. 21 (2014)
Krisjanis Prusis, Andris Ambainis
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. CoRR (2014)
Jevgenijs Vihrovs, Krisjanis Prusis, Karlis Freivalds, Peteris Rucevskis, Valdis Krebs
A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization. VISIGRAPP (Selected Papers) (2014)