pdfformat: 

@InProceedings{daitch_et_al:DagSemProc.09061.3, author = {Daitch, Samuel I. and Spielman, Daniel A.}, title = {{A NearlyLinear Time Algorithm for Approximately Solving Linear Systems in a Symmetric MMatrix}}, booktitle = {Combinatorial Scientific Computing}, pages = {14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {18624405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2009/2080}, URN = {urn:nbn:de:0030drops20803}, doi = {10.4230/DagSemProc.09061.3}, annote = {Keywords: Mmatrix, diagonallydominant matrix, linear system solver, iterative algorithm, randomized algorithm, network flow, gain graph} }
Keywords:  Mmatrix, diagonallydominant matrix, linear system solver, iterative algorithm, randomized algorithm, network flow, gain graph  
Seminar:  09061  Combinatorial Scientific Computing  
Issue date:  2009  
Date of publication:  24.07.2009 