@InProceedings{lapey_et_al:LIPIcs.ISAAC.2022.53,
author = {Lapey, Paul and Williams, Aaron},
title = {{Pop \& Push: Ordered Tree Iteration in 𝒪(1)-Time}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.53},
URN = {urn:nbn:de:0030-drops-173380},
doi = {10.4230/LIPIcs.ISAAC.2022.53},
annote = {Keywords: combinatorial generation, Gray code, simultaneous Gray code, ordered trees, plane trees, Dyck words, binary trees, Catalan objects, loopless algorithm, cool-lex order}
}