{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T08:19:38Z","timestamp":1775377178844,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536491","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"561-570","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Random walks on polytopes and an affine interior point method for linear programming"],"prefix":"10.1145","author":[{"given":"Ravi","family":"Kannan","sequence":"first","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hariharan","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Unversity of Chicago, Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"263","article-title":"Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization","volume":"2008","author":"Abernethy J.","unstructured":"J. Abernethy , E. Hazan and A. Rakhlin , \" Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization ,\" 21st Annual Conference on Learning Theory, (COLT) , 2008 263 -- 274 J. Abernethy, E. Hazan and A. Rakhlin, \"Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization,\" 21st Annual Conference on Learning Theory, (COLT), 2008 263--274","journal-title":"21st Annual Conference on Learning Theory, (COLT)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0192-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90110-X"},{"key":"e_1_3_2_1_4_1","first-page":"845","article-title":"Testing for independence in a two-way table: new interpretations of the chi-square statistic","volume":"13","author":"Efron B.","year":"1995","unstructured":". Diaconis and B. Efron , \" Testing for independence in a two-way table: new interpretations of the chi-square statistic ,\" Annals of Statistics 13 , pp. 845 -- 913 , 1995 . . Diaconis and B. Efron, \"Testing for independence in a two-way table: new interpretations of the chi-square statistic,\" Annals of Statistics 13, pp. 845--913, 1995.","journal-title":"Annals of Statistics"},{"key":"e_1_3_2_1_5_1","unstructured":".I. Dikin \"Iterative solutions of problems of linear and quadratic programming \" Soviet Math. Dokl 8 (1967)  .I. Dikin \"Iterative solutions of problems of linear and quadratic programming \" Soviet Math. Dokl 8 (1967)"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102783"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199708)11:1%3C1::AID-RSA1%3E3.0.CO;2-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258665"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592079"},{"key":"e_1_3_2_1_11_1","unstructured":". Ledoux \"The concentration of measure phenomenon \" Mathematical Surveys and Monographs 89 American Mathematical Society(2001).  . Ledoux \"The concentration of measure phenomenon \" Mathematical Surveys and Monographs 89 American Mathematical Society(2001)."},{"key":"e_1_3_2_1_12_1","first-page":"86","article-title":"Hit-and-run mixes fast","year":"1999","unstructured":". Lov\u00e1sz , \" Hit-and-run mixes fast ,\" Math. Programming, series A , 86 ( 1999 ). . Lov\u00e1sz, \"Hit-and-run mixes fast,\" Math. Programming, series A, 86 (1999).","journal-title":"Math. Programming, series A"},{"key":"e_1_3_2_1_13_1","volume-title":"Random walks in a convex body and animproved","author":"Simonovits M.","year":"1993","unstructured":". Lov\u00e1sz and M. Simonovits , \" Random walks in a convex body and animproved volume algorithm,\" Random structures and algorithms, 4 ( 1993 ) . Lov\u00e1sz and M. Simonovits, \"Random walks in a convex body and animproved volume algorithm,\" Random structures and algorithms, 4 (1993)"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544727X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.28"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v30:3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10049"},{"key":"e_1_3_2_1_18_1","volume-title":"Interior point polynomial algorithms in convex programming,\" SIAM Publications","author":"Nesterov E.","year":"1994","unstructured":". E. Nesterov and A. S. Nemirovskii , \" Interior point polynomial algorithms in convex programming,\" SIAM Publications . SIAM , Philadelphia, USA ,( 1994 ) . E. Nesterov and A. S. Nemirovskii, \"Interior point polynomial algorithms in convex programming,\" SIAM Publications. SIAM, Philadelphia, USA,(1994)"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.1.1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580724"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592216"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580859"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":". J. Vanderbei and J. C. Lagarias \"I. I. Dikin'sconvergence result for the affine-scaling algorithm \" Contemporary mathematics 114 (1990)  . J. Vanderbei and J. C. Lagarias \"I. I. Dikin'sconvergence result for the affine-scaling algorithm \" Contemporary mathematics 114 (1990)","DOI":"10.1090\/conm\/114\/1097868"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA","acronym":"STOC '09","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":23,"alternative-id":["10.1145\/1536414.1536491","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536491","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}