Quantum speedups for exponential-time dynamic programming algorithms A Ambainis, K Balodis, J Iraids, M Kokainis, K Prūsis, J Vihrovs Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 87 | 2019 |

Sensitivity versus certificate complexity of boolean functions A Ambainis, K Prūsis, J Vihrovs International Computer Science Symposium in Russia, 16-28, 2016 | 33 | 2016 |

Quantum lower and upper bounds for 2D-grid and Dyck language A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ... arXiv preprint arXiv:2007.03402, 2020 | 21 | 2020 |

Error-free affine, unitary, and probabilistic OBDDs R Ibrahimov, K Khadiev, K Prūsis, A Yakaryılmaz Descriptional Complexity of Formal Systems: 20th IFIP WG 1.02 International …, 2018 | 18 | 2018 |

Stationary states in quantum walk search K Prūsis, J Vihrovs, TG Wong Physical Review A 94 (3), 032334, 2016 | 17 | 2016 |

Oscillatory localization of quantum walks analyzed by classical electric circuits A Ambainis, K Prūsis, J Vihrovs, TG Wong Physical Review A 94 (6), 062324, 2016 | 13 | 2016 |

Doubling the success of quantum walk search using internal-state measurements K Prūsis, J Vihrovs, TG Wong Journal of Physics A: Mathematical and Theoretical 49 (45), 455301, 2016 | 11 | 2016 |

A tight lower bound on certificate complexity in terms of block sensitivity and sensitivity A Ambainis, K Prūsis International Symposium on Mathematical Foundations of Computer Science, 33-44, 2014 | 11 | 2014 |

An inverse distance-based potential field function for overlapping point set visualization J Vihrovs, K Prūsis, K Freivalds, P Ručevskis, V Krebs 2014 International Conference on Information Visualization Theory and …, 2014 | 11 | 2014 |

Exact affine counter automata M Nakanishi, K Khadiev, K Prūsis, J Vihrovs, A Yakaryılmaz arXiv preprint arXiv:1703.04281, 2017 | 10* | 2017 |

Error-free affine, unitary, and probabilistic OBDDs R Ibrahimov, K Khadiev, K Prūsis, A Yakaryılmaz International Journal of Foundations of Computer Science 32 (07), 827-847, 2021 | 9 | 2021 |

All classical adversary methods are equivalent for total functions A Ambainis, M Kokainis, K Prūsis, J Vihrovs, A Zajakins ACM Transactions on Computation Theory (TOCT) 13 (1), 1-20, 2021 | 9 | 2021 |

Zero-error affine, unitary, and probabilistic OBDDs R Ibrahimov, K Khadiev, K Prusis, J Vihrovs, A Yakaryilmaz arXiv preprint arXiv:1703.07184, 2017 | 9 | 2017 |

On block sensitivity and fractional block sensitivity A Ambainis, K Prūsis, J Vihrovs Lobachevskii Journal of Mathematics 39, 967-969, 2018 | 4 | 2018 |

Quantum speedups for treewidth V Kļevickis, K Prūsis, J Vihrovs arXiv preprint arXiv:2202.08186, 2022 | 3 | 2022 |

Quantum bounds for 2D-grid and Dyck language A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ... Quantum Information Processing 22 (5), 194, 2023 | 1 | 2023 |

A potential field function for overlapping point set and graph cluster visualization J Vihrovs, K Prūsis, K Freivalds, P Ručevskis, V Krebs Computer Vision, Imaging and Computer Graphics-Theory and Applications …, 2015 | 1 | 2015 |

Strong dispersion property for the quantum walk on the hypercube M Kokainis, K Prūsis, J Vihrovs, V Kashcheyevs, A Ambainis Journal of Physics A: Mathematical and Theoretical 55 (49), 495301, 2022 | | 2022 |

Quantum Lower Bounds for 2D-Grid and Dyck Language A Ambainis, K Balodis, J Iraids, K Prūsis, J Smotrovs arXiv preprint arXiv:1911.12638, 2019 | | 2019 |

Quantum lower and upper bounds for 2D-grid and dyck language J Smotrovs, J Iraids, A Ambainis, Y Shen, V Kļevickis, K Khadiev, ... | | |