Martins Kokainis

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