The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, December 11 until 2:00 AM ET on Friday, December 12 due to maintenance. We apologize for the inconvenience.
Explore Research Products in the PAR It may take a few hours for recently added research products to appear in PAR search results.
Anagnostides, Ioannis, Lenzen, Christoph, Haeupler, Bernhard, Zuzic, Goran, and Gouleakis, Themis. Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. Retrieved from https://par.nsf.gov/biblio/10359542. International Symposium on Distributed Computing .
@article{osti_10359542,
place = {Country unknown/Code not available},
title = {Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts},
url = {https://par.nsf.gov/biblio/10359542},
abstractNote = {},
journal = {International Symposium on Distributed Computing},
author = {Anagnostides, Ioannis and Lenzen, Christoph and Haeupler, Bernhard and Zuzic, Goran and Gouleakis, Themis},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.