### lable capacity.

2005

### Table 6: Impact of Movie Broadcasts on Piracy (Fixed Effects) for Broadcast Channels

1977

"... In PAGE 10: ...10 Twenty Eighth International Conference on Information Systems, Montreal 2007 Our results in Table6 show a significant increase in piracy immediately after movies are broadcast on over-the-air channels. Daily downloads, number of lechers, and number of seeds increase over the next 3 weeks after the broadcast.... ..."

Cited by 3

### Table 1. Orders of the largest known broadcast networks with degree and broadcast time T .

"... In PAGE 4: ... Details of our methodology are delayed until Sec- tion 5. Table1 presents the best known lower bounds on B( ; T ) for small values of and T , T 3. In Table 1, bold entries are known to be optimal.... In PAGE 4: ... Table 1 presents the best known lower bounds on B( ; T ) for small values of and T , T 3. In Table1 , bold entries are known to be optimal. All of these in fact attain the upper bound on B( ; T ) given in Table 2.... In PAGE 4: ... Italicized entries are new results. All entries in Table1... In PAGE 6: ... In addition, each best broadcast graph is bipartite (many of the others are not). We now discuss our new entries in Table1 in more detail (see [4] for previous details). (3; 5): There are exactly four cubic transitive graphs with 24 vertices and broadcast time 5, all of which are Cayley graphs.... ..."

### Table 1: Comparison of broadcast models

"... In PAGE 7: ... In fact, (a) the set of data items broadcast periodically in cycle i, and (b) the amount of bandwidth assigned to each transmission mode, more speci cally, P eriodic Broadcast Lengthcyclei and On Demand Lengthcyclei, could di er from cycle i to the next, to adapt to the needs of the clients. To summarize, in Table1 we list the features of the di erent models described above and of... ..."

### Table 2 Percentage of unsuccessful broadcasts

"... In PAGE 11: ... From degrees between 7 and 10, all algorithms failed in several occasions; however, for higher degrees only BPS failed at least in one occasion. Table2 gives these results. Figure 11 Percentage of collisions from transmitting nodes Table 2 Percentage of unsuccessful broadcasts ... ..."

### Table 3. Subclasses of Sequential and Broadcast

1997

"... In PAGE 6: ... Thus, the function which determines the subclassification is: g b = preS ((); b) Despite the fact that this function is not binary, associa- tivity again plays a key ro le in the subclassification of the classes Sequential and Broadcast. Table3 lists different forms of function g with their corresponding subclasses of Sequential and Broadcast. 4.... In PAGE 8: ... Remember that n, the depth of the recursion, is still determined by the list of local inputs as = [(); n times : : : ; ()]. For all subclasses of Sequential, shown in Table3 , ex- cept Identity, we use a processor network with log n pro- cessors in a row (repeat) which computes the result with time(n) = O(log n), costBrent(n) = O(log n) and pipe(n) = O(1). We assume n to be a power of 2.... In PAGE 9: ....3. Broadcast In this class we apply function g to the global input n times and return a list of intermediate results and the final re- sult whose implementation is known from the previous sec- tion. For all subclasses shown in Table3 , we use a tree-like processornetworkwith n processorswhich computes the re- sult with time(n) = O(log2 n), costBrent(n) = O(n) and pipe(n) = O(1). At each node, a function is applied which receives the input from its parent on the left side and pro- vides two outputs to its children on the right.... ..."

Cited by 2

### Table 6.1: The definitions of Broadcast Domination and Modified Broadcast Domination.

### Table 7: Broadcast topology highlights

1993

"... In PAGE 52: ... For tree topologies, the main variables involve the number of branches (Nb) at each node of the tree, and which branch is sent to rst. These classes are explained in detail below, and Table7 provides a quick summation of some of the more important properties. This Table speci es the number of steps until the... In PAGE 53: ...the number of processors who are nished with the routine after step i is complete (PROCS DONE, S = i), the time the source processor spends in the algorithm (SRC TIME), and nally the maximum time spent by any processor in the operation (MAX TIME). The analyses shown in Table7 have been simpli ed by assuming that Nr is an even multiple of Np, and Nb = 1, with Np an integer multiple of 2. The speci c topology section should be... In PAGE 56: ... With this algorithm, Np does not have to be an integer power of Nb. The timing analysis for this algorithm is relatively complex, so we do not reproduce it here (analysis for the most common use, Nb = 1 is shown in Table7 ). See [16] for full details.... ..."

Cited by 32