default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartins Kokainis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]Andris Ambainis, Martins Kokainis, Jevgenijs Vihrovs:
Improved Algorithm and Lower Bound for Variable Time Quantum Search. TQC 2023: 7:1-7:18- 2022
- [d1]Martins Kokainis
, Krisjanis Prusis, Jevgenijs Vihrovs, Vyacheslavs Kashcheyevs, Andris Ambainis:
Dataset for "Strong dispersion property for the quantum walk on the hypercube". Zenodo, 2022
- 2021
- [j3]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): 7:1-7:20 (2021) - [c12]Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs:
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. MFCS 2021: 50:1-50:23 - 2020
- [c11]Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis:
Quadratic speedup for finding marked vertices by quantum walks. STOC 2020: 412-424
2010 – 2019
- 2019
- [c10]Martins Kokainis, Svetlana V. Asmuss:
Modified multivariate F-transform based on B-splines. EUSFLAT Conf. 2019 - [c9]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA 2019: 1783-1793 - [i7]Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis:
Quadratic speedup for finding marked vertices by quantum walks. CoRR abs/1903.07493 (2019) - 2018
- [c8]Martins Kokainis, Svetlana V. Asmuss:
Modified F-transform Based on B-splines. IPMU (2) 2018: 175-186 - [c7]Martins Kokainis, Svetlana V. Asmuss:
Collocation Method for Linear BVPs via B-spline Based Fuzzy Transform. IPMU (2) 2018: 187-198 - [c6]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. STACS 2018: 8:1-8:14 - [i6]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR abs/1807.05209 (2018) - 2017
- [j2]Martins Kokainis, Svetlana V. Asmuss:
Approximation by multivariate higher degree F-transform based on B-splines. Soft Comput. 21(13): 3587-3614 (2017) - [j1]Martins Kokainis, Svetlana V. Asmuss:
Continuous and discrete higher-degree F-transforms based on B-splines. Soft Comput. 21(13): 3615-3639 (2017) - [c5]Andris Ambainis, Martins Kokainis:
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. STOC 2017: 989-1002 - [i5]Andris Ambainis, Martins Kokainis:
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. CoRR abs/1704.06774 (2017) - [i4]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. CoRR abs/1709.08985 (2017) - [i3]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Andris Ambainis, Martins Kokainis, Robin Kothari:
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions. CCC 2016: 4:1-4:14 - [c3]Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. CCC 2016: 25:1-25:19 - [c2]Martins Kokainis, Svetlana V. Asmuss:
Higher Degree F-transforms Based on B-splines of Two Variables. IPMU (1) 2016: 648-659 - 2015
- [c1]Martins Kokainis, Svetlana V. Asmuss:
Approximation properties of higher degree F-transforms based on B-splines. FUZZ-IEEE 2015: 1-8 - [i2]Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. CoRR abs/1511.08682 (2015) - [i1]Andris Ambainis, Martins Kokainis:
Almost quadratic gap between partition complexity and query/communication complexity. CoRR abs/1512.00661 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
