Dean Doron, Amnon Ta-Shma. On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi 0001, Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Volume 9134 of Lecture Notes in Computer Science, pages 419-431, Springer, 2015. [doi]
@inproceedings{DoronT15,
title = {On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace},
author = {Dean Doron and Amnon Ta-Shma},
year = {2015},
doi = {10.1007/978-3-662-47672-7_34},
url = {http://dx.doi.org/10.1007/978-3-662-47672-7_34},
researchr = {https://researchr.org/publication/DoronT15},
cites = {0},
citedby = {0},
pages = {419-431},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I},
editor = {Magnús M. Halldórsson and Kazuo Iwama and Naoki Kobayashi 0001 and Bettina Speckmann},
volume = {9134},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-47671-0},
}