### Table 2: Fraction of flows and bytes in Small/Slow, Small/Fast, Big/Slow and Big/Fast flows.

2002

"... In PAGE 4: ... These thresholds are arbitrary, but they provide a way to characterize flows in a two-by-two taxonomy. Table2 shows the fraction of flows and bytes in each of the 4 categories for the packet traces. Flows that are small and slow, the largest group in each trace, account for between 44% and 63% of flows.... ..."

Cited by 86

### Table 2: Fraction of flows and bytes in Small/Slow, Small/Fast, Big/Slow and Big/Fast flows.

2002

"... In PAGE 4: ... These thresholds are arbitrary, but they provide a way to characterize flows in a two-by-two taxonomy. Table2 shows the fraction of flows and bytes in each of the 4 categories for the packet traces. Flows that are small and slow, the largest group in each trace, account for between 44% and 63% of flows.... ..."

Cited by 86

### Table I summarizes this observation with an arbitrary small algorithm. All numbers are in bytes.

### Table 8 Fraction of Movement in Aggregate Small-Bank Lending

2000

"... In PAGE 30: ...small-bank lending falls by substantially more than large-bank lending after a funds-rate shock. 29 speaking, this would translate into dividing the numbers in Table8 by four.38 VII.... ..."

Cited by 13

### Table 1: Extracting a constant fraction: m = (1 )k for arbitrary gt; 0 reference min-entropy k seed length d

2000

Cited by 39

### Table A2. Size and Composition of Expenditure Shocks by Demographics in Poland Size of shock in Poland

### Table A3. Size and Composition of Expenditure Shocks by Demographics in Russia Size of shock in Russia

### Table 3. Di erential analysis for an arbitrary number of rounds. (ylog2)

1998

"... In PAGE 11: ... This results in an improvement of the signal-to-noise-ratio by a factor of 232 pc, where pc represents the factor by which the probability of the characteristic is reduced when we perform a 1R-attack instead of a 2R-attack. Results for an arbitrary number of rounds Table3 lists for each number of rounds: the probability of the characteristic, the required number of chosen plaintexts (assuming 4 right pairs for the characteristic are su cient, and that we need both guesses for the permutation key bit in the rst round structure),... In PAGE 12: ...5 Key dependency of the attacks We described the previous attacks using the best conditional characteristic. In Table3 we have listed for how many keys this works. For Thin-ICE the attack works for a fraction 2?2 of the keys.... ..."

Cited by 1