Entry Brandner:2014:RWC from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
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{Brandner:2014:RWC,
author = "Florian Brandner and Alexander Jordan",
title = "Refinement of worst-case execution time bounds by
graph pruning",
journal = j-COMP-LANGS-SYS-STRUCT,
volume = "40",
number = "3--4",
pages = "155--170",
month = oct # "\slash " # dec,
year = "2014",
CODEN = "????",
ISSN = "1477-8424 (print), 1873-6866 (electronic)",
ISSN-L = "1477-8424",
bibdate = "Mon Nov 24 14:58:53 MST 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/complngs.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1477842414000359",
acknowledgement = ack-nhfb,
fjournal = "Computer Languages, Systems and Structures",
journal-URL = "http://www.sciencedirect.com/science/journal/14778424/",
}
Related entries
- bound,
15(2)83
- Brandner, Florian,
39(1)25
- case, worst-,
16(1)65
- execution,
1(1)17,
9(3)183,
12(2)95,
14(1)1,
14(4)263,
16(1)65,
18(1)17,
18(3)197,
19(1)41,
19(3)185,
19(4)235,
20(1)53,
20(4)253,
22(2)115,
22(2)143,
22(2)165,
22(2)181,
22(4)193,
23(2)87,
25(3)119,
36(2)158,
43(z)116,
44(z)48,
53(z)121,
54(z)406
- graph,
1(3)255,
3(1)37,
3(2)65,
3(2)115,
3(3)163,
5(1)29,
5(2)115,
6(1)19,
6(1)47,
7(1)41,
7(3)147,
8(1)27,
8(2)69,
9(3)203,
10(1)43,
15(2)65,
19(2)91,
19(2)135,
19(3)169,
19(3)205,
21(2)101,
21(2)113,
36(1)96,
39(1)25
- refinement,
33(3)134,
47(z)2,
47(z)170
- time,
1(1)17,
2(1)27,
3(3)163,
5(3)155,
7(2)53,
11(1)39,
12(1)39,
13(1)23,
14(1)1,
14(2)125,
15(1)27,
15(3)153,
15(3)177,
16(1)19,
16(1)39,
16(1)65,
16(2)113,
17(3)185,
18(2)77,
18(4)241,
19(1)41,
19(2)105,
20(1)1,
20(1)25,
20(1)43,
20(2)89,
20(3)151,
20(3)193,
20(4)239,
21(2)81,
21(3)129,
22(1)39,
23(2)87,
25(1)39
- worst-case,
16(1)65