Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa. Maximum Matching for Anonymous Trees with Constant Space per Process. In Emmanuelle Anceaume, Christian Cachin, Maria Gradinariu Potop-Butucaru, editors, 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France. Volume 46 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{DattaLM15-0,
title = {Maximum Matching for Anonymous Trees with Constant Space per Process},
author = {Ajoy Kumar Datta and Lawrence L. Larmore and Toshimitsu Masuzawa},
year = {2015},
doi = {10.4230/LIPIcs.OPODIS.2015.16},
url = {http://dx.doi.org/10.4230/LIPIcs.OPODIS.2015.16},
researchr = {https://researchr.org/publication/DattaLM15-0},
cites = {0},
citedby = {0},
booktitle = {19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France},
editor = {Emmanuelle Anceaume and Christian Cachin and Maria Gradinariu Potop-Butucaru},
volume = {46},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-98-9},
}