Jevgēnijs Vihrovs

Latvia University of Life Sciences and Technologies — LV

Computer Science · Physical Sciences

8h-index185citations42works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(28), Complexity and Algorithms in Graphs(16), Machine Learning and Algorithms(10), Computability, Logic, AI Algorithms(6), Quantum-Dot Cellular Automata(6)

Publications42 total

Quantum Algorithms for Hopcroft's problem
ACM Transactions on Quantum Computing·2026Open Access
Quantum Search on Computation Trees
Society for Industrial and Applied Mathematics eBooks·2026
Quantum Search on Computation Trees
arXiv (Cornell University)·2025Open Access
Boolean Functions with Minimal Spectral Sensitivity
arXiv (Cornell University)·2024Open Access
Quantum Algorithms for Hopcroft’s Problem
arXiv (Cornell University)·2024Open Access
Quantum bounds for 2D-grid and Dyck language
Quantum Information Processing·2023· 5 cited
Improved Algorithm and Lower Bound for Variable Time Quantum Search
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2023· 2 citedOpen Access
Improved Algorithm and Lower Bound for Variable Time Quantum Search
arXiv (Cornell University)·2023· 1 citedOpen Access
Strong dispersion property for the quantum walk on the hypercube
Journal of Physics A Mathematical and Theoretical·2022
Exact Affine Counter Automata
International Journal of Foundations of Computer Science·2022· 3 cited
Strong dispersion property for the quantum walk on the hypercube
arXiv (Cornell University)·2022Open Access
Dataset for "Strong dispersion property for the quantum walk on the hypercube"
Zenodo (CERN European Organization for Nuclear Research)·2022Open Access
Dataset for "Strong dispersion property for the quantum walk on the hypercube"
Zenodo (CERN European Organization for Nuclear Research)·2022· 1 citedOpen Access
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
Mathematics·2022· 14 citedOpen Access
Quantum Speedups for Treewidth
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 1 citedOpen Access
The numerical results for the complexity of the quantum algorithm for dynamic programming on n-dimensional lattice graph
Zenodo (CERN European Organization for Nuclear Research)·2021Open Access
The numerical results for the complexity of the quantum algorithm for dynamic programming on n-dimensional lattice graph
Figshare·2021Open Access
All Classical Adversary Methods Are Equivalent for Total Functions
ACM Transactions on Computation Theory·2021Open Access
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
arXiv (Cornell University)·2021· 3 citedOpen Access
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
page 1 of 3Next →

Frequent Co-authors

Krišjānis Prūsis(24), Andris Ambainis(19), Martins Kokainis(13), Kamil Khadiev(7), Kaspars Balodis(5), Jānis Iraids(5), Vladislavs Kļevickis(4), Adam Glos(4), Ryuhei Mori(4), Vyacheslavs Kashcheyevs(4), Thomas G. Wong(3), Yixin Shen(3), Juris Smotrovs(3), Abuzer Yakaryılmaz(3), Rahul Jain(3), Hartmut Klauck(3), Srijita Kundu(3), Troy Lee(3), Miklós Sántha(3), Swagato Sanyal(3)