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)
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.
4. Learning Via Queries (with C. Smith) 29th Annual IEEE Symposium on the Foundations of Computer Science October 1988.
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.
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)
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.
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
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.
11. Learning via Queries to [+,<] (with M. Pleszkoch and R. Solovay), Third Annual Conference on Computational Learning Theory August 1990.
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.
13. A Survey of Bounded Queries in Recursion Theory, Sixth Annual Conferences on Structure in Complexity Theory, Chicago, June 1991.
14. On the number 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.
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.
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)
17. Bounded Queries and Approximation (with R. Chang), 34th Annual IEEE Symposium on the Foundations of Computer Science October 1993.
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)
19. Measure, Category, and Learning Theory International Conference on Automata, Languages, and Programming (ICALP). July 1995. (with Fortnow, Freivalds, Kummer, Kurtz, Smith, and Stephan)
20. Frequency Computation and Bounded Queries (with R. Beigel and E. Kinber), Tenth Annual Conferences on Structure in Complexity Theory, June 1995.
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.
22. Reductions in Learning Via Queries (with G. Hird) Eighth Conference on Computational Learning Theory July 1995. (Journal version, different title: Automata Techniques for Query Inference Machines in Annals of Pure and Applied Logic Vol. 117, 2002, pp 171-202.)
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.
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. and Book Chapter
25. Inferring answers from data (with A. Lee) Tenth Annual Conference on Computational Learning theory July 1997. (Journal Submission)
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)
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.
28. AHA: An illuminating Perspective. (with Dan Garcia and David Ginat). Thirty third annual SIGCSE Technical symposium on Computer Science Education, Feb 2002.
29. The Multiparty Communication Complexity of Exact-$T$ revisited. (with Richard Beigel and James Glenn). Thirty First International Symposiusm on Mathematical Foundations of Computer Science (MFCS) August 2006.
30. The Complexity of Learning SUBSEQ(A). (with Steven Fenner). Seventeenth International Workshop on Algorithmic Learning Theory (ALT), September 2006. item Lower bounds on the Deterministic and Quantum Communication Complexity of $HAM_n^a$. (with A. Ambainis, A. Srinivasan, A. Utis) Proceedings of 17th International Symposium on Algorithms and Computation (ISAAC) December 2006.