%%% ToC#319 Haastad-Wigderson  rev LB 09-24 rev DB 09-24

@inproceedings{BFS86,
author="L. Babai and P. Frankl and J. Simon",
title="Complexity classes in communication complexity theory",
booktitle="Proc. 27th FOCS",
publisher="IEEE Computer Society",
year="1986",
pages="337--347"}

@inproceedings{BK97,
author="L. Babai and P. Kimmel",
title="Randomized simultaneous messages: solution of a problem of Yao
     in communication complexity",
booktitle="Proc. 12th IEEE Symp. on Computational Complexity",
publisher="IEEE Computer Society",
year="1997",
pages="239--246",
eprint="ccc:10.1109/CCC.1997.612319"}

@article{BJKS04,
author="Z. Bar-Yossef and T. S. Jayram and R. Kumar and D. Sivakumar",
title="Information Statistics Approach to Data Stream and Communication
Complexity",
journal="J. of Computer and System Sciences",
volume="68",
year="2004",
pages="702--732",
eprint="jcss:10.1016/j.jcss.2003.11.006"}

@book{J01,
author="S. Jukna",
title="Extremal Combinatorics",
publisher="Springer Verlag",
year="2001"}

@book{KN97,
author="E. Kushilevitz and N. Nisan",
title="Communication Complexity",
publisher="Cambridge University Press",
year="1997"}

@article{KS92,
author="B. Kalyanasundaram and G. Schnitger",
title="The probabilistic communication complexity of set intersection",
journal="SIAM J. on Discrete Mathematics",
volume="5",
year="1992",
pages="545--557",
eprint="sidma:10.1137/0405044"}

@article{N91,
author="I. Newman",
title="Private vs. common random bits in communication complexity",
journal="Information Processing Letters",
volume="39",
pages="67--71",
year="1991",
eprint="ipl:10.1016/0020-0190(91)90157-D"}

@inproceedings{NS96,
author="I. Newman and M. Szegedy",
title="Public vs. Private Coins Flips in One Round Communication Games",
booktitle="Proc. 28th STOC",
publisher="ACM Press",
year="1996",
pages="561--570",
eprint="stoc:237814.238004"}

@unpublished{NS06,
author="N. Nisan and I. Segal",
title="The communication requirements of efficient allocations and supporting Lindhal prices",
year = 2004,
pdf="http://www.cs.huji.ac.il/~noam/prices.pdf"}

@inproceedings{PRW97,
author="I. Parnafes and R. Raz and A. Wigderson",
title="Direct product results and the {GCD} problem in old and new communication models",
booktitle="Proc. 29th STOC",
publisher="ACM Press",
year="1997",
pages="363--372",
eprint="stoc:258533.258620"}

@article{R92,
author="A. A. Razborov",
title="The distributional complexity of disjointness",
journal="Theoretical Computer Science",
volume="106",
pages="385--390",
year="1992",
eprint="tcs:10.1016/0304-3975(92)90260-M"}

@article{RW92,
author="R. Raz and A. Wigderson",
title="Monotone Circuits for Matching require Linear Depth",
journal="Journal of the ACM",
volume="39",
pages="736--744",
year="1992",
eprint="jacm:146637.146684"}

@inproceedings{Y79,
author="A. C.-C. Yao",
title="Some complexity questions related to distributive computing",
booktitle="Proc. 11th STOC",
publisher="ACM Press",
year="1979",
pages="209--213",
eprint="stoc:800135.804414"}

\end{thebibliography}
\end{document}