### Table 1. Summary of working papers.

in Development

"... In PAGE 11: ... First, issues were compiled from earlier research based upon working papers for Tasks A through H. Table1 lists the reports prepared for the Federal Highway Administration (FHWA).Second, a set of criteria are defined for evaluating the list of issues.... ..."

### Table 1. Summary of previous works and the results of this paper.

1998

Cited by 9

### Table 1. Summary of previous works and the results of this paper.

### Table 1. the lower bounds of previous works and this paper

"... In PAGE 2: ... For n = 2r 1, sizer 1(Parityn) 2n log2(n + 1) 1 + sizemono(Majorityn) 6n log2(n + 1) O(1): Theorem 2. For n = 2r 1, sizer(Invn) 4n log2(n + 1) + sizemono(Majorityn) 8n log2(n + 1) O(1): Now we explain the previously known lower bounds shown in Table1 , and how we obtain our improvements focusing on Parityn. Table 1.... ..."

### Table 1 : Overview of the basic working principles of the methods studied in this paper.

"... In PAGE 2: ... Starting from this general scheme, it is possible to define various methods, depending on the memory implementation, the constructive procedure, the improving method and the memory updat- ing process. Table1 provides the main components of the methods discussed in the paper: their name, reference in which they have been proposed, memory implementation, intermediate solution generator and improving procedure. This paper present two new AMPs for the quadratic assignment problem (QAP).... ..."

### Table 1: results of previous work The following are notations used in this paper

"... In PAGE 3: ... [1] extended the method of Reed-Solomon codes and solves the problem for M replicated sites, where M 3. Table1 summarizes the characteristics of a number of previous work for this problem. In Table 1, N is the number of pages in the le, a1 is the assumption that an uncorrupted copy resides in a known site, and a2 is the assumption that N... In PAGE 3: ... Table 1 summarizes the characteristics of a number of previous work for this problem. In Table1 , N is the number of pages in the le, a1 is the assumption that an uncorrupted copy resides in a known site, and a2 is the assumption that N... ..."

### Table 2 summarizes work on query containment including our contribution in this paper.

2002

"... In PAGE 9: ... Table2 : Complexity of query containment: checks whether Q2 is contained in Q1. CQ represents conjunc- tive queries, CQnegationslash = represents conjunctive queries with only negationslash = , CQAC represents conjunctive queries with any arithmetic comparisons .... ..."

Cited by 2

### Tables and figures 39 European Central Bank working paper series 53

in IMPERFECT KNOWLEDGE THE CONQUEST OF U.S. INFLATION LEARNING AND ROBUSTNESS TO MODEL UNCERTAINTY 1

2005