Last update: Thu Jun 20 02:01:00 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{Cooper:2006:SMA,
author = "Brian F. Cooper and Hector Garcia-Molina",
title = "{SIL}: {A} model for analyzing scalable peer-to-peer
search networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "50",
number = "13",
pages = "2380--2400",
day = "15",
month = sep,
year = "2006",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:13 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
Related entries
- analyzing,
33(1)17,
33(1)457,
42(4)419,
47(3)327
- Garcia-Molina, Hector,
33(1)213,
33(1)277,
50(4)472,
50(10)1583
- model,
32(4)449,
32(4)471,
32(5)599,
33(1)431,
34(1)85,
35(5)507,
35(5)521,
36(5)533,
37(2)171,
37(2)221,
37(3)251,
37(6)739,
38(1)25,
38(3)311,
39(3)277,
39(5)489,
39(5)507,
39(5)681,
40(3)319,
41(1)29,
41(4)489,
42(4)419,
43(1)3,
43(2)113,
43(6)805,
44(2)177,
44(3)275,
46(1)73,
46(4)555,
48(2)113,
48(3)335,
49(5)627,
50(1)63,
50(7)953,
50(8)1040,
50(8)1176,
50(9)1219,
50(13)2160,
50(15)2676,
51(1)114,
51(2)439,
51(3)683,
51(5)1315,
51(6)1725,
51(10)2631,
51(11)3110,
51(12)3549,
51(14)4174,
51(15)4460,
51(16)4586,
51(17)4816,
52(10)1927,
52(11)2159,
52(14)2645,
52(16)3130,
52(18)3318,
53(3)382,
53(4)485,
53(4)501,
53(5)596,
53(7)1125,
53(8)1289,
53(13)2288,
53(14)2396,
53(15)2727
- Molina, Hector, Garcia-,
33(1)213,
33(1)277,
50(4)472,
50(10)1583
- peer, peer-to-,
45(2)195,
46(1)133,
50(1)106,
50(4)469,
50(4)501,
50(4)563,
50(4)579,
50(6)859,
50(10)1583,
50(17)3485,
51(1)190,
51(4)1072,
51(8)1998,
51(10)2818,
51(17)4797,
52(5)1019,
52(8)1617,
52(9)1838,
52(11)2097,
53(4)456,
53(4)470,
53(13)2259
- peer-to-peer,
45(2)195,
46(1)133,
50(1)106,
50(4)469,
50(4)501,
50(4)545,
50(4)563,
50(4)579,
50(6)859,
50(10)1583,
50(17)3485,
51(1)190,
51(4)1072,
51(8)1998,
51(10)2818,
51(17)4797,
52(5)1019,
52(8)1617,
52(9)1838,
52(11)2097,
53(4)456,
53(4)470,
53(13)2259
- scalable,
33(1)33,
37(5)507,
38(5)553,
38(6)693,
39(6)713,
42(6)717,
43(4)459,
43(5)539,
43(5)633,
44(3)289,
44(6)713,
44(6)813,
46(2)273,
47(2)257,
48(4)525,
49(4)492,
50(1)80,
50(12)2028,
50(15)2641,
50(16)2937,
50(16)3043,
51(1)285,
51(9)2268,
51(12)3525,
51(14)4092,
52(3)630,
52(6)1193,
53(2)153,
53(6)821,
53(13)2373,
53(16)2825
- search,
33(1)119,
33(1)337,
33(1)417,
33(1)431,
33(1)493,
34(3)467,
39(3)289,
39(3)303,
41(1)73,
50(9)1406,
50(10)1430,
50(10)1448,
50(17)3485,
51(1)177,
51(3)588,
51(6)1499,
51(8)1861,
51(10)2818,
51(11)3172,
51(12)3354,
52(9)1721,
53(8)1264
- to-peer, peer-,
45(2)195,
46(1)133,
50(1)106,
50(4)469,
50(4)501,
50(4)563,
50(4)579,
50(6)859,
50(10)1583,
50(17)3485,
51(1)190,
51(4)1072,
51(8)1998,
51(10)2818,
51(17)4797,
52(5)1019,
52(8)1617,
52(9)1838,
52(11)2097,
53(4)456,
53(4)470,
53(13)2259