Christopher M. Homan, Lane A. Hemaspaandra. Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. In Rastislav Kralovic, Pawel Urzyczyn, editors, Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings. Volume 4162 of Lecture Notes in Computer Science, pages 528-539, Springer, 2006. [doi]
@inproceedings{HomanH06,
title = {Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners},
author = {Christopher M. Homan and Lane A. Hemaspaandra},
year = {2006},
doi = {10.1007/11821069_46},
url = {http://dx.doi.org/10.1007/11821069_46},
researchr = {https://researchr.org/publication/HomanH06},
cites = {0},
citedby = {0},
pages = {528-539},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings},
editor = {Rastislav Kralovic and Pawel Urzyczyn},
volume = {4162},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-37791-3},
}