Krisjanis Prusis

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