Krišjānis Prūsis

Available identifiers

Publication	Date of Publication	Type
Quantum speedups for treewidth	2024-06-27	Paper
Exact Affine Counter Automata	2023-08-15	Paper
Error-Free Affine, Unitary, and Probabilistic OBDDs	2023-08-15	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
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
https://portal.mardi4nfdi.de/entity/Q5016371	2021-12-13	Paper
All Classical Adversary Methods are Equivalent for Total Functions	2020-08-05	Paper
Error-free affine, unitary, and probabilistic OBDDs	2020-06-30	Paper
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms	2019-10-15	Paper
On block sensitivity and fractional block sensitivity	2018-11-02	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
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity	2014-10-14	Paper

This page was built for person: Krišjānis Prūsis