Entry Larmore:1998:AOS 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{Larmore:1998:AOS,
author = "Lawrence L. Larmore and Wojciech Rytter",
title = "Almost optimal sublinear time parallel recognition
algorithms for three subclasses of context free
languages",
journal = j-THEOR-COMP-SCI,
volume = "197",
number = "1--2",
pages = "189--201",
day = "15",
month = may,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=197&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/197/1-2/2789.pdf",
acknowledgement = ack-nhfb,
classification = "C1250B (Character recognition); C4210L (Formal
languages and computational linguistics); C4240P
(Parallel programming and algorithm theory)",
conftitle = "Linear Logic '96 (papers in summary form only
received)",
corpsource = "Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "almost optimal sublinear time parallel recognition
algorithms; character recognition; context free
languages; context-free languages; optimality; parallel
algorithms; sequential algorithm",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- almost,
141(1)337,
151(2)385,
164(1)29,
188(1)79,
221(1)77
- character,
163(1)117
- context,
141(1)329,
141(1)331,
145(1)357,
164(1)29,
164(1)123,
165(2)355,
192(2)201
- context-free,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)143,
158(1)161,
161(1)23,
161(1)141,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
168(2)321,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
202(1)231,
215(1)349
- free,
138(2)391,
141(1)331,
142(2)229,
145(1)229,
152(1)91,
153(1)271,
160(1)241,
163(1)55,
164(1)223,
165(2)325,
165(2)355,
168(1)105,
170(1)47,
175(2)393,
179(1)421,
183(1)83,
187(1)105,
191(1)117,
191(1)145,
192(1)107,
204(1)35,
204(1)131,
224(1)13,
224(1)157,
225(1)149
- free, context-,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)143,
158(1)161,
161(1)23,
161(1)141,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
168(2)321,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
202(1)231,
215(1)349
- Larmore, Lawrence L.,
180(1)309
- 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,
164(1)299,
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)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
- optimality,
168(2)367,
197(1)171
- recognition,
140(2)319,
143(1)73,
143(2)343,
145(1)329,
145(1)357,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
156(1)281,
160(1)217,
163(1)117,
163(1)303,
172(1)209,
173(2)349,
175(2)349,
175(2)393,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
180(1)269,
181(2)379,
201(1)99
- Rytter, Wojciech,
143(2)343,
147(1)19,
180(1)309,
205(1)243,
218(1)123,
218(1)197
- sequential,
138(2)243,
138(2)273,
138(2)315,
140(2)291,
152(2)219,
160(1)1,
162(2)297,
163(1)211,
165(1)75,
168(1)121,
169(1)39,
174(1)269,
177(1)3,
177(1)59,
177(2)329,
178(1)237,
179(1)61,
186(1)107,
191(1)131,
192(2)233,
192(2)259,
194(1)245,
196(1)71,
221(1)251
- subclass,
147(1)117,
153(1)271,
160(1)87,
161(1)205,
164(1)13
- sublinear,
196(1)131,
218(1)197
- three,
174(1)171,
176(1)347,
187(1)249,
218(1)83,
226(1)37