{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:10Z","timestamp":1750220530371,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"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":[[2021,6,15]]},"DOI":"10.1145\/3406325.3457137","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"2-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Climbing algorithms (invited talk)"],"prefix":"10.1145","author":[{"given":"Leonid A.","family":"Levin","sequence":"first","affiliation":[{"name":"Boston University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"286","article-title":"On an Algorithm for the Minimization of Convex Functions. Soviet Math","volume":"6","author":"Levin A. Yu.","year":"1965","unstructured":"A. Yu. Levin. 1965. On an Algorithm for the Minimization of Convex Functions. Soviet Math., Doklady, 6 : 286-290.","journal-title":"Doklady"},{"issue":"2","key":"e_1_3_2_1_2_1","first-page":"128","article-title":"Informational Complexity and Efective Methods for Solving Convex Extremum Problems. Economica i Mat","volume":"12","author":"Yudin D.B.","year":"1976","unstructured":"D.B. Yudin, A.S. Nemirovsky. 1976. Informational Complexity and Efective Methods for Solving Convex Extremum Problems. Economica i Mat. Metody, 12 ( 2 ): 128-142 ; transl. MatEcon 13 : 3-25.","journal-title":"Metody"},{"issue":"1","key":"e_1_3_2_1_3_1","first-page":"191","article-title":"A Polynomial Algorithm for Linear Programming. Soviet Math","volume":"20","author":"Khachian L.G.","year":"1979","unstructured":"L.G. Khachian. 1979. A Polynomial Algorithm for Linear Programming. Soviet Math., Doklady, 20 ( 1 ): 191-194.","journal-title":"Doklady"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.63"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3457137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3457137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:54Z","timestamp":1750195494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3457137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":4,"alternative-id":["10.1145\/3406325.3457137","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3457137","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}