1. A. Aggarwal, A. Bar-noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, Efficient Routing and Scheduling Algorithms for Optical Networks, in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania, 23–25 January 1994, pp. 412–423.
2. M. Ajtai, Generating Hard Instances of Lattice Problems, preprint 1996.
3. I. Barany, S. Onn, Colourful Linear Programming And its Relatives, Mathematics of Operations Research, to appear.
4. E.R. Berlekamp, R. McEliece, H. van Tilborg, On the Inherent Intractability of Certain Coding Problems, IEEE Transactions on Information Theory 24 (1978), pp.384–386.
5. M. Blum, R.M. Karp, O. Vornberger, C.H. Papadimitriou, M. Yannakakis, The Complexity of Testing Whether a Graph Is a Superconcentrator, Information Processing Letters 13 (1981), pp. 164–167.