Entry Shatnawi:2002:OSD from compj2000.bib
Last update: Sun Mar 31 02:13:37 MDT 2019
Top |
Symbols |
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{Shatnawi:2002:OSD,
author = "Ali Shatnawi and M. O. Ahmad and M. N. S. Swamy",
title = "Optimal Scheduling of Digital Signal Processing
Data-flow Graphs using Shortest-path Algorithms",
journal = j-COMP-J,
volume = "45",
number = "1",
pages = "88--100",
month = "????",
year = "2002",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/45.1.88",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Jan 16 08:49:27 MST 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_01/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_01/450088.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_01/pdf/450088.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
Related entries
- algorithm,
0(0)xii--274,
0(0)xii--304,
0(0)xvii--325,
0(0)x--295,
43(1)81,
43(2)152,
43(4)315,
43(6)482,
44(2)101,
44(3)214,
44(4)292,
44(4)303,
45(2)174,
45(2)237,
45(3)304,
45(4)423,
45(5)525,
45(5)561,
46(4)391,
46(4)401,
46(4)427,
46(5)498,
46(6)645,
46(6)680,
47(5)602,
47(6)694,
47(6)701,
48(2)220,
48(3)300,
48(4)443,
48(6)650,
48(6)737,
48(6)749,
49(1)42,
49(1)108,
49(2)201,
49(2)249,
49(2)252,
49(3)351,
49(3)358,
49(4)418,
49(5)629,
49(6)762,
50(3)332,
50(3)348,
50(4)435,
50(4)473,
50(6)728,
51(1)7,
51(1)26,
51(1)60,
51(1)79,
51(1)122,
51(1)137,
51(3)303,
51(4)451,
51(4)470,
51(6)688,
52(1)90,
52(2)268,
52(6)656,
52(6)690,
1008(0)363
- digital,
46(6)645,
47(4)399,
48(5)514,
49(1)82,
50(3)274
- graph,
43(1)1,
44(3)186,
44(5)425,
44(6)486,
45(6)631,
47(1)71,
47(1)85,
47(2)193,
50(3)357,
51(3)255
- optimal,
44(5)329,
47(5)527,
47(5)602,
49(1)82,
50(3)332,
52(1)31,
52(2)268,
52(6)646
- processing,
0(0)xii--350,
0(0)xxiii--703,
0(0)xxv--672,
0(0)xxxi--332,
43(4)325,
44(5)384,
44(6)486,
46(6)625,
47(2)205,
47(2)271,
49(2)252,
49(3)281,
50(2)217,
51(5)561,
51(6)662
- Scheduling,
43(2)152,
44(3)163,
45(4)395,
47(5)560,
48(3)259,
48(3)300,
48(3)369,
49(6)731,
51(2)216
- using,
43(2)130,
44(4)230,
44(4)246,
45(1)72,
45(4)381,
45(4)410,
45(4)423,
45(6)631,
45(6)645,
46(1)100,
46(4)401,
46(4)427,
46(5)498,
47(1)71,
47(3)373,
48(1)84,
48(2)200,
48(2)220,
48(3)333,
48(3)369,
49(2)137,
49(2)180,
49(2)234,
49(4)400,
49(6)634,
49(6)710,
50(5)535,
50(6)674,
51(2)227,
51(4)435,
51(4)470,
52(1)31,
52(1)64,
52(2)171,
52(5)557,
52(6)724