Entry Kao:1996:CTA from ijhsc.bib
Last update: Sun Oct 15 02:21:07 MDT 2017
Top |
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{Kao:1996:CTA,
author = "T-W Kao and S-J Horng and Y-H Guo",
title = "Constant Time Algorithms for Graph Connectivity
Problems on Reconfigurable Meshes Using fewer
Processors",
journal = j-INT-J-HIGH-SPEED-COMPUTING,
volume = "8",
number = "4",
pages = "371--386",
year = "1996",
CODEN = "IHSCEZ",
ISSN = "0129-0533",
ISSN-L = "0129-0533",
bibdate = "Mon Feb 25 11:19:22 MST 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/ijhsc.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Speed Computing
(IJHSC)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijhsc",
}
Related entries
- algorithm,
2(1)85,
2(2)181,
2(3)265,
3(1)31,
4(1)43,
4(2)109,
4(3)213,
6(2)183,
6(3)375,
6(3)451,
6(4)501,
6(4)537,
7(1)73,
7(2)231,
7(2)285,
7(3)391,
7(3)407,
7(4)547,
7(4)595,
8(1)1,
8(1)81,
8(4)307,
8(4)347,
8(4)363,
9(1)13,
9(1)57,
9(2)101,
9(4)259,
9(4)291,
10(3)275,
10(4)399,
11(2)75,
11(3)151,
11(4)215,
12(1)29
- Constant,
6(4)501,
10(2)153
- fewer,
7(4)515
- graph,
5(2)171,
5(3)327,
8(3)271,
10(3)327
- Horng, S-J,
8(4)307
- Mesh,
6(2)311,
7(3)407,
9(1)25,
9(1)41,
9(2)101,
9(4)337
- problem,
4(1)43,
4(2)109,
4(4)289,
7(4)595,
8(1)65,
8(4)363,
9(1)1,
10(3)257
- processors,
4(4)301,
5(3)327,
7(1)45,
7(4)515,
10(1)115,
10(4)427
- Reconfigurable,
6(2)311,
9(1)25
- time,
6(4)501,
7(3)351,
11(3)129
- using,
5(2)171,
5(3)327,
7(3)327,
7(3)351,
7(4)515,
8(4)347,
9(1)25,
9(2)161,
9(3)191,
9(4)311,
11(1)1