{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:41:42Z","timestamp":1781077302725,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"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":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993715","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"587-596","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":106,"title":["Online bipartite matching with unknown distributions"],"prefix":"10.1145","author":[{"given":"Chinmay","family":"Karande","sequence":"first","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pushkar","family":"Tripathi","sequence":"additional","affiliation":[{"name":"Georgia Inst. of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133131"},{"key":"e_1_3_2_2_2_1","first-page":"253","volume-title":"Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In Algorithms--ESA 2007 15th Annual European Symposium, Eilat, Israel, October 8--10, 2007: Proceedings","author":"Buchbinder N.","unstructured":"N. Buchbinder , K. Jain , and J.S. Naor . Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In Algorithms--ESA 2007 15th Annual European Symposium, Eilat, Israel, October 8--10, 2007: Proceedings , page 253 . Springer, 2007. N. Buchbinder, K. Jain, and J.S. Naor. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In Algorithms--ESA 2007 15th Annual European Symposium, Eilat, Israel, October 8--10, 2007: Proceedings, page 253. Springer, 2007."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888956"},{"key":"e_1_3_2_2_4_1","volume-title":"On-line bipartite matching made simple","author":"Birnbaum B.","year":"2008","unstructured":"B. Birnbaum and C. Mathieu . On-line bipartite matching made simple . 2008 . B. Birnbaum and C. Mathieu. On-line bipartite matching made simple. 2008."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_2_7_1","first-page":"982","volume-title":"SODA","author":"Goel Gagan","year":"2008","unstructured":"Gagan Goel and Aranyak Mehta . Online budgeted matching in random input models with applications to adwords . In SODA , pages 982 -- 991 , 2008 . Gagan Goel and Aranyak Mehta. Online budgeted matching in random input models with applications to adwords. In SODA, pages 982--991, 2008."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_42"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212147"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250952"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133134"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.12"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993715","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:11Z","timestamp":1750244771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":14,"alternative-id":["10.1145\/1993636.1993715","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993715","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}