{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T17:44:58Z","timestamp":1775670298260,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214080","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1141-1160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["Approximating the exponential, the lanczos method and an \u00d5(<i>m<\/i>)-time spectral algorithm for balanced separator"],"prefix":"10.1145","author":[{"given":"Lorenzo","family":"Orecchia","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Sushant","family":"Sachdeva","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_3_1","first-page":"651","volume-title":"SODA'08: Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms, SODA '08","author":"Andersen R.","year":"2008"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536449"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"R. Bhatia. Matrix Analysis (Graduate Texts in Mathematics). Springer 1996. R. Bhatia. Matrix Analysis (Graduate Texts in Mathematics). Springer 1996.","DOI":"10.1007\/978-1-4612-0653-8"},{"key":"e_1_3_2_2_8_1","volume-title":"McGraw-Hill","author":"Cheney E. W.","year":"1966"},{"key":"e_1_3_2_2_9_1","volume-title":"Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92)","author":"Chung F. R.","year":"1997"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0504057"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/040605461"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142995280572"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496915_12"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/090762671"},{"key":"e_1_3_2_2_15_1","volume-title":"Department of Computer Science","author":"Kale S.","year":"2007"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796585"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132574"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.30"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"L. Orecchia S. Sachdeva and N. K. Vishnoi. Approximating the exponential the lanczos method and an ~O(m)-time spectral algorithm for balanced separator. CoRR abs\/1111.1491 2011. L. Orecchia S. Sachdeva and N. K. Vishnoi. Approximating the exponential the lanczos method and an ~O(m)-time spectral algorithm for balanced separator. CoRR abs\/1111.1491 2011.","DOI":"10.1145\/2213977.2214080"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374442"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133078"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301389"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"E. Parzen. Stochastic Processes. Society for Industrial and Applied Mathematics 1999. E. Parzen. Stochastic Processes. Society for Industrial and Applied Mathematics 1999.","DOI":"10.1137\/1.9781611971125"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0729014"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(73)90097-X"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01399420"},{"key":"e_1_3_2_2_29_1","volume-title":"Morgan Kaufmann Publishers Inc.","author":"Schloegel K.","year":"2003"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.66"},{"key":"e_1_3_2_2_31_1","unstructured":"J. Shewchuk. An introduction to the conjugate gradient method without the agonizing pain. 1994. http:\/\/www.cs.cmu.edu\/ quake-papers\/painless-conjugate-gradient.pdf. J. Shewchuk. An introduction to the conjugate gradient method without the agonizing pain. 1994. http:\/\/www.cs.cmu.edu\/ quake-papers\/painless-conjugate-gradient.pdf."},{"key":"e_1_3_2_2_32_1","volume-title":"PWS Publishing Co.","author":"Shmoys D. B.","year":"1997"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_2_34_1","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_2_35_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_2_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/11.3.361"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214080","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":36,"alternative-id":["10.1145\/2213977.2214080","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214080","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}