default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSander Gribling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Joran van Apeldoorn, Sander Gribling
, Harold Nieuwboer:
Basic quantum subroutines: finding multiple marked elements and summing numbers. Quantum 8: 1284 (2024)- [i12]Simon Apers, Sander Gribling, Aaron Sidford:
On computing approximate Lewis weights. CoRR abs/2404.02881 (2024) - 2023
- [j9]Paria Abbasi, Sander Gribling, Andreas Klingler, Tim Netzer:
Approximate Pythagoras numbers on ⁎-algebras over C. J. Complex. 74: 101698 (2023) - [j8]Simon Apers, Sander Gribling, Sayantan Sen, Dániel Szabó:
A (simple) classical algorithm for estimating Betti numbers. Quantum 7: 1202 (2023) - [c4]Sander Gribling, Sven C. Polak, Lucas Slot:
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. ISSAC 2023: 280-288 - [i11]Joran van Apeldoorn, Sander Gribling, Harold Nieuwboer:
Basic quantum subroutines: finding multiple marked elements and summing numbers. CoRR abs/2302.10244 (2023) - [i10]Sander Gribling, Sven C. Polak, Lucas Slot:
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. CoRR abs/2305.14944 (2023) - [i9]Simon Apers, Sander Gribling:
Quantum speedups for linear programming via interior point methods. CoRR abs/2311.03215 (2023) - 2022
- [j7]Li Gao, Sander Gribling, Yinan Li:
On a Tracial Version of Haemers Bound. IEEE Trans. Inf. Theory 68(10): 6585-6604 (2022) - [c3]Sander Gribling, Harold Nieuwboer:
Improved Quantum Lower and Upper Bounds for Matrix Scaling. STACS 2022: 35:1-35:23 - [i8]Simon Apers, Sander Gribling, Dániel Szilágyi:
Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps. CoRR abs/2209.12771 (2022) - [i7]Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling:
Grothendieck inequalities characterize converses to the polynomial method. CoRR abs/2212.08559 (2022) - 2021
- [c2]Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf:
Quantum Algorithms for Matrix Scaling and Matrix Balancing. ICALP 2021: 110:1-110:17 - [i6]Li Gao, Sander Gribling, Yinan Li:
On a tracial version of Haemers bound. CoRR abs/2107.02567 (2021) - [i5]Sander Gribling, Harold Nieuwboer:
Improved quantum lower and upper bounds for matrix scaling. CoRR abs/2109.15282 (2021) - 2020
- [j6]Aida Abiad, Sander Gribling, Domenico Lahaye, Matthias Mnich, Guus Regts, Lluís Vena, Gerard Verweij, Peter J. Zwaneveld:
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discret. Optim. 37: 100565 (2020) - [j5]Sander Gribling, Yinan Li:
The Haemers Bound of Noncommutative Graphs. IEEE J. Sel. Areas Inf. Theory 1(2): 424-431 (2020) - [j4]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Convex optimization using quantum oracles. Quantum 4: 220 (2020) - [j3]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better upper and lower bounds. Quantum 4: 230 (2020) - [i4]Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf:
Quantum algorithms for matrix scaling and matrix balancing. CoRR abs/2011.12823 (2020)
2010 – 2019
- 2019
- [j2]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) - 2018
- [j1]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) - [i3]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Convex optimization using quantum oracles. CoRR abs/1809.00643 (2018) - [i2]Joran van Apeldoorn, Sander Gribling:
Simon's problem for linear functions. CoRR abs/1810.12030 (2018) - 2017
- [c1]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better Upper and Lower Bounds. FOCS 2017: 403-414 - [i1]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better upper and lower bounds. CoRR abs/1705.01843 (2017)
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-01-21 00:03 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:
