@inproceedings{5566f5e3e41444d088e66054b13a938a,
title = "A comparison of well-quasi orders on trees",
keywords = "Computer Science - Programming Languages, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, E.1, F.2.2, F.3.2",
author = "Mogensen, {Torben {\AE}gidius}",
note = "David A. Schmidt{\textquoteright}s 60th Birthday Festschrift",
year = "2013",
doi = "10.4204/EPTCS.129.3",
language = "English",
series = "Electronic Proceedings in Theoretical Computer Science",
publisher = "Open Publishing Association",
pages = "30--40",
editor = "Anindya Banerjee and Olivier Danvy and Kyung-Goo Doh and John Hatcliff",
booktitle = "Semantics, Abstract Interpretation, and Reasoning about Programs",
}