Last update: Fri Jul 8 02:02:43 MDT 2005
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{Lingas:1997:SOP,
author = "Andrzej Lingas and Anil Maheshwari",
title = "A simple optimal parallel algorithm for reporting
paths in a tree",
journal = j-PARALLEL-PROCESS-LETT,
volume = "7",
number = "1",
pages = "3--11",
month = mar,
year = "1997",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Oct 21 18:27:39 MDT 1997",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden",
keywords = "computational complexity; distinct nodes; EREW PRAM;
exclusive read exclusive write parallel random-access
machine; input tree; n-node tree; optimal parallel
algorithm; parallel algorithms; reporting paths; tree
data structures",
pubcountry = "Singapore",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- access, random-,
4(1)159,
4(4)437,
6(4)451
- C4240C,
4(4)405,
4(4)417,
5(1)3,
5(1)23,
5(2)139,
5(2)157,
5(2)179,
5(2)205,
5(2)223,
5(2)251,
5(2)263,
5(2)275,
5(2)293,
5(2)299,
5(2)311,
5(3)331,
5(3)357,
5(3)367,
5(3)413,
5(3)437,
5(3)499,
5(4)599,
6(1)3,
6(1)13,
6(1)127,
6(1)159,
6(2)187,
6(2)195,
6(2)213,
6(2)223,
6(2)247,
6(3)299,
6(3)321,
6(3)331,
6(4)491,
6(4)507,
6(4)525,
6(4)539,
7(1)39
- C6120,
1(2)95,
2(1)31,
2(4)311,
2(4)321,
2(4)331,
2(4)391,
3(1)25,
3(2)147,
3(3)291,
3(4)445,
4(3)245,
4(4)405,
4(4)447,
5(2)139,
5(2)231,
5(2)321,
5(3)475,
6(1)173,
6(2)213,
6(3)401,
6(4)451,
7(2)117,
7(2)203
- distinct,
3(1)29
- EREW,
1(2)135,
3(1)13,
3(3)291,
4(1)15,
4(1)29,
4(1)159,
4(4)455,
5(2)139,
5(3)367,
6(2)213,
6(4)439,
6(4)451,
7(1)25,
9(1)111,
14(3)351
- exclusive,
3(2)139,
4(1)15,
4(1)29,
4(1)159
- file,
1(2)95,
2(1)31,
2(4)311,
2(4)321,
2(4)331,
2(4)391,
3(1)25,
3(2)147,
3(3)291,
3(4)445,
4(3)245,
4(4)405,
4(4)447,
5(2)139,
5(2)231,
5(2)321,
5(3)475,
6(1)173,
6(2)213,
6(3)401,
6(4)451,
7(2)117,
7(2)203,
13(2)207
- input,
4(1)29,
4(1)53,
4(1)95,
5(1)15,
5(2)223,
6(1)87
- Lingas, Andrzej,
13(3)485
- machine,
1(2)103,
1(2)149,
2(1)21,
2(1)61,
2(4)331,
3(2)139,
3(3)291,
3(3)301,
4(1)15,
4(1)29,
4(1)83,
4(1)117,
4(1)159,
4(1)171,
4(3)193,
4(3)301,
4(3)351,
4(4)367,
5(1)37,
5(1)49,
5(1)97,
5(2)157,
5(2)171,
5(2)299,
5(3)437,
5(3)451,
5(4)539,
5(4)575,
5(4)647,
6(1)173,
6(3)309,
6(4)563,
7(2)145,
9(2)253
- Maheshwari, Anil,
9(1)31
- n-node,
5(3)489
- node,
2(2)283,
3(2)189,
4(1)65,
4(1)105,
4(4)417,
5(1)97,
5(2)321,
6(1)115,
6(1)127,
6(3)309,
6(3)389,
7(3)285,
9(4)551,
13(2)149
- optimal,
1(1)3,
1(2)73,
1(2)143,
2(1)31,
2(1)43,
2(1)81,
2(1)89,
2(2)231,
2(2)249,
3(1)19,
3(2)115,
3(4)357,
3(4)407,
4(1)73,
4(1)139,
4(1)181,
4(3)339,
5(1)81,
5(2)205,
5(2)251,
5(2)299,
5(3)451,
6(1)13,
6(1)35,
6(1)115,
6(2)187,
6(3)299,
6(4)439,
6(4)451,
6(4)583,
7(4)371,
8(1)7,
8(1)77,
8(1)83,
8(2)231,
8(2)251,
8(3)297,
8(3)387,
9(1)31,
9(3)335,
12(1)17,
12(3)327,
12(3)365,
12(3)375,
13(1)35,
14(1)61,
14(2)315,
14(3)367
- organisation,
1(2)95,
2(1)31,
2(4)311,
2(4)321,
2(4)331,
2(4)391,
3(1)25,
3(2)147,
3(3)291,
3(4)445,
4(3)245,
4(4)405,
4(4)447,
5(2)139,
5(2)231,
5(2)321,
5(3)475,
6(1)173,
6(2)213,
6(3)401,
6(4)451,
7(2)117,
7(2)203
- path,
1(1)19,
1(1)51,
2(2)157,
3(4)363,
4(1)65,
4(1)83,
4(3)351,
5(3)387,
6(1)127,
6(4)451,
8(2)207,
9(1)31,
10(1)51,
10(4)279,
13(3)485,
14(3)399,
14(3)411
- PRAM,
1(2)103,
1(2)135,
2(1)31,
2(1)43,
2(2)181,
3(1)13,
3(1)59,
3(2)139,
3(3)223,
3(3)291,
4(1)15,
4(1)29,
4(1)83,
4(1)117,
4(1)159,
4(4)429,
4(4)437,
4(4)455,
5(2)129,
5(2)139,
5(2)205,
5(3)367,
6(2)187,
6(2)195,
6(2)213,
6(2)247,
6(3)299,
6(3)321,
6(4)439,
6(4)451,
7(1)25,
7(3)297,
14(3)351
- random-access,
2(1)43,
4(1)159,
4(4)437,
6(4)451
- read,
3(2)139,
4(1)15,
4(1)29,
4(1)159,
5(1)3,
5(2)299
- simple,
2(2)231,
4(1)15,
4(4)437,
7(1)25,
9(1)31
- structure,
2(1)13,
2(1)31,
2(1)71,
2(2)117,
2(2)157,
2(4)311,
2(4)321,
2(4)331,
2(4)391,
3(1)99,
3(2)147,
4(3)193,
4(3)205,
4(3)245,
4(4)447,
5(2)223,
5(2)231,
5(2)241,
5(2)321,
5(3)475,
6(1)35,
6(1)45,
6(2)213,
6(3)377,
6(3)401,
6(4)451,
6(4)469,
6(4)583,
7(1)13,
7(2)117,
7(2)181
- tree,
2(1)31,
2(1)81,
2(2)157,
2(2)171,
2(4)311,
2(4)321,
3(1)13,
3(2)115,
3(2)147,
4(1)37,
4(1)171,
4(3)281,
5(2)129,
5(2)321,
5(3)451,
5(4)635,
6(1)35,
6(1)45,
6(2)187,
6(2)213,
6(3)401,
6(4)551,
7(1)25,
8(1)121,
8(2)149,
8(3)321,
8(3)387,
9(1)93,
9(1)103,
9(1)111,
9(3)313,
9(3)361,
10(1)3,
10(4)267,
10(4)305,
12(1)3,
12(3)327,
12(3)365
- write,
3(2)139,
4(1)15,
4(1)29,
4(1)159,
5(2)299,
6(2)265