PUBLICATIONS

1. Inferring answers from data (with A. Lee) Journal of Computing and Systems Sciences, (To appear) Conference Version in COLT97. ANSWERS.PS, ANSWERS.PDF
2. Finding Large 3-free Sets I: the Small $n$ Case (with James Glenn and Clyde Kruskal), Journal of Computing and Systems Sciences, (To Appear). 3apI.PS, 3apI.PDF

3. A Nearly Tight Lower Bound for Restricted Private Information Retrieval Protocols (with Richard Beigel and Lance Fortnow), Computational Complexity. Vol 15, No 1, 2006, 82-91. pirlower.PS, pirlower.PDF

4. The Multiparty Communication Complexity of Exact-$T$: Improved Bounds and New Problems. (with Richard Beigel and James Glenn), Mathematical Foundations of Computer Science 2006. (I post the long version, which is not the same as the conference version. It has more in it.) multicomm.PS, multicomm.PDF

5. Lower bounds on the Deterministic and Quantum Communication Complexity of $HAM_n^a$. (with A. Ambains, A. Srinivasan, A. Utis) Proceedings of the 17th International Symposisum on Algorithms (ISAAC), 2006. HAM.PS, HAM.PDF

6. The Complexity of Learning SUBSEQ(A) (with Stephen Fenner) Algorithmic Learning Theory 2006. (Journal version to have Brian Postow added as co-author) learnsubseq.PS, learnsubseq.PDF

7. Constant Time Parallel Sorting: An Empirical View (with E. Golub and C. Kruskal) Journal of Computer and Systems Science Vol 67, 2003, pages 63-91. emp-p-sort.PS, emp-p-sort.PDF,

8. Some connections between bounded query classes and non-uniform complexity (with A. Amir and R. Beigel), Information and Computation Vol 186, 2003, 104-139. Earlier Version in CCC90. Link is to long version that is also at eccc archive. NONUNIFORM.PS, NONUNIFORM.PDF

9. 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. pirsurvey.PS, pirsurvey.PDF

10. When Does a Random Robin Hood Win? (with E. Golub and A. Srinivasan) Theoretical Computer Science Vol 304, 2003, pages 477-484. robinhood.PS, robinhood.PDF

11. Gems in the field of bounded queries. Computability and Models Edited by Cooper and Goncharov. 2003. GEMS.PS, GEMS.PDF

12. Automata Techniques for Query Inference Machines (with G. Hird), Annals of Pure and Applied Logic Vol. 117, 171-203, 2002. AUT-TECH-QUERY-INF.PS, AUT-TECH-QUERY-INF.PDF Earlier version in COLT95, with title Reduction in Learning via Queries

13. Max and min limiters (with James Owings and Georgia Martin), Archives of Mathematical Logic Vol. 41, 2002, pp 483-495. MAX-MIN-DELIM.PS, MAX-MIN-DELIM.PDF

14. AHA: An Illuminating Perspective. (With Dan Garcia and David Ginat) Thirty third annual SIGCSE Technical Symposium on Computer Science Education, Feb 2002. (AHA.PDF)

15. The P$=$?NP Poll. SIGACT NEWS 2002. Complexity Theory Column. POLL.PS, POLL.PDF

16. The Communication Complexity of Enumeration, Elimination, and Selection (with Andris Ambainis, Harry Buhrman, Bala Kalyanasundaram, Leen Torenvliet) Vol 63., pages 148-185, 2001. (Special issue for COMPLEXITY 2000). COMM.PS, COMM.PDF

17. 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. SURVEY-CONST-TIME-SORTING.PS SURVEY-CONST-TIME-SORTING.PDF

18. Squares in a Square: An On-line question (with A.Ambainis). Geocombinatorics, Vol X, No 1, 2000 SQUARES.PS, SQUARES.PDF.

19. Computability, Handbook of Discrete and Combinatorial Mathematics. Edited by Kenneth Rosen. Published by CRC Press (Boca Raton, Florida). COMPUT.PS COMPUT.PDF

20. The Complexity of ${\rm ODD}_n^A$ (with R. Beigel, M. Kummer, G. Martin, T. McNichol, and F. Stephan) Journal of Symbolic Logic, Vol. 65, 1-18, 2000. Earlier Version in MFCS96. ODD.PS, ODD.PDF

