### Table 1 Upper bounds for string matching without transposition invariance Distance Distance evaluation Searching

"... In PAGE 8: ... For the simpler distances, on the other hand, our only solution is to evaluate them at every text position. Table1 gives a simplified list of upper bounds that are known for these problems without transposition invariance. Table 2 gives the achieved upper bounds for the transposition invariant versions of these problems.... ..."

### Table 2 Our upper bounds for transposition invariant string matching Distance Distance evaluation Searching

"... In PAGE 8: ... Table 1 gives a simplified list of upper bounds that are known for these problems without transposition invariance. Table2 gives the achieved upper bounds for the transposition invariant versions of these problems. We start by describing our solutions to the edit distances, since they are the main empha- sis of this paper.... ..."

### Table 1. Invariant manifolds in the symmetric representation.

in c ○ World Scientific Publishing Company DYNAMICS OF THREE COUPLED EXCITABLE CELLS WITH D3 SYMMETRY

1998

"... In PAGE 5: ...n the following way [Ashwin et al., 1990]. A real variable which corresponds to the aver- age phase, that is: = ( 1 + 2 + 3)=3, and a complex variable = 1 + ei2 3 2 + ei4 3 3.The invariant manifolds in this coordinate system are shown in Table1 . The action of the symmetry group corresponds to (Fig.... ..."

### Table 7: Transposition time (seconds) for (block,block) distributions aInvariant code motion and some code transformations where performed by hand for this distribution

"... In PAGE 20: ... The column heads describe the distribution of the array dimensions: for instance c5c7 stands for (cyclic(5),cyclic(7)). Table7 show the (block,block) transposition time for various array arrangements, involving up to 16 proces- sors. These raw measures are analyzed in the next section.... ..."

### Table 7: Transposition time (seconds) for (block,block) distributions aInvariant code motion and some code transformations where performed by hand for this distribution

"... In PAGE 16: ... The column heads describe the distribution of the array dimensions: for instance c5c7 stands for (cyclic(5),cyclic(7)). Table7 show the (block,block) transposition time for various array arrangements, involving up to 16 proces- sors. These raw measures are analyzed in the next section.... ..."

### Table 1. Representations of H-solutions with one independent invariant variable. No Representation Index

### Table 2. Representations of H-solutions with two independent invariant variables. No Representation Index

### Table 10-Frequency domain representation with pilots inserted.

2003

"... In PAGE 8: ...he first element of sequence p0..126 and inserting them into location {-21, -7, 7, 21}, respectively. The resulting frequency domain values are given in Table10 . ... ..."

### Table 5: The Frequency of Renumbering with the de Bruijn Representation

2004

"... In PAGE 27: ... Cases of this kind can be identi ed as those in which rule (r5) is used where the skeletal term is non-atomic and an immediate simpli cation by rule (r12) is not possible. Table5 tabulates the data gathered towards this end for the two viable and comparable approaches that was identi ed by the analysis in Section 4, namely head normalization with lazy substitution and the enhanced form of eager head normalization. An interesting observation is that no renumbering is actually involved in the case of L style program- ming.... ..."

Cited by 6

### Table 1: Conformal invariants of genus one surfaces.

"... In PAGE 6: ... This shows the algorithm is intrinsic to the geometry and inde- pendent of the surface representation. Table1 shows the conformal invariants of the genus one surfaces illustrated in figure 9. By examining their shape Figure 6: Canonical homology bases.... ..."