Entry Iliopoulos:1996:WTO from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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:1996:WTO,
author = "Costas S. Iliopoulos and Kunsoo Park",
title = "A work-time optimal algorithm for computing all string
covers",
journal = j-THEOR-COMP-SCI,
volume = "164",
number = "1--2",
pages = "299--310",
day = "10",
month = sep,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=164&issue=1-2&aid=2255",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., King's Coll., London, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "all-covers problem; computational complexity;
concatenations; CRCW PRAM algorithm; optimal algorithm;
parallel algorithms; regularity; repetitive structures;
string covers; string matching; time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- all,
141(1)163,
168(1)121,
180(1)169,
197(1)235,
221(1)77
- computing,
137(1)129,
138(1)211,
139(1)69,
141(1)1,
141(1)175,
147(1)181,
149(1)101,
155(1)157,
156(1)99,
156(1)217,
157(1)115,
161(1)69,
163(1)269,
164(1)107,
168(2)321,
169(1)67,
174(1)123,
180(1)115,
180(1)287,
181(1)159,
181(1)181,
181(1)195,
182(1)159,
185(2)259,
187(1)81,
187(1)87,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
190(1)61,
191(1)1,
192(2)315,
194(1)123,
194(1)225,
194(1)241,
194(1)242-1,
194(1)z,
195(1)3,
196(1)109,
196(1)153,
196(1)319,
197(1)79,
197(1)157,
197(1)171,
199(1)145,
209(1)331,
209(1)389
- concatenation,
127(2)287,
145(1)71,
155(2)291,
170(1)277,
186(1)83
- cover,
142(2)299,
145(1)111,
147(1)267,
149(1)129,
158(1)117,
166(1)221,
174(1)23,
187(1)167,
205(1)85,
225(1)113,
225(1)163
- CRCW,
143(2)309,
147(1)249,
154(2)225,
155(2)411,
164(1)1,
174(1)193,
175(2)393,
188(1)221,
205(1)231
- Iliopoulos, Costas S.,
172(1)281,
218(1)205
- matching,
137(2)269,
141(1)53,
145(1)111,
145(1)381,
147(1)19,
154(2)203,
154(2)225,
155(2)321,
156(1)217,
158(1)177,
159(1)105,
160(1)217,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
172(1)281,
173(2)349,
177(2)425,
178(1)129,
180(1)115,
180(1)203,
181(1)159,
185(2)347,
191(1)205,
197(1)247-2,
198(1)1,
201(1)263,
201(1)281,
212(1)101,
220(2)469
- optimal,
143(1)73,
143(1)123,
145(1)27,
147(1)1,
154(2)283,
154(2)367,
156(1)177,
157(2)161,
157(2)215,
159(2)191,
162(2)323,
163(1)239,
164(1)107,
165(2)441,
166(1)221,
168(2)367,
172(1)265,
174(1)193,
178(1)225,
180(1)243,
180(1)309,
182(1)217,
185(2)347,
188(1)1,
188(1)221,
196(1)3,
196(1)395,
197(1)189,
197(1)203,
197(1)242-2,
200(1)261,
203(2)205,
205(1)243,
210(2)341,
215(1)69,
220(2)363,
221(1)119,
222(1)113,
225(1)163,
227(1)79
- Park, Kunsoo,
201(1)263
- PRAM,
143(2)309,
147(1)1,
147(1)249,
154(2)225,
155(2)349,
158(1)1,
162(2)245,
163(1)211,
164(1)1,
164(1)107,
168(1)121,
169(1)67,
172(1)1,
174(1)193,
175(2)393,
178(1)225,
179(1)381,
180(1)169,
180(1)287,
181(2)267,
188(1)221,
194(1)225,
196(1)3,
196(1)109,
205(1)231
- regularity,
147(1)87,
178(1)77,
207(1)43
- string,
137(2)269,
141(1)53,
141(1)163,
143(1)113,
145(1)357,
147(1)19,
154(2)203,
154(2)225,
155(2)425,
155(2)447,
158(1)177,
161(1)1,
161(1)123,
161(1)289,
163(1)117,
164(1)73,
172(1)281,
178(1)129,
180(1)203,
181(1)159,
191(1)205,
191(1)219,
194(1)87,
211(1)339,
218(1)205