( en | de | ru )

 

Disambiguation of "Gharan, Shayan Oveis"

Author of the publication

copydeleteadd this publication to your clipboard
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.

, , , , and . STOC, page 408-420. ACM, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Parviz Shayan

Shayan Assadi

 

Other publications of authors with the same name

An Improved Trickle-Down Theorem for Partite Complexes., and . CoRR, (2022)A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP., , and . CoRR, (2021)Time-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial Functions., , and . CoRR, (2017)Online Stochastic Matching: Online Actions Based on Offline Statistics., , and . SODA, page 1285-1294. SIAM, (2011)Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model., , and . FOCS, page 1319-1330. IEEE, (2020)Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP., and . FOCS, page 20-39. IEEE Computer Society, (2015)A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs., and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 303-316. Springer, (2013)Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes., , and . COLT, volume 49 of JMLR Workshop and Conference Proceedings, page 103-115. JMLR.org, (2016)An Improved Trickle down Theorem for Partite Complexes., and . CCC, volume 264 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests., , , , and . STOC, page 408-420. ACM, (2021)