### Table 2: PROPP apos;s Functions (from: BERGER 1997:26) Hero Villain

2000

Cited by 1

### Table 1 Maximum speedup over Minos or Lemke Acknowledgement We are grateful to Michael C. Ferris and Steven P. Dirkse for letting us use their implementation of the sparse Lemke method for comparison purposes.

1995

"... In PAGE 14: ... The smooth algorithm is always better than Lemke apos;s method for both dense as well as the sparse problems. We conclude with Table1 , that shows the potential of our smoothing methods as indicated by the maximum speedup that was achieved over standard algorithms. This table shows that smoothing techniques can be very e ective for solving linear and convex inequalities as well as linear complementarity problems and hence warrant further study.... ..."

Cited by 44

### Table 1 Maximum speedup over Minos or Lemke Acknowledgement We are grateful to Michael C. Ferris and Steven P. Dirkse for letting us use their implementation of the sparse Lemke method for comparison purposes.

1995

"... In PAGE 14: ... The smooth algorithm is always better than Lemke apos;s method for both dense as well as the sparse problems. We conclude with Table1 , that shows the potential of our smoothing methods as indicated by the maximum speedup that was achieved over standard algorithms. This table shows that smoothing techniques can be very e ective for solving linear and convex inequalities as well as linear complementarity problems and hence warrant further study.... ..."

Cited by 44

### Table 1. First 32 Fixed Points of Michael

"... In PAGE 10: ...8 GHz, and the pro- gram only takes 2-3 minutes to decide whether there exists a xed point for a given Ri. We provide the rst 32 xed points found by using our method in Table1 (Numbers are hexadecimal and listed in increasing or- der according to Ri). A more complete table is provided in the Appendix... ..."

### Table 1. Experimental measurements of storage modulus G0(!i) and loss modulus G00(!i), both in Pa, at various frequencies !i (s 1) for a polybutadiene melt at 23 C, from Berger (1988).

in SUMMARY

### Table 1.2: Schedule of the REINAS Project apos;s First Two Years. 3. Emil Petruncio - Characterization of Tidal Currents in Monterey Bay from Remote and In-Situ Measurements 4. Pat Cross - A Comparison of Modeled and Observed Ocean Mixed Layer Behavior in a Sea Breeze In uenced Coastal Region 5. Michael Knapp - Synoptic-Scale In uence on the Monterey Bay Sea-Breeze

in REINAS: Real-Time Environmental Information Network and Analysis System: Phase IV.1-EXPERIMENTATION

1995

Cited by 10

### Table 3. Complexity comparison of encoders for some Berger codes

"... In PAGE 7: ... Table3 compares the hardware complexity and speed of the new encoders for Berger codes (i.e.... ..."

### Table 4. Parallel Speculative Berger-Munson Algorithm Speedup Factors.

"... In PAGE 7: ...abat et al. and CLUSTALV significantly. The sequential computation times in these tables are used to calculate the speedup factors of the parallel speculative Berger-Munson algorithm in the next table. Table4 shows the speedup factors for the three groups of sequences on varying numbers of processors. The speedup factor is defined as the ratio of the total run time of the sequential version of the program to the total run time of the parallel version.... ..."

### Table 1: Berger Check Symbol Equations for an ALU [7-8]

2006

"... In PAGE 25: ...Table1 presents the summary of Berger check symbol equations for some basic ALU operations. In Chapter V, the design of a 16-bit single instruction issue processor using the equations in Table 1 is discussed (ii) Remainder Check and Parity Check Scheme a) Remainder Check for Arithmetic Instructions Remainder check codes are based on the principle that a remainder calculated for the value X and value Y in an ALU would be preserved through the arithmetic ALU operations.... In PAGE 25: ...for some basic ALU operations. In Chapter V, the design of a 16-bit single instruction issue processor using the equations in Table1 is discussed (ii) Remainder Check and Parity Check Scheme a) Remainder Check for Arithmetic Instructions Remainder check codes are based on the principle that a remainder calculated for the value X and value Y in an ALU would be preserved through the arithmetic ALU operations. The mathematics behind the remainder check codes is presented below.... ..."

### Table 3. Literal Count Comparison for Berger versus Bose-Lin Code Berger Code Bose-Lin Code

"... In PAGE 12: ... The circuits are sorted in increasing number of states. Table3 gives the literal count comparison for the sequential machines with output CED based on Berger codes as reported in [10] and our sequential machines with output CED based on Bose-Lin codes. The total literal count includes the combinational logic, flip-flops and two checkers.... In PAGE 12: ... Table 2. Benchmark Sequential Circuits Circuit #inputs #outputs #states dk15 3 5 4 mc 3 5 4 dk14 3 5 7 ex6 5 8 8 ex4 6 9 14 bbsse 7 7 16 cse 7 7 16 kirkman 12 6 16 sse 9 10 16 ex1 9 19 20 dk16 2 3 27 styr 9 10 30 sand 11 9 32 planet 7 19 48 scf 27 56 121 It can be seen in Table3 that the number of literals for CED based on Bose-Lin codes is significantly reduced compared to the Berger code case. One advantage of Bose-Lin code lies in a fixed number of check bits, independent of the number of outputs of the original circuit.... ..."