Jevgenijs Vihrovs

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 26

Top Topics

Bounded Treewidth

Prime Implicants

Query Complexity

Dynamic Programming

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Vladimirs Andrejevs, Aleksandrs Belovs, Jevgenijs Vihrovs
Quantum algorithms for Hopcroft's problem. CoRR (2024)
Vladimirs Andrejevs, Aleksandrs Belovs, Jevgenijs Vihrovs
Quantum Algorithms for Hopcroft's Problem. MFCS (2024)
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)
Andris Ambainis, Martins Kokainis, Jevgenijs Vihrovs
Improved Algorithm and Lower Bound for Variable Time Quantum Search. TQC (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)
Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. MFCS (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)
Adam Glos, Ryuhei Mori, Jevgenijs Vihrovs
Quantum speedups for dynamic programming on n-dimensional lattice graphs. CoRR (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)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64 (1) (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, Krisjanis Prusis, Jevgenijs Vihrovs
On Block Sensitivity and Fractional Block Sensitivity. CoRR (2018)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CSR (2018)
Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee
On the Inner Product Predicate and a Generalization of Matching Vector Families. IACR Cryptol. ePrint Arch. 2018 (2018)
Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee
On the Inner Product Predicate and a Generalization of Matching Vector Families. CoRR (2018)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR (2018)
Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee
On the Inner Product Predicate and a Generalization of Matching Vector Families. FSTTCS (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)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. 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, Jevgenijs Vihrovs
Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma. TAMC (2015)
Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs
Sensitivity versus Certificate Complexity of Boolean Functions. CoRR (2015)
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, Jevgenijs Vihrovs
Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma. CoRR (2014)
Andris Ambainis, Jevgenijs Vihrovs
Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma. Electron. Colloquium Comput. Complex. 21 (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)