{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T08:19:47Z","timestamp":1775377187399,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1717349, 1839323, 1909756, CCF-1749609, CCF-1740551, DMS-1839116"],"award-info":[{"award-number":["1717349, 1839323, 1909756, CCF-1749609, CCF-1740551, DMS-1839116"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Faculty Fellowship"],"award-info":[{"award-number":["Faculty Fellowship"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["Sloan Research Fellowship"],"award-info":[{"award-number":["Sloan Research Fellowship"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384272","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1212-1222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Strong self-concordance and sampling"],"prefix":"10.1145","author":[{"given":"Aditi","family":"Laddha","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin Tat","family":"Lee","sequence":"additional","affiliation":[{"name":"University of Washington, USA \/ Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008733"},{"key":"e_1_3_2_1_2_1","unstructured":"S\u00e9bastien Bubeck and Ronen Eldan. 2014. The entropic barrier: a simple and optimal universal self-concordant barrier. arXiv preprint arXiv:1412.1587 ( 2014 ).  S\u00e9bastien Bubeck and Ronen Eldan. 2014. The entropic barrier: a simple and optimal universal self-concordant barrier. arXiv preprint arXiv:1412.1587 ( 2014 )."},{"key":"e_1_3_2_1_3_1","article-title":"Fast MCMC sampling algorithms on polytopes","volume":"19","author":"Chen Yuansi","year":"2018","unstructured":"Yuansi Chen , Raaz Dwivedi , Martin J Wainwright , and Bin Yu . 2018 . Fast MCMC sampling algorithms on polytopes . The Journal of Machine Learning Research 19 , 1 ( 2018 ), 2146-2231. Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu. 2018. Fast MCMC sampling algorithms on polytopes. The Journal of Machine Learning Research 19, 1 ( 2018 ), 2146-2231.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Ronen Eldan. 2013. Thin shell implies spectral gap up to polylog via a stochastic localization scheme. Geometric and Functional Analysis 23 2 ( 2013 ) 532-569.  Ronen Eldan. 2013. Thin shell implies spectral gap up to polylog via a stochastic localization scheme. Geometric and Functional Analysis 23 2 ( 2013 ) 532-569.","DOI":"10.1007\/s00039-013-0214-y"},{"key":"e_1_3_2_1_6_1","volume-title":"John's walk. arXiv preprint arXiv","author":"Gustafson Adam","year":"1803","unstructured":"Adam Gustafson and Hariharan Narayanan . 2018. John's walk. arXiv preprint arXiv : 1803 . 02032 ( 2018 ). Adam Gustafson and Hariharan Narayanan. 2018. John's walk. arXiv preprint arXiv: 1803. 02032 ( 2018 )."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Roland Hildebrand. 2014. Canonical barriers on convex cones. Mathematics of operations research 39 3 ( 2014 ) 841-850.  Roland Hildebrand. 2014. Canonical barriers on convex cones. Mathematics of operations research 39 3 ( 2014 ) 841-850.","DOI":"10.1287\/moor.2013.0640"},{"key":"e_1_3_2_1_8_1","volume-title":"Random walks and an o*(n5)","author":"Kannan Ravi","year":"1997","unstructured":"Ravi Kannan , L\u00e1szl\u00f3 Lov\u00e1sz , and Mikl\u00f3s Simonovits . 1997. Random walks and an o*(n5) volume algorithm for convex bodies. Random Structures & Algorithms 11 , 1 ( 1997 ), 1-50. Ravi Kannan, L\u00e1szl\u00f3 Lov\u00e1sz, and Mikl\u00f3s Simonovits. 1997. Random walks and an o*(n5) volume algorithm for convex bodies. Random Structures & Algorithms 11, 1 ( 1997 ), 1-50."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Ravindran Kannan and Hariharan Narayanan. 2012. Random walks on polytopes and an afine interior point method for linear programming. Mathematics of Operations Research 37 1 ( 2012 ) 1-20.  Ravindran Kannan and Hariharan Narayanan. 2012. Random walks on polytopes and an afine interior point method for linear programming. Mathematics of Operations Research 37 1 ( 2012 ) 1-20.","DOI":"10.1287\/moor.1110.0519"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634090"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.23"},{"key":"e_1_3_2_1_14_1","volume-title":"Solving Linear Programs with Sqrt (rank) Linear System Solves. arXiv preprint arXiv","author":"Lee Yin Tat","year":"1910","unstructured":"Yin Tat Lee and Aaron Sidford . 2019. Solving Linear Programs with Sqrt (rank) Linear System Solves. arXiv preprint arXiv : 1910 . 08033 ( 2019 ). Yin Tat Lee and Aaron Sidford. 2019. Solving Linear Programs with Sqrt (rank) Linear System Solves. arXiv preprint arXiv: 1910. 08033 ( 2019 )."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.96"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055416"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188774"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz. 1999. Hit-and-run mixes fast. Mathematical Programming 86 3 ( 1999 ) 443-461.  L\u00e1szl\u00f3 Lov\u00e1sz. 1999. Hit-and-run mixes fast. Mathematical Programming 86 3 ( 1999 ) 443-461.","DOI":"10.1007\/s101070050099"},{"key":"e_1_3_2_1_19_1","volume-title":"Random walks in a convex body and an improved","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1993","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Mikl\u00f3s Simonovits . 1993. Random walks in a convex body and an improved volume algorithm. Random structures & algorithms 4 , 4 ( 1993 ), 359-412. L\u00e1szl\u00f3 Lov\u00e1sz and Mikl\u00f3s Simonovits. 1993. Random walks in a convex body and an improved volume algorithm. Random structures & algorithms 4, 4 ( 1993 ), 359-412."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.28"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544727X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.08.004"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Santosh Vempala. 2007. The geometry of logconcave functions and sampling algorithms. Random Structures & Algorithms 30 3 ( 2007 ) 307-358.  L\u00e1szl\u00f3 Lov\u00e1sz and Santosh Vempala. 2007. The geometry of logconcave functions and sampling algorithms. Random Structures & Algorithms 30 3 ( 2007 ) 307-358.","DOI":"10.1002\/rsa.20135"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.30"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00082"},{"key":"e_1_3_2_1_27_1","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Nesterov Yurii","unstructured":"Yurii Nesterov and Arkadii Nemirovskii . 1994. Interior-point polynomial algorithms in convex programming . Vol. 13 . Siam . Yurii Nesterov and Arkadii Nemirovskii. 1994. Interior-point polynomial algorithms in convex programming. Vol. 13. Siam."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884565"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"James Renegar. 1988. A polynomial-time algorithm based on Newton's method for linear programming. Mathematical programming 40 1-3 ( 1988 ) 59-93.  James Renegar. 1988. A polynomial-time algorithm based on Newton's method for linear programming. Mathematical programming 40 1-3 ( 1988 ) 59-93.","DOI":"10.1007\/BF01580724"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2016.07.005"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055501"},{"key":"e_1_3_2_1_33_1","first-page":"332","article-title":"Speeding-up linear programming using fast matrix multiplication. In 30th annual symposium on foundations of computer science","author":"Vaidya Pravin M","year":"1989","unstructured":"Pravin M Vaidya . 1989 . Speeding-up linear programming using fast matrix multiplication. In 30th annual symposium on foundations of computer science . IEEE , 332 - 337 . Pravin M Vaidya. 1989. Speeding-up linear programming using fast matrix multiplication. In 30th annual symposium on foundations of computer science. IEEE, 332-337.","journal-title":"IEEE"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Pravin M Vaidya. 1996. A new algorithm for minimizing convex functions over convex sets. Mathematical programming 73 3 ( 1996 ) 291-341.  Pravin M Vaidya. 1996. A new algorithm for minimizing convex functions over convex sets. Mathematical programming 73 3 ( 1996 ) 291-341.","DOI":"10.1007\/BF02592216"},{"key":"e_1_3_2_1_35_1","unstructured":"Santosh Vempala. 2005. Geometric random walks: a survey. Combinatorial and computational geometry 52 573-612 ( 2005 ) 2.  Santosh Vempala. 2005. Geometric random walks: a survey. Combinatorial and computational geometry 52 573-612 ( 2005 ) 2."}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":35,"alternative-id":["10.1145\/3357713.3384272","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384272","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}