Peter G. Kimmel

According to our database, Peter G. Kimmel authored at least 5 papers between 1995 and 2003.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2003

Communication Complexity of Simultaneous Messages.

László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam

SIAM J. Comput., 2003

1998

Beating a Finite Automaton in the Big Match.

Lance Fortnow, Peter G. Kimmel

Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-98), 1998

The Cost of the Missing Bit: Communication Complexity with Help.

László Babai, Thomas P. Hayes, Peter G. Kimmel

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity.

László Babai, Peter G. Kimmel

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1995

Simultaneous Messages vs. Communication.

László Babai, Peter G. Kimmel, Satyanarayana V. Lokam

Proceedings of the STACS 95, 1995