Martins Kokainis

Orcid: 0000-0003-3381-7271

According to our database1, Martins Kokainis authored at least 18 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Improved Algorithm and Lower Bound for Variable Time Quantum Search.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2022
Dataset for "Strong dispersion property for the quantum walk on the hypercube".
Dataset, January, 2022

2021
All Classical Adversary Methods Are Equivalent for Total Functions.
ACM Trans. Comput. Theory, 2021

Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Quadratic speedup for finding marked vertices by quantum walks.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Modified multivariate F-transform based on B-splines.
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.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

Modified F-transform Based on B-splines.
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.
Soft Comput., 2017

Approximation by multivariate higher degree F-transform based on B-splines.
Soft Comput., 2017

All Classical Adversary Methods are Equivalent for Total Functions.
Electron. Colloquium Comput. Complex., 2017

Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games.
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.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2016

Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions.
Proceedings of the 31st Conference on Computational Complexity, 2016

Polynomials, Quantum Query Complexity, and Grothendieck's Inequality.
Proceedings of the 31st Conference on Computational Complexity, 2016

2015
Almost quadratic gap between partition complexity and query/communication complexity.
CoRR, 2015

Approximation properties of higher degree F-transforms based on B-splines.
Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, 2015


  Loading...