@InProceedings{datta_et_al:LIPIcs.OPODIS.2015.16,
author = {Datta, Ajoy K. and Larmore, Lawrence L. and Masuzawa, Toshimitsu},
title = {{Maximum Matching for Anonymous Trees with Constant Space per Process}},
booktitle = {19th International Conference on Principles of Distributed Systems (OPODIS 2015)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-98-9},
ISSN = {1868-8969},
year = {2016},
volume = {46},
editor = {Anceaume, Emmanuelle and Cachin, Christian and Potop-Butucaru, Maria},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2015.16},
URN = {urn:nbn:de:0030-drops-66074},
doi = {10.4230/LIPIcs.OPODIS.2015.16},
annote = {Keywords: anonymous tree, maximum matching, self-stabilization, unfair daemon}
}