Michael B. Cohen. Ramanujan Graphs in Polynomial Time. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. pages 276-281, IEEE, 2016. [doi]
@inproceedings{Cohen16a-0, title = {Ramanujan Graphs in Polynomial Time}, author = {Michael B. Cohen}, year = {2016}, doi = {10.1109/FOCS.2016.37}, url = {http://dx.doi.org/10.1109/FOCS.2016.37}, researchr = {https://researchr.org/publication/Cohen16a-0}, cites = {0}, citedby = {0}, pages = {276-281}, booktitle = {IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA}, editor = {Irit Dinur}, publisher = {IEEE}, isbn = {978-1-5090-3933-3}, }