**
Theory Seminar
2001-2002
Academic Year
**

September 17, 2001
| Theory of Computing Seminar
Quantum Information Processing: What, How and Why?
Dieter van Melkebeek, University of Wisconsin - Madison |

September 24, 2001
| Theory of Computing Seminar
On the Average-Case Hardness of CVP
Jin-Yi Cai, University of Wisconsin - Madison |

October 1, 2001
| Theory of Computing Seminar
Some Combinatorial Problems Motivated by Cryptography
Eric Bach, University of Wisconsin - Madison |

October 8, 2001
| Theory of Computing Seminar
The Distribution of Squarefree Smooth Integers in Short Intervals
Denis Charles, University of Wisconsin - Madison |

October 15, 2001
| Theory of Computing Seminar
Locating Nested Repeats in DNA Sequences
Deborah Joseph, University of Wisconsin - Madison |

October 22, 2001
| Theory of Computing Seminar
Technological Challenges of Quantum Computing
Robert Joynt, Dept. of Physics, University of Wisconsin - Madison |

October 29, 2001
| Theory of Computing Seminar
Context Sensitive String Matching
Venkat Chakaravarthy, University of Wisconsin - Madison |

November 5, 2001
| Theory of Computing Seminar
Combinatorial Analysis of Quantum Random Walks
Eric Bach, University of Wisconsin - Madison |

November 12, 2001
| Theory of Computing Seminar
On the Quantum Complexity of Majority
Dieter van Melkebeek, University of Wisconsin - Madison |

November 26, 2001
| Theory of Computing Seminar
Sequential and Parlallel Algorithms for Mixed Packing and Covering
Neal Young, Akamai Technologies |

January 28, 2002
| Theory of Computing Seminar
Theory and Potential Applications of Quantum Information Processing
John Watrous, University of Calgary |

January 29, 2002
| Theory of Computing Seminar
Quantum Interactive Proof Systems
John Watrous, University of Calgary |

February 18, 2002
| Theory of Computing Seminar
On the Minimum volumne of a Perturbed Unit Cube
Jin-Yi Cai, University of Wisconsin - Madison |

February 25, 2002
| Theory of Computing Seminar
Biological Computation from a Mathematical Viewpoint
Amir Assadi, Dept. of Mathematics, University of Wisconsin - Madison |

March 4, 2002
| Theory of Computing Seminar
Recognizing String Graphs in NP
Daniel Stefankovic, University of Chicago |

March 11, 2002
| Theory of Computing Seminar
Counting Lattice Vectors (Part I)
Denis Charles, University of Wisconsin - Madison |

April 1, 2002
| Theory of Computing Seminar
On the prime factors of shifted primes
Antal Balog, Renyi Institute, Budapest |

April 3, 2002
| Theory of Computing Seminar
The History of Communications and its Implications for the Internet
Andrew Odlyzko, University of Minnesota |

April 8, 2002
| Theory of Computing Seminar
Sparse coding as a principle of image representation in visual cortex
Bruno Olshausen, University of California - Davis |

April 15, 2002
| Theory of Computing Seminar
Computational Depth
Lance Fortnow, NEC Research Institute |

April 16, 2002
| Theory of Computing Seminar
Computational Property Testing
Lance Fortnow, NEC Research Institute |

April 22, 2002
| Theory of Computing Seminar
Counting Lattice Vectors (Part II)
Denis Charles, University of Wisconsin - Madison |

April 29, 2002
| Theory of Computing Seminar
Computability and Complexity of Pointer Analysis
Venkat Chakaravarthy, University of Wisconsin - Madison |