{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T07:15:31Z","timestamp":1762067731748,"version":"build-2065373602"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR9224935"],"award-info":[{"award-number":["CCR9224935"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1016\/0020-0190(95)00101-h","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"79-81","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["The worst-case running time of the random simplex algorithm is exponential in the height"],"prefix":"10.1016","volume":"56","author":[{"given":"Andrei Z.","family":"Broder","sequence":"first","affiliation":[]},{"given":"Martin E.","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Alan M.","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1963","series-title":"Linear Programming and Extensions","author":"Dantzig","key":"10.1016\/0020-0190(95)00101-H_BIB1"},{"key":"10.1016\/0020-0190(95)00101-H_BIB2","series-title":"Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"502","article-title":"Randomized simplex algorithms on Klee-Minty cubes","author":"G\u00e4rtner","year":"1994"},{"key":"10.1016\/0020-0190(95)00101-H_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0273-0979-1992-00285-9","article-title":"A quasi-polynomial bound for the diameter of graphs of polyhedra","volume":"26","author":"Kalai","year":"1992","journal-title":"Bull. AMS"},{"key":"10.1016\/0020-0190(95)00101-H_BIB4","series-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing","first-page":"475","article-title":"A subexponential randomized simplex algorithm","author":"Kalai","year":"1992"},{"key":"10.1016\/0020-0190(95)00101-H_BIB5","series-title":"Inequalities III","first-page":"159","article-title":"How good is the Simplex Method","author":"Klee","year":"1972"},{"key":"10.1016\/0020-0190(95)00101-H_BIB6","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1287\/moor.5.4.599","article-title":"The monotonic bounded Hirsch conjecture is false for dimension at least 4","volume":"5","author":"Todd","year":"1980","journal-title":"Math. Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500101H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500101H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T07:10:34Z","timestamp":1762067434000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500101H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["002001909500101H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00101-h","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1995,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The worst-case running time of the random simplex algorithm is exponential in the height","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(95)00101-H","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}