![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/stoc/SpielmanT04
@inproceedings{DBLP:conf/stoc/SpielmanT04, author = {Daniel A. Spielman and Shang{-}Hua Teng}, editor = {L{\'{a}}szl{\'{o}} Babai}, title = {Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems}, booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004}, pages = {81--90}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1007352.1007372}, doi = {10.1145/1007352.1007372}, timestamp = {Tue, 06 Nov 2018 11:07:06 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SpielmanT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.