Articles in Refereed Conferences

1. On the inference of sequences of functions, International Workshop on Analogical and Inductive Inference, (with C. Smith), Wendisch-Rietz, DDR, October 1986. (Lecture Notes in Computer Science 265, pp. 23-41) (Subsumed by Journal Article TRAINING)
2. Polynomial Terse Sets (with A. Amir), Second Annual Conference on Structure in Complexity Theory, Cornell, June 1987.
3. Learning Via Queries (with C. Smith) Conference on Computational Learning Theory August 1988. (Journal version LVQ)
4. Learning Via Queries (with C. Smith) 29th Annual IEEE Symposium on the Foundations of Computer Science October 1988. (Journal version LVQ)
5. Learning Programs with an Easy to Calculate Set of Errors (with Rameshkumar Sitarman, C. Smith, and Mahendran Velauthapillai) Conference on Computational Learning Theory August 1988. (Journal version errors)
6. Learning programs with an easy to calculate set of errors. International Workshop on Analogical and Inductive Inference, (with R.K. Sitaraman, C. Smith, and M. Velauthapillai), Reinhardsbrunn Castle, GDR, October 1989. (Lecture Notes in Artificial Intelligence 397, pp. 124-137) (Journal version errors)
7. On Honest Polynomial Reductions, Relativizations, and P$=$NP (with R. Downey, S. Homer, and M. Moses), Fourth Annual Conference on Structure in Complexity Theory, Univ. of Oregon, June 1989.
8. Learning via Queries to an Oracle (with M. Pleszkoch), Second Annual Conference on Computational Learning Theory August 1989. (Subsumed by Journal paper EXTREMES)
9. Some connections between bounded query classes and non-uniform complexity (with A. Amir and R. Beigel), Fifth Annual Conference on Structure in Complexity Theory, Barcelona, Spain, June 1990. (Journal Submission BDQNONUNIFORM)
10. On Checking Versus Evaluation of Multiple Queries (with Lane Hemachandra and Albrech Hoene), 15th International Symposium on Mathematical Foundations of Computer Science (MFCS '90), Banska Bystrica, Czechoslovakia August 1990. (Journal version CHECK)
11. Learning via Queries to $[+,<]$ (with M. Pleszkoch and R. Solovay), Third Annual Conference on Computational Learning Theory August 1990. (Journal version LVQPLUS)
12. Learning via Queries with Teams and Anomalies (with E. Kinber, M. Pleszkoch, C. Smith, and T. Zeugmann), Third Annual Conference on Computational Learning Theory August 1990. (Journal version LVQTEAMS)
13. A Survey of Bounded Queries in Recursion Theory, Sixth Annual Conferences on Structure in Complexity Theory, Chicago, June 1991. BDQSUR
14. On the numer of components of a recursive graph (with K. Guimaraes), First Latin American Symposium on Theoretical INformatics (LATIN 92) April 1992. Lecture notes in Computer Science volume 583, 177-190. (Subsumed by Journal Article BINARY)
15. Degrees of Inferability (with P. Cholak, R. Downey, L. Fortnow, E. Kinber, M. Kummer, S. Kurtz, and T. Slaman), Fifth Annual Conference on Computational Learning Theory July 1992. (Subsumed by Journal paper EXTREMES)
16. Asking Questions Versus Verifiability International Workshop on Analogical and Inductive Inference, (with M. Velauthapillai), Dagstuhl Castle, Germany, October 1992. (Lecture notes in Artificial Intelligence 642, pp. 197-213) (Journal version VERIFY)
17. Bounded Queries and Approximation (with R. Chang), 34th Annual IEEE Symposium on the Foundations of Computer Science October 1993. (Journal version BDQAPPROX)
18. Classification Using Information Algorithmic Learning Theory (with M. Pleszkoch and Mahendran Velauthapillai), Germany, October 1994. (Lecture notes in Artificial Intelligence 961, pp. 165-176) (Journal version CLASSIFICATION)
19. Measure, Category, and Learning Theory International Conference on Automata, Languages, and Programming (ICALP). July 1995. (with Fortnow, Freivalds, Kummer, Kurtz, Smith, and Stephan) (Journal version SIZE)
20. Frequency Computation and Bounded Queries (with R. Beigel and E. Kinber), Tenth Annual Conferences on Structure in Complexity Theory, June 1995. (Journal version FREQ)
21. On the Number of Automorphisms of a Graph, (with R. Chang and J. Toran), Tenth Annual Conferences on Structure in Complexity Theory, June 1995. (Journal version NUMAUTO)
22. Reductions in Learning Via Queries (with G. Hird) Eighth Conference on Computational Learning Theory July 1995. (Journal version, different title, in QUERY)
23. Unbounded search and recursive graphs (with K. Guimaraes), Fourth annual Latin American Symposium on Theoretical INformatics (LATIN 95) Lecture Notes in Computer Science, 911, pp. 323-331, 1995. (Subsumed by Journal Article BINARY)
24. On the query complexity of sets (with R. Beigel, M. Kummer, G. Martin, T. McNichol, and F. Stephan) 21st International Symposium on Mathematical Foundations of Computer Science (MFCS '96), Cracow, Poland August 1996. (Subsumed by Journal Article ODD) and Book Chapter GEMS)
25. Inferring answers from data (with A. Lee) Tenth Annual Conference on Computational Learning theory July 1997. (Journal Submission ANSWERS)
26. FIN Teams and games Algorithmic Learning Theory (ALT) (A. Ambainis, K. Apsitis, R. Freivalds, W. Gasarch and C. Smith), Eighth International Workshop on Algorithmic Learning Theory, Sendi, Japan, October 1997, in Springer Verlag Lecture Notes in Artificial Intelligence, Vol. 1316, pp. 2-17. (Journal version FIN)
27. The Communication Complexity of Enumeration, Elimination, and Selection (with Andris Ambainis, Harry Buhrman, Bala Kalyanasundaram, Leen Torenvliet) Fifteenth Annual Conferences on Structure in Complexity Theory, July 2000. (Journal version COMM)
28. AHA: An Illuminating Perspective. (With Dan Garcia and David Ginat) Thirty third annual SIGCSE Technical Symposium on Computer Science Education, Feb 2002. (AHA)