Entry Varman:1988:EPA from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
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{Varman:1988:EPA,
author = "Peter Varman and Kshitij Doshi",
title = "An efficient parallel algorithm for updating minimum
spanning trees",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "379--397",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5320G
(Semiconductor storage)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Electr. and Comput. Eng., George R. Brown
Sch. of Eng., Rice Univ., Houston, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Computer Programming; Concurrent Read
Exclusive Write; concurrent-read-exclusive-write
parallel random access machine; graph theory;
Mathematical Techniques--Trees; Minimum Spanning Trees;
n-vertex graph; parallel algorithm; Parallel
Algorithms; parallel algorithms; Parallel Random Access
Machines (prams); random-access storage; Tree Updates;
trees (mathematics); updating minimum spanning trees",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- access,
38(1)1,
39(2)89,
58(0)3,
58(1)3,
61(2)121,
63(2)203
- access, random-,
47(3)315,
48(1)53,
59(3)297,
61(2)121
- C5320G,
48(1)53,
59(3)297,
61(2)121
- concurrent,
36(1)27,
38(1)1,
38(2)193,
39(2)107,
40(2)149,
43(2)213,
43(2)277,
45(1)1,
46(2)285,
49(2)185,
50(3)241,
51(3)281,
55(1)1,
55(1)87,
56(1)37,
58(0)3,
58(1)3,
58(1)183,
58(1)263,
58(1)347,
59(1)25,
60(1)1,
61(1)93,
61(2)121,
64(3)221,
64(3)281,
65(1)35,
66(0)117,
66(2)117,
66(3)333,
69(1)69
- efficient,
39(2)89,
43(2)239,
47(3)277,
52(3)193,
53(1)151,
59(3)297,
66(1)55,
68(1)19
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- minimum,
47(3)237,
60(3)231,
61(2)307,
63(1)91,
66(2)181
- n-vertex,
36(2)319,
54(1)129
- random,
38(1)69,
39(2)89,
41(1)1,
43(2)169,
53(1)99,
53(1)z,
56(3)303,
61(2)121,
63(2)203
- random-access,
47(3)315,
48(1)53,
59(3)297,
61(2)121
- Semiconductor,
48(1)53,
57(1)97,
59(3)297,
61(2)121
- spanning,
64(1)125
- storage,
39(2)267,
48(1)53,
54(2)325,
59(3)259,
59(3)297,
61(2)121
- Techniques--Trees,
58(1)143,
61(2)289,
62(3)251,
66(2)137,
66(2)181
- Trees, Techniques-,
58(1)143,
61(2)289,
62(3)251,
66(2)137,
66(2)181
- update,
58(1)57,
62(1)67
- vertex, n-,
36(2)319,
54(1)129
- Write,
61(2)121