@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2017.61,
author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Nowak, Martin A.},
title = {{Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {61:1--61:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.61},
URN = {urn:nbn:de:0030-drops-81213},
doi = {10.4230/LIPIcs.MFCS.2017.61},
annote = {Keywords: Graph algorithms, Evolutionary biology, Monte-Carlo algorithms}
}