21. A techniques-oriented survey of bounded queries. (with Frank Stephan). Models and Computability (invited papers from Logic Colloquium '97) (Lecture Note Series 259), Editted by Cooper and Truss. London Mathematical Society 117-156, 1999. Forschungsberichte Mathematische Logik 32 / 1998, Mathematisches Institut, Universitaet Heidelberg, Heidelberg, 1998. BDQ-SURVEY-TECH.PS, BDQ-SURVEY-TECH.PDF

22. On the Number of Automorphisms of a Graph (with R. Beals, R. Chang and J. Toran), Chicago Journal of Theory. Feburary 1999. Earlier version in CCC95. NUMAUTO.PS, NUMAUTO.PDF

23. When can one load a set of dice so that the sum is uniformily distributed? (with C. Kruskal) Mathematics Magazine. Vol. 72, No. 2, 1999, pp 133-138. DICE.PS, DICE.PDF

24. 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 RCOMBSUR.PS, RCOMBSUR.PDF

25. Addition in $\log_2{n} + O(1)$ Steps on Average: A Simple Analysis (with R. Beigel, M. Li, L. Zhang), Theoretical Computer Science. Vol 191, 1998, 245-248. ADD.PS ADD.PDF

26. Recursion theory and Reverse Mathematics (with Jeffery Hirst). Mathematical Logic Quarterly. Vol. 44, 1998, 465-473. RR.PS, RR.PDF

27. On the Finiteness of the Recursive Chromatic Number (with A. Lee). Annals of Pure and Applied Logic Vol. 93, 73-81, 1998. FINITE-REC-CHROM-NUMBER.PS FINITE-REC-CHROM-NUMBER.PDF

28. Classification via Information (with M. Plezskoch, M. Velauthapillai, and F. Stephan), Annals of Mathematics and Artificial Intelligence. Vol. 23, 147-168, 1998. CLASSIFICATION.PS, CLASSIFICATION.PDF Earlier version in ALT94.

29. Relative Sizes of Learnable Sets (with L. Fortnow, R. Freivalds, M. Kummer, S. Kurtz, C. Smith, and F. Stephan), Theoretical Computer Science Vol 197(1-2):139-156, 1998. Earlier version in ICALP95 with the name Measure, Category, and Learning Theory MEASURE.PS, MEASURE.PDF

30. Bounded Queries in Recursion Theory (With Georgia Martin). Birkhauser. 1998.

31. Bounded Queries and Approximation (with R. Chang and C. Lund), SIAM Journal of Computing, Vol. 26, 1997, 188-209 BDQAPPROX.PS, BDQAPPROX.PDF Earlier version in FOCS93 did not have Lund as co-author.

32. Implementing WS1S via Finite Finite Automata. Automata Implementation. (with James Glenn) In Workshop on Implementing Automata-1996 Edited by Raymond, Wood, and Yu. Lecture Notes in Computer Science 1260. 1997 WIA96.PS, WIA96.PDF

33. Binary search and recursive graph problems (with K. Guimaraes) Theoretical Computer Science Vol 181, 1997, 119-139. (Special issue for LATIN 95 conference). BINARY.PS, BINARY.PDF Subsumeds the conference papers On the number of components of a recursive graph from LATIN 92. and Unbounded search and recursive graphs from LATIN 95.

34. Asking Questions Versus Verifiability (with M. Velauthapillai), Fundamenta Informaticae Vol. 30, 1-9, 1997 VERIFY.PS VERIFY.PDF Earlier version in AII92.

35. 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. LVQSUR.PS, LVQSUR.PDF.

36. The Complexity of Problems, Advances in Computers Volume 43. Edited by Marvin Zelkowitz. Published by Academic Press. 1996. COMPLEXITY.PS, COMPLEXITY.PDF

37. Frequencey Computation and Bounded Queries (with R. Beigel and E. Kinber) Theoretical Computer Science, Vol. 163, 1996, 177-192. Earlier version in CCC95. BDQFREQ.PS, BDQFREQ.PDF

38. Learning via Queries with Teams and Anomalies (with E. Kinber, M. Pleszkoch, C. Smith, and T. Zeugmann), Fundamenta Informaticae, Vol. 23, Number 1, May 1995, pp. 67-89. LVQTEAMS.PS, LVQTEAMS.PDF Earlier version in COLT90.

39. Recursion theoretic models of learning: some results and intuitions, (with C. Smith) Annals of Mathematics and Artificial Intelligence, Vol. 15, II, 1995, pp. 155-166. MODELS.PS, MODELS.PDF

40. OptP-Completeness as the Normal Behavior of NP-Complete Problems (with M. Krentel and K. Rappoport), Math Systems Theory, Vol. 28, 1995, 487-514 BDQOPT.PS, BDQOPT.PDF

41. Extremes in the Degrees of Inferability (with L. Fortnow, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, F. Stephan, R. Solovay), Annals of Pure and Applied Logic, Vol. 66, 1994, pp. 231-276. EXTREMES.PS, EXTREMES.PDF Subsumes both Learning via Queries to an Oracle from COLT89 and Degrees of Inferability from COLT92.

42. On Honest Polynomial Reductions and P$=$NP (with R. Downey, and M. Moses), Annals of Pure and Applied Logic, Vol. 70, 1994, pp. 1-27. Earlier version in CCC89. HONEST.PS, HONEST.PDF (The version on line is the CCC89 version.)

43. Terse, Superterse, and Verbose Sets (with R. Beigel, J. Gill, and J. Owings), Information and Computation, Vol. 103, 1993, pp. 68-85, 1993. BDQTERSE.PS, BDQTERSE.PDF

44. On Checking Versus Evaluation of Multiple Queries (with Lane Hemachandra and Albrech Hoene), Information and Computation, Vol. 105, 1993, pp. 72-93. CHECK.PS, CHECK.PDF Earlier version in MFCS90.

45. 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 Birkhaeuser, Boston.

46. Learning via Queries to $[+,<]$ (with M. Pleszkoch and R. Solovay), Journal of Symbolic Logic, LVQPLUS.PS, LVQPLUS.PDF Earlier version in COLT90

47. Learning Programs with an Easy to Calculate Set of Errors (with Rameshkumar Sitarman, C. Smith, and Mahendran Velauthapillai), Fundamentica Informaticae, Vol. 16, No. 3-4, pp. 355-370, 1992. ERRORS.PS, ERRORS.PDF Earlier version appearedin COLT88 and AII89.

48. Learning via Queries (with C. Smith), Journal of the Association of Computing Machinery, Vol. 39, 1992, pp. 649-675. LVQ.PS, LVQ.PDF, Earlier versions appeared at COLT88 and FOCS88.

49. Selection Problems using $m$-ary queries (with K. Guimaraes and J. Purtilo), Computational Complexity, Vol. 2, 1992, pp. 256-276. ARITY.PS, ARITY.PDF

50. The Mapmaker's Dilemma (with R. Beigel), Discrete Applied Math (Special Issue on Theoretical Computer Science), Vol. 34, 1991, pp. 37-48. MAP.PS, MAP.PDF

51. On Selecting the $k$ Largest with Restricted Quadratic Queries, Information Processing Letters, Vol. 38, 1991, pp. 193-195.

52. A Survey of Bounded Queries in Recursion Theory, Sixth Annual Conferences on Structure in Complexity Theory, Chicago, June 1991. BDQSUR.PS, BDQSUR.PDF

53. Training Sequences (with D. Angluin and C. Smith), Theoretical Computer Science, Vol. 66, 1989, pp. 255-272. TRAINING.PS, TRAINING.PDF Earlier version without Angluin at AII86 was called On the inference of sequences of functions

54. On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case (with R. Beigel), Annals of Pure and Applied Logic, Vol. 45, 1989, pp. 1-38. FIND_CHROM_NUMBER_1.PS, FIND_CHROM_NUMBER_1.PDF

55. On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case (with R. Beigel), Annals of Pure and Applied Logic, Vol. 45, 1989, pp. 227-247. FIND_CHROM_NUMBER_2.PS, FIND_CHROM_NUMBER_2.PDF

56. Bounded Query Classes and the Difference Hierarchy (with R. Beigel and L. Hay), Archive for Math. Logic, Vol. 29, 1989, pp. 69-84. BDQDIFF.PS, BDQDIFF.PDF

57. Nondeterministic Bounded Query Reducibilities (with R. Beigel, and J. Owings), Annals of Pure and Applied Logic, Vol. 41, 1989, pp. 107-118. BDQ_NONDET.PS, BDQ_NONDET.PDF

58. Polynomial Terse Sets (with A. Amir), Information and Computation, Vol. 77, No. 1, 1988, pp. 37-56. Earlier version in CCC87.

59. Oracles for Deterministic vs. Alternating Classes, SIAM Journal of Computing, Vol. 16, Aug 1987, pp. 613-627.

60. 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.

61. Relativizations Comparing NP and Exponential Time (with S. Homer), Information and Control, Vol. 58, July 1983, pp. 88-100.