Jevgenijs Vihrovs

Orcid: 0000-0002-3143-2610

According to our database1, Jevgenijs Vihrovs authored at least 20 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum Algorithms for Hopcroft's Problem.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Quantum bounds for 2D-grid and Dyck language.
Quantum Inf. Process., May, 2023

Improved Algorithm and Lower Bound for Variable Time Quantum Search.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

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

Exact Affine Counter Automata.
Int. J. Found. Comput. Sci., 2022

Quantum Speedups for Treewidth.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021
All Classical Adversary Methods Are Equivalent for Total Functions.
ACM Trans. Comput. Theory, 2021

Quantum speedups for dynamic programming on n-dimensional lattice graphs.
CoRR, 2021

Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Quadratically Tight Relations for Randomized Query Complexity.
Theory Comput. Syst., 2020

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
On the Inner Product Predicate and a Generalization of Matching Vector Families.
IACR Cryptol. ePrint Arch., 2018

On Block Sensitivity and Fractional Block Sensitivity.
CoRR, 2018

2017
Quadratically Tight Relations for Randomized Query Complexity.
Electron. Colloquium Comput. Complex., 2017

All Classical Adversary Methods are Equivalent for Total Functions.
Electron. Colloquium Comput. Complex., 2017

2016
Sensitivity Versus Certificate Complexity of Boolean Functions.
Proceedings of the Computer Science - Theory and Applications, 2016

2014
Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma.
Electron. Colloquium Comput. Complex., 2014

A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization.
Proceedings of the Computer Vision, Imaging and Computer Graphics - Theory and Applications, 2014

An Inverse Distance-based Potential Field Function for Overlapping Point Set Visualization.
Proceedings of the 5th International Conference on Information Visualization Theory and Applications, 2014


  Loading...