Chapters in Books and Invited Articles

1. Oracles: Three New Results. Marcel Dekker Lecture Notes in Pure and Applied Mathematics Vol. 106, Edited by D.W. Kueker, E.G.K. Lopez-Escobar, and C.H. Smith, 1987, pp. 219-252.
2. Index Sets in Recursive Combinatorics (with G. Martin), Logical Methods (In honor of Anil Nerodes's Sixtieth Birthday). Edited by Crossley, Remmel, Shore, and Sweedler. 1993. Edited by Birkhauser, Boston.
3. The Complexity of Problems, Advances in Computers Volume 43. Edited by Marvin Zelkowitz. Published by Academic Press. 1996.
4. A Survey of Inductive Inference with an Emphasis on Learning via Queries (with C. Smith). Complexity, Logic, and Recursion Theory. Edited by A. Sorbi. Published by M. Dekker. Volume 187. 1997.
5. A Survey of Recursive Combinatorics. Handbook of Recursive Mathematics Volume 2. Edited by Ershov, Goncharov, Marek, Nerode, and Remmel. 1998. Pages 1041-1176. Published by Elsevier
6. Implementing WS1S via Finite Automata. Automata Implementation. (with James Glenn) Edited by Raymond, Wood, and Yu. (Lecture Notes in Computer Science 1260.)
7. A techniques-oriented survey of bounded queries. (with Frank Stephan). Models and Computability (invited papers from Logic Colloquium '97) (Lecture Note Series 259), Edited by Cooper and Truss. London Mathematical Society 117-156, 1999. Forschungsberichte Mathematische Logik 32 / 1998, Mathematisches Institut, Universitaet Heidelberg, Heidelberg, 1998.
8. Computability, Handbook of Discrete and Combinatorial Mathematics. Edited by Kenneth Rosen. Published by CRC Press (Boca Raton, Florida). 2000. pp. 1062-1066.
9. A Survey of Constant Time Parallel Sorting, for Bulletin of the European Association for Theoretical Computer Science (with Evan Golub and Clyde Kruskal), Vol 72, pages 84-102, October 2000, Computational Complexity Column.
10. The P=?NP Poll Special Interest Group in Algorithms and Computing Theory (SIGACT) Vol 33, 2002.
11. Gems in the field of bounded queries. Computability and Models Edited by Cooper and Goncharov. 2003.
12. A Survey on Private Information Retrieval Bulletin of the European Association for Theoretical Computer Science Vol 82, February 2004, pages 72-107. Computational Complexity Column.