{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T21:52:11Z","timestamp":1775166731586,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806697","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"39-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Perfect matchings in o(\n            <i>n<\/i>\n            log\n            <i>n<\/i>\n            ) time in regular bipartite graphs"],"prefix":"10.1145","author":[{"given":"Ashish","family":"Goel","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kapralov","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946318"},{"key":"e_1_3_2_1_2_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","volume":"5","author":"Birkhoff G.","year":"1946","unstructured":"G. Birkhoff . Tres observaciones sobre el algebra lineal . Univ. Nac. Tucum\u00e1n Rev. Ser. A , 5 : 147 -- 151 , 1946 . G. Birkhoff. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n Rev. Ser. A, 5:147--151, 1946.","journal-title":"Univ. Nac. Tucum\u00e1n Rev. Ser. A"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00427-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211043"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170002"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , and R. L. Rivest . Introduction to Algorithms ( 3 rd Ed). MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms (3rd Ed). MIT Press, 2009.","edition":"3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211009"},{"key":"e_1_3_2_1_9_1","unstructured":"A. Goel M. Kapralov and S. Khanna. Perfect matchings in ~O(n1.5) time in regular bipartite graphs. http:\/\/arxiv.org\/abs\/0902.1617v2 2009.  A. Goel M. Kapralov and S. Khanna. Perfect matchings in ~O(n 1.5 ) time in regular bipartite graphs. http:\/\/arxiv.org\/abs\/0902.1617v2 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496772"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456961"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796299266"},{"key":"e_1_3_2_1_15_1","volume-title":"A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the optimal assignment problem to the Theory of Games, 2:5--12","author":"von Neumann J.","year":"1953","unstructured":"J. von Neumann . A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the optimal assignment problem to the Theory of Games, 2:5--12 , 1953 . J. von Neumann. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the optimal assignment problem to the Theory of Games, 2:5--12, 1953."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90172-7"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806697","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:36Z","timestamp":1750246776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":16,"alternative-id":["10.1145\/1806689.1806697","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806697","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}