default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCole Franks
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j2]Cole Franks:
A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy. Comb. Probab. Comput. 30(3): 398-411 (2021)- 2020
- [j1]Cole Franks, Michael E. Saks:
On the discrepancy of random matrices with many columns. Random Struct. Algorithms 57(1): 64-96 (2020)
Conference and Workshop Papers
- 2023
- [c6]Cole Franks, Tasuku Soma
, Michel X. Goemans:
Shrunk subspaces via operator Sinkhorn iteration. SODA 2023: 1655-1668 - 2021
- [c5]William Cole Franks, Philipp Reichenbach:
Barriers for Recent Methods in Geodesic Optimization. CCC 2021: 13:1-13:54 - 2020
- [c4]William Cole Franks, Ankur Moitra:
Rigorous Guarantees for Tyler's M-Estimator via Quantum Expansion. COLT 2020: 1601-1632 - 2019
- [c3]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. FOCS 2019: 845-861 - 2018
- [c2]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. FOCS 2018: 883-897 - [c1]Cole Franks:
Operator scaling with specified marginals. STOC 2018: 190-203
Informal and Other Publications
- 2022
- [i8]Cole Franks, Tasuku Soma, Michel X. Goemans:
Shrunk subspaces via operator Sinkhorn iteration. CoRR abs/2207.08311 (2022) - 2021
- [i7]Cole Franks, Philipp Reichenbach:
Barriers for recent methods in geodesic optimization. CoRR abs/2102.06652 (2021) - [i6]Cole Franks, Rafael Mendes de Oliveira, Akshay Ramachandran, Michael Walter:
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity. CoRR abs/2110.07583 (2021) - 2020
- [i5]Cole Franks, Ankur Moitra:
Rigorous Guarantees for Tyler's M-estimator via quantum expansion. CoRR abs/2002.00071 (2020) - 2019
- [i4]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. CoRR abs/1910.12375 (2019) - 2018
- [i3]Cole Franks:
Operator scaling with specified marginals. CoRR abs/1801.01412 (2018) - [i2]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. CoRR abs/1804.04739 (2018) - [i1]Cole Franks:
A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy. CoRR abs/1811.01102 (2018)
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 2024-04-24 22:52 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:
