1. A. Apostolakis, P. Coddington, and E. Marinari. A multi-grid cluster labeling scheme. Europhysics Letters, 17(3):189–194, 1992.
2. G. Barnes, J.F. Buss, W.L. Ruzzo, and B. Schieber. A sublinear space, polynomial time algorithm for directed s — t connectivity. In Proceedings of the 7th
Annual Structure in Complexity Theory Conference, pages 27–33, 1992.
3. G. Barnes and W.L. Ruzzo. Deterministic algorithms for undirected s — t connectivity using polynomial time and sublinear space. In Proceedings of the 23rd
ACM Symposium on the Theory of Computing, pages 43–53, 1991.
4. C. H. Bennett. How to define complexity in physics, and why. In W. H. Zurek, editor, Complexity, Entropy and the Physics of Information, pages 137–148. Addison-Wesley, 1990.
5. R.C. Brower, P. Tamayo, and B. York. A parallel multi-grid algorithm for percolation clusters. Journal of Statistical Physics, 63(1/2):73–88, 1992.