1. N. Alon: A parallel algorithmic version of the Local Lemma. InProceedings of the 32nd Annual Symposium on Foundations of Computer Science (1991), 586?593.
2. J. Beck: An algorithmic approach to the Lov�sz Local Lemma I.Random Structures and Algorithms, to appear.
3. R. Koch, T. Leighton, B. Maggs, S. Rao, andA. Rosenberg: Work-preserving emulations of fixed-connection networks. InProceedings of the 21st Annual ACM Symposium on Theory of Computing May 1989, 227?240.
4. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, andD. B. Shmoys: Sequencing and scheduling: Algorithms and complexity. Technical Report BS-R8909, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, June 1989.
5. F. T. Leighton:Introduction to Parallel Algorithms and Architectures: Arrays ? Tree ? Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.