Martins Kokainis

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 20

Top Topics

Piecewise Polynomial

Dynamic Programming

Top Venues

Publications

Andris Ambainis, Martins Kokainis, Jevgenijs Vihrovs
Improved Algorithm and Lower Bound for Variable Time Quantum Search. TQC (2023)
Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. MFCS (2021)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins
All Classical Adversary Methods Are Equivalent for Total Functions. ACM Trans. Comput. Theory 13 (1) (2021)
Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis
Quadratic speedup for finding marked vertices by quantum walks. STOC (2020)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA (2019)
Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis
Quadratic speedup for finding marked vertices by quantum walks. CoRR (2019)
Martins Kokainis, Svetlana V. Asmuss
Modified multivariate F-transform based on B-splines. EUSFLAT Conf. (2019)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR (2018)
Martins Kokainis, Svetlana V. Asmuss
Collocation Method for Linear BVPs via B-spline Based Fuzzy Transform. IPMU (2) (2018)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
All Classical Adversary Methods are Equivalent for Total Functions. STACS (2018)
Martins Kokainis, Svetlana V. Asmuss
Modified F-transform Based on B-splines. IPMU (2) (2018)
Martins Kokainis, Svetlana V. Asmuss
Approximation by multivariate higher degree F-transform based on B-splines. Soft Comput. 21 (13) (2017)
Martins Kokainis, Svetlana V. Asmuss
Continuous and discrete higher-degree F-transforms based on B-splines. Soft Comput. 21 (13) (2017)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
All Classical Adversary Methods are Equivalent for Total Functions. CoRR (2017)
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
All Classical Adversary Methods are Equivalent for Total Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Andris Ambainis, Martins Kokainis
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. CoRR (2017)
Andris Ambainis, Martins Kokainis
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. STOC (2017)
Andris Ambainis, Martins Kokainis, Robin Kothari
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions. Computational Complexity Conference (2016)
Martins Kokainis, Svetlana V. Asmuss
Higher Degree F-transforms Based on B-splines of Two Variables. IPMU (1) (2016)
Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. Computational Complexity Conference (2016)
Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. CoRR (2015)
Andris Ambainis, Martins Kokainis
Almost quadratic gap between partition complexity and query/communication complexity. CoRR (2015)
Martins Kokainis, Svetlana V. Asmuss
Approximation properties of higher degree F-transforms based on B-splines. FUZZ-IEEE (2015)