Martins Kokainis

According to our database, Martins Kokainis authored at least 17 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Improved Algorithm and Lower Bound for Variable Time Quantum Search.

Andris Ambainis, Martins Kokainis, Jevgenijs Vihrovs

Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2021

All Classical Adversary Methods Are Equivalent for Total Functions.

Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins

ACM Trans. Comput. Theory, 2021

Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs.

Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Quadratic speedup for finding marked vertices by quantum walks.

Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms.

Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Modified multivariate F-transform based on B-splines.

Martins Kokainis, Svetlana V. Asmuss

Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology, 2019

2018

Collocation Method for Linear BVPs via B-spline Based Fuzzy Transform.

Martins Kokainis, Svetlana V. Asmuss

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

Modified F-transform Based on B-splines.

Martins Kokainis, Svetlana V. Asmuss

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

2017

Continuous and discrete higher-degree F-transforms based on B-splines.

Martins Kokainis, Svetlana V. Asmuss

Soft Comput., 2017

Approximation by multivariate higher degree F-transform based on B-splines.

Martins Kokainis, Svetlana V. Asmuss

Soft Comput., 2017

All Classical Adversary Methods are Equivalent for Total Functions.

Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs

Electron. Colloquium Comput. Complex., 2017

Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games.

Andris Ambainis, Martins Kokainis

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Higher Degree F-transforms Based on B-splines of Two Variables.

Martins Kokainis, Svetlana V. Asmuss

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2016

Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions.

Andris Ambainis, Martins Kokainis, Robin Kothari

Proceedings of the 31st Conference on Computational Complexity, 2016

Polynomials, Quantum Query Complexity, and Grothendieck's Inequality.

Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Almost quadratic gap between partition complexity and query/communication complexity.

Andris Ambainis, Martins Kokainis

CoRR, 2015

Approximation properties of higher degree F-transforms based on B-splines.

Martins Kokainis, Svetlana V. Asmuss

Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, 2015