Enumeration of binary trees and universal types.
Knessl, Charles; Szpankowski, Wojciech
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2005)
- Volume: 7, Issue: 1, page 313-400
- ISSN: 1365-8050
Access Full Article
topHow to cite
topKnessl, Charles, and Szpankowski, Wojciech. "Enumeration of binary trees and universal types.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 7.1 (2005): 313-400. <http://eudml.org/doc/129515>.
@article{Knessl2005,
author = {Knessl, Charles, Szpankowski, Wojciech},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {binary unlabelled ordered trees; binary trees; graph enumeration; number of binary trees of given path length; universal type of sequences; parsings; distributions; number of nodes},
language = {eng},
number = {1},
pages = {313-400},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Enumeration of binary trees and universal types.},
url = {http://eudml.org/doc/129515},
volume = {7},
year = {2005},
}
TY - JOUR
AU - Knessl, Charles
AU - Szpankowski, Wojciech
TI - Enumeration of binary trees and universal types.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2005
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 7
IS - 1
SP - 313
EP - 400
LA - eng
KW - binary unlabelled ordered trees; binary trees; graph enumeration; number of binary trees of given path length; universal type of sequences; parsings; distributions; number of nodes
UR - http://eudml.org/doc/129515
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.