P
Peter G. Kimmel
Researcher at University of Chicago
Publications - 6
Citations - 306
Peter G. Kimmel is an academic researcher from University of Chicago. The author has contributed to research in topics: Communication complexity & Strategic dominance. The author has an hindex of 5, co-authored 6 publications receiving 293 citations. Previous affiliations of Peter G. Kimmel include Northeastern Illinois University.
Papers
More filters
Proceedings ArticleDOI
Randomized simultaneous messages: solution of a problem of Yao in communication complexity
László Babai,Peter G. Kimmel +1 more
TL;DR: A.C. Yao (1979) as discussed by the authors showed that the deterministic two-player SM complexity of any function is at least the square root of its deterministic deterministic SM complexity.
Journal ArticleDOI
Communication Complexity of Simultaneous Messages
TL;DR: This paper studies the SIMULTANEOUS MESSAGES (SM) model of multiparty communication complexity, a restricted version of the CFL game in which the players are not allowed to communicate with each other, and proves lower and upper bounds on the SM complexity of several classes of explicit functions.
Book ChapterDOI
Simultaneous messages vs. communication
TL;DR: In the multiparty communication game introduced by Chandra, Furst, and Lipton [CFL] (1983), k players wish to evaluate collaboratively a function f(x0,⋯, xk−1 for which player i sees all inputs except x i .
Proceedings ArticleDOI
The cost of the missing bit: communication complexity with help
TL;DR: The multiparty communication model of Chandra, Furst, and Lipton (1983) is generalized to functions with b-bit output, and new families of explicit boolean functions for which Ω(n/ck) bits of communication are required to find the “missing bit” are constructed.
Journal ArticleDOI
The Cost of the Missing Bit: Communication Complexity with Help
TL;DR: The multiparty communication model of Chandra, Furst, and Lipton (1983) is generalized to functions with b-bit output, and families of explicit functions for which bits of communication are required to find the "missing bit" are constructed.