Binary Trees and (Maximal) Order Types

DOI10.1007/978-3-540-73001-9_48MaRDI QIDQ5425348zbMATH OpenOpenAlexFDO

Authors Gyesik Lee

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_48

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Recommendations

• Calculating maximal order types for finite rooted unstructured labeled trees
• Well-partial orderings and their maximal order types
• New Computational Paradigms
• An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy
• scientific article; zbMATH DE number 1456949

Cited in

(8)

• Optimal binary trees with order constraints
• Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
• Ordered trees and the inorder traversal
• Red-black trees with types
• Counting embeddings of a chain into a binary tree.
• scientific article; zbMATH DE number 1223728 (Why is no real title available?)
• Calculating maximal order types for finite rooted unstructured labeled trees
• scientific article; zbMATH DE number 5279360 (Why is no real title available?)

This page was built for publication: Binary Trees and (Maximal) Order Types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425348)