Entry Iliopoulos:1992:OAC from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Iliopoulos:1992:OAC,
author = "C. S. Iliopoulos and W. F. Smyth",
title = "Optimal algorithms for computing the canonical form of
a circular string",
journal = j-THEOR-COMP-SCI,
volume = "92",
number = "1",
pages = "87--105",
day = "06",
month = jan,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
conflocation = "Paris, France; July 1990",
conftitle = "Combinatorial Pattern Matching School",
corpsource = "Dept. of Comput. Sci., R. Holloway Coll., London
Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "canonical form; circular string; computational
complexity; least lexicographic rotation; logarithmic
running time; O(log n) time CRCW PRAM algorithm;
optimal algorithms; parallel algorithms; random-access
storage; space complexity; unbounded alphabets",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- access, random-,
71(1)3,
100(1)1,
116(2)421,
123(2)415,
128(1)3
- alphabet,
71(3)381,
73(1)81,
73(3)279,
73(3)335,
76(2)261,
79(1)195,
81(1)147,
81(2)289,
83(2)287,
88(1)117,
92(1)33,
92(1)77,
92(1)145,
95(2)187,
108(2)311,
108(2)345,
108(2)365,
113(1)35,
115(2)243,
115(2)359,
118(1)49,
123(1)61,
127(1)53,
131(2)311,
132(1)71,
132(1)415,
134(1)87,
134(1)209,
134(1)225,
134(2)329
- C4240P,
88(1)59,
88(2)191,
90(1)127,
90(1)151,
90(1)171,
90(1)185,
91(1)1,
91(2)129,
91(2)205,
91(2)239,
92(1)3,
92(1)19,
92(1)33,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
92(2)301,
92(2)309,
92(2)319,
93(2)169,
93(2)245,
94(1)141,
94(2)237,
94(2)335,
95(1)169,
95(2)207,
95(2)231,
95(2)245,
95(2)323,
96(1)157,
96(1)217,
96(2)305,
96(2)345,
96(2)411,
97(1)1,
97(1)67,
97(1)105,
97(1)131,
98(2)249,
98(2)263,
99(2)279,
99(2)335,
100(1)1,
100(1)45,
100(1)105,
100(1)157,
100(1)185,
100(1)205,
100(1)253,
100(2)365,
101(1)133,
101(2)177,
101(2)289,
101(2)337,
102(1)1,
102(1)135,
102(1)165,
102(1)185,
102(2)355,
104(2)207,
104(2)285,
106(2)361,
107(1)77,
108(2)291,
108(2)331,
112(1)5,
114(1)31,
114(1)63,
114(1)119,
114(1)173,
114(1)z,
120(2)261,
120(2)303,
125(1)3,
125(2)373,
127(1)53,
127(1)99,
127(1)123,
127(1)181,
128(1)75,
129(2)293,
130(1)49,
130(1)175,
131(1)139,
132(1)403,
134(2)493,
135(1)5,
135(2)171,
135(2)289,
135(2)377,
136(2)527
- canonical,
70(1)151,
75(1)85,
81(2)169,
92(1)z,
98(1)115,
99(2)213,
110(2)419,
111(1)191,
114(2)299,
119(1)145,
129(2)263,
129(2)407,
131(2)271
- circular,
92(1)z,
102(2)253,
129(2)293
- computing,
73(1)1,
76(2)309,
79(1)195,
79(1)209,
79(1)241,
79(2)323,
81(2)169,
81(2)201,
86(2)143,
86(2)325,
92(1)3,
92(2)291,
95(2)263,
96(1)175,
98(2)249,
100(1)253,
109(1)3,
109(1)z,
115(2)191,
119(1)215,
125(2)373,
128(1)99,
128(1)127,
128(1)159,
128(1)179,
128(1)241,
129(2)279,
133(1)35
- CRCW,
93(2)245,
99(2)335,
123(2)415,
127(1)53,
129(2)293,
132(1)403
- form,
73(2)231,
79(1)227,
81(2)305,
82(1)95,
83(2)219,
87(2)287,
92(1)z,
93(1)91,
94(2)199,
95(2)339,
97(1)105,
97(2)233,
98(1)115,
102(2)307,
104(1)3,
107(2)253,
112(2)277,
116(1)59,
119(1)145,
120(2)197,
121(1)71,
123(2)199,
133(2)387
- Iliopoulos, C. S.,
127(1)53
- least,
70(1)65,
70(2)233,
75(1)45,
75(1)85,
75(1)139,
76(2)309,
121(1)411,
131(1)95,
131(1)121
- lexicographic,
105(1)129,
129(2)293
- logarithmic,
84(2)225,
86(2)267,
99(2)279,
116(2)421,
123(2)389
- n,
108(1)45,
120(2)215,
132(1)1
- optimal,
71(3)401,
74(1)95,
74(2)183,
76(1)93,
76(2)331,
77(3)291,
80(1)105,
81(2)257,
82(1)113,
82(1)157,
84(1)127,
84(2)179,
85(1)155,
86(2)365,
87(2)251,
92(1)33,
92(1)z,
93(2)245,
106(2)361,
108(2)271,
111(1)191,
115(2)351,
119(2)355,
120(2)197,
120(2)261,
123(2)377,
125(1)91,
127(2)395,
128(1)179,
129(2)323,
130(1)17,
132(1)403,
134(2)263,
134(2)559
- PRAM,
73(3)319,
81(2)311,
86(2)243,
87(2)251,
91(1)1,
93(2)245,
95(2)323,
99(2)335,
100(1)1,
106(2)361,
107(1)121,
116(2)421,
127(1)53,
128(1)3,
129(2)293,
132(1)403,
134(2)493
- random-access,
71(1)3,
100(1)1,
116(2)421,
123(2)415,
128(1)3
- running,
71(1)95,
76(2)323,
82(1)165,
92(1)19,
130(1)49,
134(1)63
- Smyth, W. F.,
127(1)53
- space,
70(1)159,
70(2)233,
71(3)347,
73(1)1,
74(1)115,
74(2)183,
74(3)273,
75(1)15,
75(1)85,
76(2)179,
77(3)221,
80(2)289,
82(1)1,
82(1)165,
85(2)353,
86(1)3,
87(1)1,
87(1)43,
88(1)83,
91(1)1,
92(1)3,
92(1)33,
93(1)143,
93(2)201,
94(2)175,
95(2)231,
95(2)245,
96(1)157,
96(1)z,
96(2)411,
97(2)183,
99(1)121,
101(1)99,
101(2)239,
103(2)283,
110(1)99,
111(1)89,
111(1)103,
111(1)191,
111(1)z,
113(2)191,
114(2)273,
119(1)63,
123(1)139,
124(1)1,
124(2)195,
124(2)343,
125(2)295,
125(2)345,
125(2)355,
127(1)171,
127(2)199,
129(2)397,
130(1)85,
130(1)203,
132(1)319,
133(1)49,
134(1)131,
134(2)529,
135(2)171
- storage,
71(1)3,
81(2)201,
100(1)1,
111(1)3,
116(2)421,
120(2)311,
123(2)415,
128(1)3,
128(1)211,
129(1)79,
130(1)85,
131(1)29,
133(2)421
- string,
73(3)319,
73(3)329,
78(2)363,
81(2)189,
82(1)35,
83(2)287,
84(2)293,
86(2)325,
88(1)59,
92(1)3,
92(1)19,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
92(2)249,
93(2)265,
107(1)121,
107(2)333,
112(2)383,
119(2)247,
119(2)363,
126(1)77,
129(2)293,
129(2)337,
131(2)295,
134(2)473,
135(2)345
- unbounded,
74(3)313,
78(2)357,
85(1)155,
93(2)265,
99(1)105,
100(2)365,
104(1)109,
116(2)415,
124(2)273,
125(1)91,
127(1)53