Entry Skarbek:1988:GOT from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Skarbek:1988:GOT,
author = "Wladyslaw Skarbek",
title = "Generating ordered trees",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "153--159",
month = apr,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Alfateh Univ",
affiliationaddress = "Tripoli, Libya",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conference = "International Symposium on Mathematical Foundations of
Computer Science, MFCS '86",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Comput. Sci., Alfateh Univ., Tripoli, Libya",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; combinatorial mathematics; Computer
Programming; Lexicographic Order; Mathematical
Techniques --- Trees; nonrecursive algorithm; Ordered
Trees; ordered trees generation; path compression; Tree
Generation; Tree Transformation; trees (mathematics)",
meetingaddress = "Bratislava, Czech",
meetingdate = "Aug 25--29 1986",
meetingdate2 = "08/25--29/86",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
Related entries
- B0250,
36(2)319,
38(1)123,
38(2)249,
38(2)293,
38(2)343,
40(2)329,
41(2)141,
41(2)185,
41(2)325,
43(1)99,
45(3)261,
48(1)95,
53(2)201,
53(2)281,
54(2)181,
54(2)215,
54(2)237,
54(2)341,
55(1)87,
56(2)223,
56(2)233,
58(1)103,
58(1)209,
58(1)325,
61(2)175,
61(2)307,
61(2)317,
64(1)25,
64(1)67,
64(1)97,
64(1)119,
65(2)149,
65(2)153,
68(1)89
- compression,
53(2)295,
57(1)131
- generating,
38(1)99,
44(2)209,
49(2)283,
61(2)279,
66(3)341,
68(3)239
- generation,
37(2)151,
43(2)169,
44(2)209,
52(1)91,
56(1)59,
60(3)255,
65(2)143,
66(3)289,
68(2)175
- lexicographic,
38(1)83,
63(1)91
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- nonrecursive,
51(3)265
- order,
38(1)83,
40(2)323,
41(1)81,
49(1)1,
52(3)193,
55(1)87,
59(3)297,
60(1)1,
61(2)199,
63(2)113,
64(3)281,
66(1)1,
66(3)299,
68(1)37,
68(3)333
- ordered,
39(2)337,
40(2)163,
49(2)145,
57(0)3,
60(3)255,
64(3)281
- path,
36(1)27,
37(1)77,
40(2)257,
40(2)323,
43(2)213,
48(2)273,
57(1)131,
58(1)103,
68(1)1,
68(2)155
- technique,
39(2)319,
40(1)67,
40(2)101,
45(1)87,
46(2)261,
48(1)75,
49(1)81,
49(2)171,
50(2)137,
50(3)323,
51(1)53,
52(3)193,
53(2)169,
53(2)281,
54(1)53,
54(1)87,
54(1)129,
54(2)315,
57(0)3,
57(1)97,
57(1)131,
57(1)147,
58(1)103,
58(1)209,
59(1)157,
59(3)297,
61(2)299,
63(3)275,
63(3)295,
64(1)107,
64(2)135,
64(2)175,
65(1)1,
65(2)123,
65(2)131,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
66(0)117,
66(1)45,
66(2)137,
67(1)5,
67(1)37,
67(1)87,
68(3)267,
69(1)1
- transformation,
36(1)27,
37(2)183,
42(1)1,
43(2)123,
46(2)261,
49(1)23,
53(1)151,
60(3)231,
62(1)3,
65(2)243,
65(2)z,
67(1)55,
67(2)203,
68(2)175,
68(3)239