Peter G. Kimmel

Graduate Student in Computer Science at the University of Chicago.

``Simultaneous Messages vs. Communication'' (journal version of STACS paper below, to be submitted), with Laszlo Babai, Anna Gal, and Satyanarayana V. Lokam, August 25, 1996.
``Randomized Simultaneous Messages,'' with Laszlo Babai. To appear in the 12th Annual IEEE Conference on Communication Complexity, June 1997.
``Simultaneous Messages vs. Communication,'' with Laszlo Babai and Satyanarayana V. Lokam. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Springer, March 1995, pp. 361-372.
``Beating A Finite Automaton in the Big Match,'' with Lance Fortnow. Technical Report 94-21, November 23, 1994, and submitted to Journal of Computer and System Sciences.
``A Note on Step Satisfiable Boolean Formulas''. Technical Report TR-93-09, July 21, 1993.
``Reducing the Rank of Lower Triangular All-Ones Matrices,'' with Amber Settle. Technical Report 92-21, November 6, 1992.

kimmel@cs.uchicago.edu
Last updated: November 8, 1996