Standard
A comparison of well-quasi orders on trees. / Mogensen, Torben Ægidius.
Semantics, Abstract Interpretation, and Reasoning about Programs: essays dedicated to David A. Schmidt on the occasion of his sixtieth birthday, Manhattan, Kansas, USA, 19-20th September 2013. ed. / Anindya Banerjee; Olivier Danvy; Kyung-Goo Doh; John Hatcliff. 2013. p. 30-40 (Electronic Proceedings in Theoretical Computer Science, Vol. 129).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research
Harvard
Mogensen, TÆ 2013,
A comparison of well-quasi orders on trees. in A Banerjee, O Danvy, K-G Doh & J Hatcliff (eds),
Semantics, Abstract Interpretation, and Reasoning about Programs: essays dedicated to David A. Schmidt on the occasion of his sixtieth birthday, Manhattan, Kansas, USA, 19-20th September 2013. Electronic Proceedings in Theoretical Computer Science, vol. 129, pp. 30-40.
https://doi.org/10.4204/EPTCS.129.3
APA
Mogensen, T. Æ. (2013).
A comparison of well-quasi orders on trees. In A. Banerjee, O. Danvy, K-G. Doh, & J. Hatcliff (Eds.),
Semantics, Abstract Interpretation, and Reasoning about Programs: essays dedicated to David A. Schmidt on the occasion of his sixtieth birthday, Manhattan, Kansas, USA, 19-20th September 2013 (pp. 30-40). Electronic Proceedings in Theoretical Computer Science Vol. 129
https://doi.org/10.4204/EPTCS.129.3
Vancouver
Mogensen TÆ.
A comparison of well-quasi orders on trees. In Banerjee A, Danvy O, Doh K-G, Hatcliff J, editors, Semantics, Abstract Interpretation, and Reasoning about Programs: essays dedicated to David A. Schmidt on the occasion of his sixtieth birthday, Manhattan, Kansas, USA, 19-20th September 2013. 2013. p. 30-40. (Electronic Proceedings in Theoretical Computer Science, Vol. 129).
https://doi.org/10.4204/EPTCS.129.3
Author
Mogensen, Torben Ægidius. / A comparison of well-quasi orders on trees. Semantics, Abstract Interpretation, and Reasoning about Programs: essays dedicated to David A. Schmidt on the occasion of his sixtieth birthday, Manhattan, Kansas, USA, 19-20th September 2013. editor / Anindya Banerjee ; Olivier Danvy ; Kyung-Goo Doh ; John Hatcliff. 2013. pp. 30-40 (Electronic Proceedings in Theoretical Computer Science, Vol. 129).
Bibtex
@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",
}
RIS
TY - GEN
T1 - A comparison of well-quasi orders on trees
AU - Mogensen, Torben Ægidius
N1 - David A. Schmidt’s 60th Birthday Festschrift
PY - 2013
Y1 - 2013
KW - Computer Science - Programming Languages, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, E.1, F.2.2, F.3.2
U2 - 10.4204/EPTCS.129.3
DO - 10.4204/EPTCS.129.3
M3 - Article in proceedings
T3 - Electronic Proceedings in Theoretical Computer Science
SP - 30
EP - 40
BT - Semantics, Abstract Interpretation, and Reasoning about Programs
A2 - Banerjee, Anindya
A2 - Danvy, Olivier
A2 - Doh, Kyung-Goo
A2 - Hatcliff, John
ER -