Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Er:1989:CAP,
author = "M. C. Er",
title = "Classes of admissible permutations that are
generatable by depth-first traversals of ordered
trees",
journal = j-COMP-J,
volume = "32",
number = "1",
pages = "76--85",
month = feb,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.1.76",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "05C05 (05A05 68R05)",
MRnumber = "90m:05044",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/32/1/76.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/76.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/77.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/78.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/79.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/80.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/81.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/82.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/83.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/84.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/85.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Western Australia Univ.",
affiliationaddress = "Nedlands, Aust",
classcodes = "C4250 (Database theory); C1160 (Combinatorial
mathematics)",
classification = "723; 921; C1160 (Combinatorial mathematics); C4250
(Database theory)",
corpsource = "Dept. of Comput. Sci., Western Australia Univ.,
Nedlands, WA, Australia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Admissible permutations; Admissible Permutations;
admissible permutations; binary; Binary
representations, Data Processing; Complement mappings;
complement mappings; Data Structures; database theory;
Depth First Traversals; Depth-first traversals;
depth-first traversals; Inverse; inverse; Mathematical
Techniques--Trees; ordered; Ordered Trees; Ordered
trees; representations; Reverse; reverse; trees; trees
(mathematics)",
thesaurus = "Database theory; Trees [mathematics]",
treatment = "T Theoretical or Mathematical",
}