@ARTICLE{AHK,
  AUTHOR = {L. A. Adleman and Huang, H. and K. Kompella},
  TITLE  = {Efficient checkers for number-theoretic computations}, 
  YEAR = {1995},
  JOURNAL = {Information and Computation},
    VOLUME = {121(1)},
    PAGES ={93--102}
}

@ARTICLE{Aj,
  AUTHOR = {M. Ajtai},
  TITLE  = {{$\Sigma^1_1$} formulas on finite structures},
  YEAR = {1983},
  JOURNAL = {Annals of Pure and Applied Logic},
    VOLUME = {24},
    PAGES ={1--48}
}

@ARTICLE{A97,
  AUTHOR = {V. Arvind},
  TITLE  = {Constructivizing membership proofs in complexity classes},
  YEAR = {1997},
  JOURNAL = {International Journal of Foundations of Computer Science},
    VOLUME = {8(4)},
    PAGES ={433--442}
}

@ARTICLE{almss,
  AUTHOR = {S. Arora and Lund,C. and Motwani, R. and Sudan, M. 
  and M. Szegedy},
  TITLE  = {Proof Verification and the intractability of 
approximation problems},
  YEAR = {1992},
  JOURNAL = {Journal of the Association of Computing Machinery},
    VOLUME = {45(3)},
    PAGES ={501--555}
}

@ARTICLE{BK,
  AUTHOR = "M. Blum and S. Kannan",
  TITLE  = {Designing programs that check their work},
  YEAR = {1995},
  JOURNAL = {Journal of the Association of Computing Machinery},
    VOLUME = {42},
    PAGES ={269--291}
}

@ARTICLE{BLR,
  AUTHOR = "M. Blum and M. M. Luby and R. Rubinfeld",
  TITLE  = {Self-testing/correcting with applications to numerical problems},
  YEAR = {1993},
  JOURNAL = {Journal of Computer and System Sciences},
    VOLUME = {47(3)},
    PAGES ={549--595}
}

@ARTICLE{GMR,
  AUTHOR = "S. Goldwasser and S. Micali and C. Rackoff",
  TITLE  = {The knowledge complexity of interactive proof systems},
  YEAR = {1989},
  JOURNAL = {SIAM Journal on Computing},
    VOLUME = {18(1)},
    PAGES ={186-208}
}

@BOOK{Ha,
  AUTHOR = {J. Hastad},
  TITLE  = {Computational limitations for small depth circuits},
  PUBLISHER = {M.I.T Press}, 
  ADDRESS = {Cambridge, Massachusetts},  
  YEAR = {1986}
}

@ARTICLE{HV,
  AUTHOR = {H. Venkateswaran},
  TITLE  = {Circuit definitions of nondeterministic complexity classes},
  YEAR = {1988},
  JOURNAL = {Proc. 8th FSTTCS, Lecture Notes in Computer Science},
    VOLUME = {338},
    PAGES ={175-192}
}

@BOOK{MRbook,
  AUTHOR = {R. Motwani and P. Raghavan},
  TITLE  = {Randomized Algorithms},
  PUBLISHER = {Cambridge University Press}, 
  ADDRESS = {Cambridge, New York},  
  YEAR = {1995}
}

@BOOK{GHR,
  AUTHOR = {R. Greenlaw and J. Hoover and W.L. Ruzzo},
  TITLE  = {Limits to Parallel Computation},
  PUBLISHER = {Oxford University Press}, 
  ADDRESS = {New York, Oxford},  
  YEAR = {1995}
}


@ARTICLE{Rub,
  AUTHOR = {R. Rubinfeld},
  TITLE  = {Designing checkers for programs that run in parallel},
  YEAR = {1996},
  JOURNAL = {Algorithmica},
    VOLUME = {15(4)},
    PAGES ={287--301}
}

@ARTICLE{Sch,
  AUTHOR = {U.~Sch{\"o}ning},
  TITLE  = {Robust algorithms: a different approach to oracles},
  YEAR = {1985},
  JOURNAL = {Theoretical Computer Science},
    VOLUME = {40},
    PAGES ={57--66}
}