### Table 1. The minimum number of rounds in the key scheduling.

2005

"... In PAGE 6: ... Similarly the value of r can be calculated for different array size and different bit numbers. In Table1 we list the minimum number of rounds needed in the key scheduling such that no number has significantly higher probability... ..."

Cited by 4

### Table 12. Minimum Number of Keystrokes for Retrieval

1996

"... In PAGE 34: ... The 20 locations were split into 4 groups of 5 locations, with the minimum number of keystrokes being equalized among groups. (See Table12 .) Locations were ordered... In PAGE 35: ... A shift activation was mistakenly ignored. The locations in Table12 that are shown in bold were originally believed to require one less keystroke. Table 12.... ..."

### Table 8. Minimum number of runs needed

2005

"... In PAGE 9: ...2 lower. Table8 presents the results of the analysis. In these experiments, the number of runs N ranges over the values 100, 200, .... ..."

Cited by 61

### Table 8. Minimum number of runs needed

2005

"... In PAGE 9: ...2 lower. Table8 presents the results of the analysis. In these experiments, the number of runs N ranges over the values 100, 200, .... ..."

Cited by 61

### Table 8. Minimum number of runs needed

"... In PAGE 9: ...2 lower. Table8 presents the results of the analysis. In these experiments, the number of runs N ranges over the values 100, 200, .... ..."