Jevgēnijs Vihrovs

Available identifiers

Publication	Date of Publication	Type
Improved algorithm and lower bound for variable time quantum search	2024-11-20	Paper
Quantum speedups for treewidth	2024-06-27	Paper
Exact Affine Counter Automata	2023-08-15	Paper
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs	2023-08-08	Paper
Quantum bounds for 2D-grid and Dyck language	2023-06-01	Paper
Strong dispersion property for the quantum walk on the hypercube	2023-02-23	Paper
On the inner product predicate and a generalization of matching vector families	2022-07-21	Paper
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language	2022-07-18	Paper
All Classical Adversary Methods Are Equivalent for Total Functions	2022-03-14	Paper
Exact affine counter automata	2021-12-13	Paper
All classical adversary methods are equivalent for total functions	2020-08-05	Paper
Quantum speedups for exponential-time dynamic programming algorithms	2019-10-15	Paper
On block sensitivity and fractional block sensitivity	2018-11-02	Paper
On the Inner Product Predicate and a Generalization of Matching Vector Families	2018-10-04	Paper
Doubling the success of quantum walk search using internal-state measurements	2016-12-06	Paper
Sensitivity versus certificate complexity of Boolean functions	2016-07-25	Paper
Size of sets with small sensitivity: a generalization of Simon's lemma	2015-09-30	Paper

This page was built for person: Jevgēnijs Vihrovs