%0 Conference Paper %1 conf/stoc/SpielmanT04 %A Spielman, Daniel A. %A Teng, Shang-Hua %B STOC %D 2004 %E Babai, László %I ACM %K dblp %P 81-90 %T Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. %U http://dblp.uni-trier.de/db/conf/stoc/stoc2004.html#SpielmanT04 %@ 1-58113-852-0

@inproceedings{conf/stoc/SpielmanT04, added-at = {2018-11-06T00:00:00.000+0100}, author = {Spielman, Daniel A. and Teng, Shang-Hua}, biburl = {https://www.bibsonomy.org/bibtex/204ed0435cfbe20125097edb69f84a07a/dblp}, booktitle = {STOC}, crossref = {conf/stoc/2004}, editor = {Babai, László}, ee = {https://doi.org/10.1145/1007352.1007372}, interhash = {e3e50ce848e6c32139bae43235db3c7f}, intrahash = {04ed0435cfbe20125097edb69f84a07a}, isbn = {1-58113-852-0}, keywords = {dblp}, pages = {81-90}, publisher = {ACM}, timestamp = {2018-11-07T16:09:08.000+0100}, title = {Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2004.html#SpielmanT04}, year = 2004 }