Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect matchings in o(::::n:::: log ::::n::::) time in regular bipartite graphs. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 39-46, ACM, 2010. [doi]
@inproceedings{GoelKK10-0,
title = {Perfect matchings in o(::::n:::: log ::::n::::) time in regular bipartite graphs},
author = {Ashish Goel and Michael Kapralov and Sanjeev Khanna},
year = {2010},
doi = {10.1145/1806689.1806696},
url = {http://doi.acm.org/10.1145/1806689.1806696},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GoelKK10-0},
cites = {0},
citedby = {0},
pages = {39-46},
booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
editor = {Leonard J. Schulman},
publisher = {ACM},
isbn = {978-1-4503-0050-6},
}