Krisjanis Prusis

According to our database, Krisjanis Prusis authored at least 16 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Boolean Functions with Minimal Spectral Sensitivity.

Krisjanis Prusis, Jevgenijs Vihrovs

CoRR, 2024

2023

Quantum bounds for 2D-grid and Dyck language.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs

Quantum Inf. Process., May, 2023

2022

Dataset for "Strong dispersion property for the quantum walk on the hypercube".

Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Vyacheslavs Kashcheyevs, Andris Ambainis

Dataset, January, 2022

Exact Affine Counter Automata.

Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2022

Quantum Speedups for Treewidth.

Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs

Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021

All Classical Adversary Methods Are Equivalent for Total Functions.

Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins

ACM Trans. Comput. Theory, 2021

2020

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Quantum Lower Bounds for 2D-Grid and Dyck Language.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Krisjanis Prusis, Juris Smotrovs

CoRR, 2019

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

On Block Sensitivity and Fractional Block Sensitivity.

Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs

CoRR, 2018

All Classical Adversary Methods are Equivalent for Total Functions.

Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Error-Free Affine, Unitary, and Probabilistic OBDDs.

Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2016

Sensitivity Versus Certificate Complexity of Boolean Functions.

Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs

Proceedings of the Computer Science - Theory and Applications, 2016

2014

A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization.

Jevgenijs Vihrovs, Krisjanis Prusis, Karlis Freivalds, Peteris Rucevskis, Valdis Krebs

Proceedings of the Computer Vision, Imaging and Computer Graphics - Theory and Applications, 2014

A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity.

Andris Ambainis, Krisjanis Prusis

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

An Inverse Distance-based Potential Field Function for Overlapping Point Set Visualization.

Jevgenijs Vihrovs, Krisjanis Prusis, Karlis Freivalds, Peteris Rucevskis, Valdis Krebs

Proceedings of the 5th International Conference on Information Visualization Theory and Applications, 2014