@InProceedings{barbay:LIPIcs.FUN.2016.5,
author = {Barbay, J\'{e}r\'{e}my},
title = {{Selenite Towers Move Faster Than Hano\"{i} Towers, But Still Require Exponential Time}},
booktitle = {8th International Conference on Fun with Algorithms (FUN 2016)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-005-7},
ISSN = {1868-8969},
year = {2016},
volume = {49},
editor = {Demaine, Erik D. and Grandoni, Fabrizio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.5},
URN = {urn:nbn:de:0030-drops-58729},
doi = {10.4230/LIPIcs.FUN.2016.5},
annote = {Keywords: Br\"{a}hma tower, Disk Pile, Hanoi Tower, Levitating Tower, Recursivity}
}