default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid de Laat
Person information
- affiliation: Technische Universiteit Delft, Delft, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Felipe Gonçalves, David de Laat, Nando Leijenhorst
:
Multiplicity of nontrivial zeros of primitive 𝐿-functions via higher-level correlations. Math. Comput. 94(354): 2041-2058 (2024)- [j8]Nando Leijenhorst, David de Laat:
Solving clustered low-rank semidefinite programs arising from polynomial optimization. Math. Program. Comput. 16(3): 503-534 (2024) - [i3]Henry Cohn, David de Laat, Nando Leijenhorst:
Optimality of spherical codes via exact semidefinite programming bounds. CoRR abs/2403.16874 (2024) - 2022
- [j7]David de Laat, Fabrício Caluza Machado, Fernando Mário de Oliveira Filho, Frank Vallentin:
k-Point semidefinite programming bounds for equiangular lines. Math. Program. 194(1): 533-567 (2022) - 2021
- [j6]Andrés Chirre, Valdir José Pereira Júnior, David de Laat:
Primes in arithmetic progressions and semidefinite programming. Math. Comput. 90(331): 2235-2246 (2021) - [j5]Maria Dostert, David de Laat, Philippe Moustrou:
Exact Semidefinite Programming Bounds for Packing Problems. SIAM J. Optim. 31(2): 1433-1458 (2021) - 2020
- [i2]Andrés Chirre, Valdir José Pereira Júnior, David de Laat:
Primes in arithmetic progressions and semidefinite programming. CoRR abs/2005.02393 (2020)
2010 – 2019
- 2019
- [j4]Sander Gribling, David de Laat, Monique Laurent:
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. Found. Comput. Math. 19(5): 1013-1070 (2019) - [i1]David de Laat, Larry Rolen, Zack Tripp, Ian Wagner:
Pair correlation for Dedekind zeta functions of abelian extensions. CoRR abs/1908.04876 (2019) - 2018
- [j3]Sander Gribling, David de Laat, Monique Laurent:
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Math. Program. 170(1): 5-42 (2018) - 2015
- [j2]David de Laat, Frank Vallentin:
A semidefinite programming hierarchy for packing problems in discrete geometry. Math. Program. 151(2): 529-553 (2015) - 2014
- [j1]Evan DeCorte, David de Laat, Frank Vallentin:
Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs. Exp. Math. 23(2): 146-152 (2014)
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 2026-04-23 00:09 CEST 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:
