Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Er:1985:EOT,
author = "M. C. Er",
title = "Enumerating Ordered Trees Lexicographically",
journal = j-COMP-J,
volume = "28",
number = "5",
pages = "538--542",
month = nov,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.5.538",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:19 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/5.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/",
URL = "http://comjnl.oxfordjournals.org/content/28/5/538.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/538.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/539.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/540.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/541.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/542.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Western Australia, Dep of Computer Science,
Nedlands, Aust",
affiliationaddress = "Univ of Western Australia, Dep of Computer
Science, Nedlands, Aust",
classcodes = "C1160 (Combinatorial mathematics)",
classification = "723; 921",
corpsource = "Dept. of Comput. Sci., Western Australia Univ.,
Nedlands, WA, Australia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming --- Algorithms; enumerating;
feasible binary bit-; lexicographic enumeration;
lexicographically; mathematical techniques; ordered
trees; patterns; ranking; Trees; trees (mathematics);
unranking",
treatment = "T Theoretical or Mathematical",
}