![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jonathan Leake
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j2]Jonathan Leake, Nisheeth K. Vishnoi
:
On the Computability of Continuous Maximum Entropy Distributions with Applications. SIAM J. Comput. 51(5): 1451-1505 (2022) - 2021
- [j1]Leonid Gurvits, Jonathan Leake:
Counting matchings via capacity-preserving operators. Comb. Probab. Comput. 30(6): 956-981 (2021)
Conference and Workshop Papers
- 2024
- [c4]Leonid Gurvits, Nathan Klein
, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. ICALP 2024: 79:1-79:20 - 2021
- [c3]Leonid Gurvits, Jonathan Leake:
Capacity lower bounds via productization. STOC 2021: 847-858 - [c2]Jonathan Leake, Colin S. McSwiggen, Nisheeth K. Vishnoi:
Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to Quantum inference and differential privacy. STOC 2021: 1384-1397 - 2020
- [c1]Jonathan Leake, Nisheeth K. Vishnoi:
On the computability of continuous maximum entropy distributions with applications. STOC 2020: 930-943
Informal and Other Publications
- 2023
- [i8]Leonid Gurvits, Nathan Klein, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. CoRR abs/2311.09072 (2023) - [i7]Leonid Gurvits, Nathan Klein, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i6]Mahmut Levent Dogan, Jonathan Leake, Mohan Ravichandran:
Deterministic Approximation Algorithms for Volumes of Spectrahedra. CoRR abs/2211.12541 (2022) - 2021
- [i5]Jonathan Leake, Nisheeth K. Vishnoi:
Optimization and Sampling Under Continuous Symmetry: Examples and Lie Theory. CoRR abs/2109.01080 (2021) - 2020
- [i4]Jonathan Leake, Nisheeth K. Vishnoi:
On the computability of continuous maximum entropy distributions with applications. CoRR abs/2004.07403 (2020) - [i3]Jonathan Leake, Nisheeth K. Vishnoi:
On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups. CoRR abs/2011.01851 (2020) - [i2]Jonathan Leake, Colin S. McSwiggen, Nisheeth K. Vishnoi:
A Polynomial-Time Algorithm and Applications for Matrix Sampling from Harish-Chandra-Itzykson-Zuber Densities. CoRR abs/2011.05417 (2020) - [i1]Leonid Gurvits, Jonathan Leake:
Capacity Lower Bounds via Productization. Electron. Colloquium Comput. Complex. TR20 (2020)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint