Invited Talks

1. Priority arguments in Complexity Theory, March 31, 1982, MIT Logic Seminar.
2. Recursion Theory and Cryptography, December 2, 1983, MIT Computer Science.
3. On Almost all Oracles, March 12, 1984, MIT Computer Science Seminar.
4. Recursive Graph Theory, September 16, 1984, MIT Logic Seminar.
5. Oracles: Three New Results. October 11 1984, Maryland Special Year in Logic and Theoretical Computer Science.
6. Binary Search is Optimal for Recursive Graph Theory, October 1, 1986, Computer Science Research Seminar at Univ. of Maryland at Baltimore Campus.
7. Sparse Sets in NP, October 17, 1986, Computer Science Theory Seminar at John Hopkins Univ..
8. Polynomial Terseness, November 21, 1986, Boston Area Theory Seminar at Boston Univ..
9. Binary Search is Optimal for Recursive Graph Theory, November 24, 1986, Harvard Computer Science Colloquium, Harvard Univ..
10. Terse, Superterse, and Verbose Sets, November 25, 1986, MIT Logic Seminar.
11. Terse and Verbose Sets, April 17, 1987, Carnegie-Mellon Univ. Computer Science Seminar.
12. Recursive Graph Theory and Bounded Queries. October 20, 1987, State Univ. of NY at Stonybrook, Computer Science Seminar.
13. Parity Cannot be computed in Constant Depth: The Algebraic Approach. April 10, 1988, George Washington Univ. Combinatorics and Computing Seminar.
14. Proving Context-free Languages Inherently Ambiguous using Complex Analysis. October 28, 1988, George Washington Univ. Combinatorics and Computing Seminar.
15. If you ask more Questions you can learn more stuff. November 11, 1988, George Washington Univ. Math Colloquium.
16. A Short Course in Recursive Graph Theory. December 2, 9, and 16, 1988. George Washington Univ. Combinatorics and Computing Seminar.
17. Applications of Ramsey Theory to Computer Science. March 24, 1989. George Washington Univ. Combinatorics and Computing Seminar.
18. If you ask more questions, you can learn more stuff. Rutgers Univ., April 20, 1989.
19. Suppose they gave a talk and nobody came? (A nonconstructive approach to algorithms) October 3, 1989 National Science Foundation.
20. If you ask more questions, you can learn more stuff. Dartmouth Univ., October 12, 1989
21. If you ask more questions, you can learn more stuff. Univ. of Delaware, October 25, 1989
22. Circuit Computing: Computing with one hand tied behind your back. George Washington Univ. Combinatorics and Computing Seminar. October 27, 1989.
23. Learning via Queries: Connections to Logic, MIT Logic Seminar, November 3, 1989.
24. If you ask more questions, you can learn more stuff. Harvard Univ., November 9, 1989.
25. Suppose they gave a talk and nobody came? (A nonconstructive approach to algorithms) SRC, November 28, 1989
26. Suppose they gave a talk and nobody came? (A nonconstructive approach to algorithms) George Washington Univ. Combinatorics and Computing Seminar. March 9, 1990
27. Why graph properties are hard. George Washington Univ. Combinatorics and Computing Seminar. Oct 19, 1990
28. Learning via Queries: A Survey. Cornell Univ. November 15, 1990
29. The Complexity of Problems. George Washington Univ.. March 1, 1991.
30. The Complexity of Problems. Univ. of Idaho at Moscow. March 5, 1991.
31. The Complexity of Problems. Boston Univ.. March 27, 1991.
32. Evasive Boolean functions. Yale Univ.. September 25, 1991
33. The Complexity of Problems. Univ. of Georgia at Athens. October 19, 1991.
34. Learning via Queries can learn more stuff. Univ. of Chicago November 18, 1991.
35. Learning via Queries Univ. of Illinois at Urbana. November 22, 1991
36. Learning via Queries, Univ. of Wellington (New Zealand). March 10, 1992.
37. The Univ. of Southern Maine, The Complexity of Problems. April 24, 1992.
38. The Complexity of Problems, Univ. of Maine, April 27, 1992.
39. The Complexity of Problems, Appalachia State Univ., November 20, 1992.
40. The Complexity of Problems, Georgetown Univ., April 27, 1993.
41. Learning via Queries Univ. of Karlsruhe, Germany. Feb. 18, 1994.
42. The Complexity of Problems. West Virginia Univ., Nov 10, 1994
43. The Complexity of Problems. Virginia Tech,. Oct 11, 1995.
44. Learning via Queries, University of Kentucky. Oct 10, 1996.
45. Complexity based on the number of queries University of Kentucky. Oct 11, 1996.
46. Complexity based on the number of queries MIT, March 5, 1997
47. Learning via Queries, Harvard University, March 6, 1997.
48. Complexity based on the number of queries. Boston University. March 7, 1997
49. Complexity based on the number of queries. University of Illinois at Urbana May 2, 1997
50. Complexity based on the number of queries. University of Chicago May 5, 1997
51. Complexity based on the number of queries. University of Wisconsin at Madison May 6, 1997
52. Loaded Dice. Haverford University. October 1998.
53. Learning via Queries. University of Turin (Italy). October 1998.
54. Bounded queries in recursion theory (3 lectures). University of Sienna (Italy). October 1998.
55. Leaving via queries. (3 lectures). University of Sienna (Italy). October 1998.
56. Concrete Complexity. (3 lectures). University of Sienna (Italy). November 1998.
57. Parallel Sorting: an empirical view. New Mexico State University. November 1998
58. Bounded queries in recursion theory. University of Texas at El Paso November 1998.
59. When can one load dice to get uniform sums?. University of Dallas. November 1998.
60. Bounded queries in recursion theory. University of North Texas. November 1998.
61. A game over omega. MIT February 1999.
62. Parallel Sorting: an empirical view. Boston University. February 1999.
63. Parallel Sorting: an empirical view. Brown University. February 1999.
64. Bounded Queries in Recursion Theory (3 lectures). Notre Dame. April 1999.
65. Bounded Queries in Recursion Theory University of Chicago. April 1999.
66. Parallel Sorting: an empirical view. University of Illinois at Chicago. April 1999.
67. The Communication Complexity of Enumeration, Elimination, and Selection. University of Austin and Texas. April 2000.
68. Bridging the Gap between Math Games and Fun Games. New Mexico State University. April 2000.
69. Bridging the Gap between Math Games and Fun Games. University of North Texas. April 2000.
70. Bridging the Gap between Math Games and Fun Games. University of Dallas. April 2000.
71. Learning via Queries. University of Texas at El Paso. April 2000.
72. Interesting Math Problems coming out of Computer Science. MAA meeting. Washington DC. November 2000.
73. Reverse and Recursive Combinatorics. Carnegie-Mellon University. April 2001.
74. Reverse and Recursive Combinatorics. Georgetown University. April 2001.