Entry Knoop:1998:EPD 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{Knoop:1998:EPD,
author = "Jens Knoop",
title = "Eliminating partially dead code in explicitly parallel
programs",
journal = j-THEOR-COMP-SCI,
volume = "196",
number = "1--2",
pages = "365--393",
day = "06",
month = apr,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=196&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/196/1-2/2744.pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Fachbereich Inf., Oldenburg Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; data flow analyses;
interleaving; optimisation; optimization; parallel
programming; parallel programs; partially dead code;
shared memory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
197(1)245-2
- code,
141(1)1,
144(1)161,
145(1)345,
147(1)165,
148(2)227,
148(2)325,
154(2)283,
155(2)425,
159(1)103,
160(1)145,
162(2)297,
163(1)145,
163(1)259,
164(1)223,
165(2)407,
172(1)309,
176(1)337,
181(2)337,
182(1)245,
183(1)3,
187(1)231,
188(1)231,
191(1)117,
192(2)201,
196(1)347,
197(1)246,
204(1)11,
215(1)345,
218(1)107
- flow,
141(1)1,
148(1)93,
148(1)165,
151(1)195,
159(2)191,
167(1)131,
168(2)367,
179(1)203,
195(1)3,
196(1)201,
199(1)167
- interleaving,
154(1)107,
155(1)39,
161(1)109,
170(1)297,
198(1)159,
206(1)219
- memory,
140(1)179,
143(1)73,
147(1)1,
149(2)257,
155(2)349,
162(2)245,
165(2)311,
168(2)303,
175(2)393,
180(1)341,
181(1)75,
186(1)199,
196(1)3,
196(1)109,
196(1)215
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
207(1)203,
209(1)107,
227(1)299
- partially,
138(2)425,
145(1)147,
157(2)161,
160(1)87,
163(1)1,
171(1)247,
175(2)225,
220(1)185
- shared,
149(1)179,
149(2)257,
155(2)349,
162(2)245,
186(1)199,
189(1)179,
192(2)259,
193(1)97,
196(1)3,
196(1)215