{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:55Z","timestamp":1763467915359,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"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.1536449","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"235-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["Finding sparse cuts locally using evolving sets"],"prefix":"10.1145","author":[{"given":"Reid","family":"Andersen","sequence":"first","affiliation":[{"name":"Microsoft Live Labs, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Peres","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/FOCS.2006.44"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1135777.1135814"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/FOCS.2004.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1250790.1250823"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1007352.1007355"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/237814.237827"},{"doi-asserted-by":"crossref","unstructured":"F.\n       \n      Chung\n    .\n      \n  \n   \n  Spectral graph theory volume Number \n  92\n   in \n  CBMS Regional Conference Series in Mathematics\n  . \n  American Mathematical Society 1997\n  .  F. Chung. Spectral graph theory volume Number 92 in CBMS Regional Conference Series in Mathematics. American Mathematical Society 1997.","key":"e_1_3_2_1_7_1","DOI":"10.1090\/cbms\/092"},{"volume-title":"Second Edition. The MIT Press","year":"2001","author":"Cormen T. H.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1214\/aop\/1176990628","article-title":"Strong stationary times via a new form of duality","author":"Diaconis P.","year":"1990","journal-title":"The Annals of Probability, (18):1483--1522"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/347090.347121"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/290179.290181"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1132516.1132574"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1367497.1367591"},{"volume-title":"American Mathematical Society","year":"2009","author":"Levin D. A.","key":"e_1_3_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/SFCS.1989.63529"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1214\/ECP.v12-1269"},{"unstructured":"R. Montenegro. The simple random walk and max-degree walk on a directed graph. Random Structures & Algorithms To appear.   R. Montenegro. The simple random walk and max-degree walk on a directed graph. Random Structures & Algorithms To appear.","key":"e_1_3_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/780542.780585"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1374376.1374442"},{"key":"e_1_3_2_1_20_1","first-page":"96","volume-title":"FOCS \u201996","author":"Spielman D. A.","year":"1996"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1007352.1007372"},{"unstructured":"D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems. CoRR abs\/cs\/0607105 2006.  D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems. CoRR abs\/cs\/0607105 2006.","key":"e_1_3_2_1_22_1"},{"unstructured":"D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs\/0809.3232 2008.  D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs\/0809.3232 2008.","key":"e_1_3_2_1_23_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1017\/CBO9780511813658"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '09","name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA"},"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.1536449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:50Z","timestamp":1750253930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":24,"alternative-id":["10.1145\/1536414.1536449","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536449","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"}}]}}