Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function

This publication has 16 references indexed in Scilit:

• Upper bound on the communication complexity of private information retrieval
  Published by Springer Nature ,1997
• Upper bounds on multiparty communication complexity of shifts
  Published by Springer Nature ,1996
• Simultaneous messages vs. communication
  Published by Springer Nature ,1995
• The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
  Information and Computation, 1994
• Rounds in Communication Complexity Revisited
  SIAM Journal on Computing, 1993
• The computational complexity of universal hashing
  Theoretical Computer Science, 1993
• Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
  Journal of Computer and System Sciences, 1992
• On the power of small-depth threshold circuits
  computational complexity, 1991
• Threshold circuits of bounded depth
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Multi-party protocols
  Published by Association for Computing Machinery (ACM) ,1983