1. N. Alon, P. Frankl, and V. Rödl. Geometrical realization of set systems and probabilistic communication complexity. In Proceedings of the 26th Symposium on Foundations of Computer Science, pages 277–280. IEEE Computer Society Press, 1985.
2. Rosa I. Arriaga and Santosh Vempala. An algorithmic theory of learning: Robust concepts and random projection. In Proceedings of the 40’th Annual Symposium on the Foundations of Computer Science, pages 616–623, 1999.
3. Béla Bollobás. Extremal Graph Theory. Academic Press, 1978.
4. Juergen Forster. A linear bound on the unbounded error probabilistic communication complexity. In Proceedings of the 16th Annual Conference on Computational Complexity. IEEE Computer Society Press, 2001. To appear.
5. Juergen Forster, Niels Schmitt, and Hans Ulrich Simon. Estimating the optimal margins of embeddings in Euclidean half spaces. This proceedings.