Entry Breslauer:1996:SCC 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{Breslauer:1996:SCC,
author = "Dany Breslauer",
title = "Saving comparisons in the {Crochemore-Perrin} string
matching algorithm",
journal = j-THEOR-COMP-SCI,
volume = "158",
number = "1--2",
pages = "177--192",
day = "20",
month = may,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&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=158&issue=1-2&aid=2006",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C4240C
(Computational complexity)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; linear-time constant-space;
pattern preprocessing step; string matching;
string-matching algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Breslauer, Dany,
137(2)269,
141(1)163,
191(1)131,
209(1)365
- comparison,
144(1)199,
163(1)117,
168(1)39,
180(1)115,
182(1)217,
202(1)231
- constant-space,
147(1)19,
218(1)197
- linear-time,
145(1)111,
145(1)329,
147(1)19,
154(2)165,
159(1)137,
163(1)309,
167(1)47,
181(1)57
- 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,
159(1)105,
160(1)217,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
164(1)299,
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
- matching, string-,
147(1)19,
218(1)197
- pattern,
137(1)25,
138(1)113,
140(2)319,
141(1)53,
141(1)253,
141(1)283,
145(1)1,
145(1)159,
145(1)329,
145(1)357,
147(1)19,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
155(2)349,
156(1)217,
160(1)217,
163(1)117,
163(1)303,
172(1)281,
173(2)349,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
181(2)379,
184(1)195,
185(1)47,
186(1)231,
192(1)3,
196(1)71,
197(1)171,
201(1)263,
205(1)243,
206(1)1
- preprocessing,
140(2)291,
147(1)19,
154(2)203,
163(1)117
- step,
140(1)73,
163(1)117,
172(1)303,
177(2)351,
190(2)115,
191(1)245,
194(1)241-3,
194(1)248-1
- 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,
161(1)1,
161(1)123,
161(1)289,
163(1)117,
164(1)73,
164(1)299,
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
- string-matching,
147(1)19,
218(1)197
- time, linear-,
145(1)111,
145(1)329,
147(1)19,
154(2)165,
159(1)137,
163(1)309,
167(1)47,
181(1)57