Descendants in heap ordered trees or a triumph of computer algebra.
The Electronic Journal of Combinatorics [electronic only] (1996)
- Volume: 3, Issue: 1, page Research paper R29, 9 p.-Research paper R29, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topProdinger, Helmut. "Descendants in heap ordered trees or a triumph of computer algebra.." The Electronic Journal of Combinatorics [electronic only] 3.1 (1996): Research paper R29, 9 p.-Research paper R29, 9 p.. <http://eudml.org/doc/119229>.
@article{Prodinger1996,
author = {Prodinger, Helmut},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {heap ordered tree; planted plane tree; number of descendants},
language = {eng},
number = {1},
pages = {Research paper R29, 9 p.-Research paper R29, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Descendants in heap ordered trees or a triumph of computer algebra.},
url = {http://eudml.org/doc/119229},
volume = {3},
year = {1996},
}
TY - JOUR
AU - Prodinger, Helmut
TI - Descendants in heap ordered trees or a triumph of computer algebra.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1996
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 3
IS - 1
SP - Research paper R29, 9 p.
EP - Research paper R29, 9 p.
LA - eng
KW - heap ordered tree; planted plane tree; number of descendants
UR - http://eudml.org/doc/119229
ER -
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.