[AgAn]

A. Aggarwal, R. Anderson, “A random NC algorithm for depth first search,” *Proc. 19th Ann. ACM Symp. on Theory of Computing*, New York, NY, May 1987, pp. 325–334.

[AhHoUI]

A. V. Aho, J. E. Hoperoft, J. D. Ullman, The *Design and Analysis* of Computer *Algorithms*, Addison Wesley, 1974.

[AhUl]

A. V. Aho, J. D. Ullman, *Principles of Compiler Design*, Addison Wesley, 1977.

[AjKoSz]

M. Ajtai, J. Komlos, E. Szemeredi, “Sorting in clog n parallel steps,”

*Combinatorica*, vol. 3, 1983, pp. 1–19.

CrossRef[Al]

F. E. Allen, “Program optimization,” *Annual Rev. Automatic Prog*., vol. 5, Pergamon Press, 1969.

[At]

M. Attalah, private communication, 1985.

[ChLaCh]

F. Y. Chin, J. Lam. I. Chen, “Efficient parallel algorithms for some graph problems,”

*Comm. ACM*, vol. 25, 1982, p. 659–665.

CrossRef[Col]

R. Cole, “Parallel merge sort,” *Proc. 27th Ann. IEEE Symp. on Foundations of Comp*. Sci., Toronto, Canada, October 1986, pp. 511–516.

[Co]

S. A. Cook, “Towards a complexity theory for synchronous parallel computation,” *Enseign*. Math., *vol*. 27, *1981*,pp. 99–124.

[Co2]

S. A. Cook, “A taxonomy of problems with fast parallel algorithms,”

*Inform. Control*, vol. 64, 1985, pp. 2–22.

CrossRef[CoWi]

D. Coppersmith, S. Winograd, “Matrix multiplication via arithmetic progressions,” 19th *Ann. ACM Symp. on Theory of Computing*, New York, NY, May 1987, pp. 1–6.

[DoLiRe]

D. Dobkin, R. Lipton, S. Reiss, “Linear Programming is log space hard for P,”

*Inform. Proc*. Lett., vol. 8, 1979, pp. 96–97.

CrossRef[Ev]

S. Even, *Graph Algorithms*, Computer Science Press, Potomac, MD, 1979.

[Fl]

R. W. Floyd, “Assigning meanings to programs,” *Proc. Symp. Appl. Math*., 19, pp. 19–32, 1967.

[FoFu]

L. R. Ford, Jr., D. R. Fulkerson, *Flows in Networks*, Princeton Univ. Press, Princeton, NJ, 1962.

[GaTa]

H. Gabow, R. E. Tarjan, “A linear-time algorithm for a special case of disjoint set union,” *Proc. 15th Ann. ACM Symp. on Theory of Computing*, 1983, pp. 246–251.

[GhBh]

R. K. Ghosh, G. P. Bhattacharya, “Parallel search algorithm for directed acyclic graphs,” BIT, 1982.

[GoShSt]

L. Goldschlager, R. Staples, J. Staples, “Maximum flow problem is log space complete for P,” TCS, 1982, pp. 105–111.

[GoTa]

A. Goldberg, R. E. Tarjan, “A new approach to the maximum flow problem,” *Proc. 18th Ann. ACM Symp. on Theory of Computing*, Berkeley, CA, May 1986.

[Ha]

D. Harel, “A linear algorithm for finding dominators in flow graphs and related problems,” *17th Ann. Symp. on Theory of Computing*, Providence, RI, May 6–8, 1985, pp. 185–194.

[HeUI]

M. S Hecht, J. D. Ullman, “Characterization of reducible flow graphs,” *JACM*, 21. 3, 1974, pp. 167–175.

[HiChSa]

D. S. Hirschberg, A. K. Chandra, D. V. Sarwate, “Computing connected components on parallel computers,”

*Comm. ACM*, vol. 22, no. 8, 1979, pp. 461–464.

CrossRef[HoUI]

J. E. Hoperoft, J. D. Ullman, *Introduction* to Automata *Theory*, *Languages*, *and Computation*,Addison Wesley, 1979.

[KanRa]

A. Kanevsky, V. Ramachandran, “Improved algorithms for graph four connectivity,” *Proc. 28th Ann. IEEE Symp. on Foundations of Comp. Sci*., Los Angeles, CA, October 1987.

KarRa] R. M. Karp, V. Ramachandran, “Parallel Algorithms,” in *Handbook of Theoretical Computer Science*, *J*. Van Leeuwan, ed., North Holland, 1988, to appear.

[KaUpWi]

R. M. Karp, E. Upfal, A. Wigderson, “Constructing a perfect matching is in Random NC,” *Proc. 17th ACM Ann. Symp. on Theory of Computing*, 1985, pp. 22–32.

[K1Re]

P. Klein, *J*. H. Reif, “An efficient parallel algorithm for planarity,” *Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science*, Toronto, Canada, 1986, pp. 465–477.

[Ku]

L. Kucera, “Parallel computation and conflicts in memory access,” *Inform. Processing* Lett., 1982, pp. 93–96.

[La]

R. E. Ladner, “The circuit value problem is log space complete for P,” *SIGACT News*, vol. 7, no. 1, pp. 18–20.

[MaScVi]

Y. Maon, B. Schieber, U. Vishkin, “Parallel ear decomposition search (EDS) and *st* -numbering in graphs,” *Proc. Aegean Workshop on Computing*, Loutraki, Greece, 1986, Springer Verlag.

[MiRa]

G. L. Miller, V. Ramachandran, “A new graph triconnectivity algorithm and its parallelization,” *Proc. 19th Ann. ACM Symp. on Theory of Computing*, New York, NY, May 1987.

[MiRe]

G. L. Miller, *J*. H. Reif, “Parallel tree contraction and its application,” *FOCS*, 1985.

[MuVaVa]

K. Mulmuley, U. Vazirani, V. Vazirani, “Matching is as easy as matrix inversion,” *Proc. 19th Ann. ACM Symp. on* Theory *of Computing*, May 1987.

[PaSt]

C. H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: *Algorithms and Complexity*, Prentice-Hall, Englewood Cliffs, NJ, 1982.

[PaGoRa]

S. R. Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan, “Computing dominators in parallel,”

*Inform. Proc*. Lett., vol. 24, 1987, pp. 217–221.

CrossRef[Ral]

V. Ramachandran, “Finding a minimum feedback arc set in reducible graphs,” *Journal of Algorithms*,to appear.

[Ra2]

V. Ramachandran, “The complexity of minimum cut and maximum flow problems in an acyclic network,” *Networks*, 1987, pp. 387–392.

[Sh]

A. Shamir, “A linear time algorithm for finding minimum cutsets in reducible graphs,”

*SIAM J. Computing*, 8: 4, 1979, pp. 645–655.

CrossRef[ShVi]

Y. Shiloach, U. Vishkin, “An O(log n) parallel connectivity algorithm,”

*J. Algorithms*, vol. 3, 1982, pp. 57–63.

CrossRef[St]

V. Strassen, “The asymptotic spectrum of tensors and the exponent of matrix multiplication,” *Proc*. 27th *Ann. Symp. on Foundations of Comp*. Sci., 1986, pp. 49–54.

[Tal]

R. E. Tarjan, “Testing flow graph reducibility,” *JCSS*, 9: 3, 1974, pp. 355–365.

[Ta2]

R. E. Tarjan, Data *Structures and Network Algorithms*, SIAM, Philadelphia, PA, 1983.

[TaVi]

R. E. Tarjan, U. Vishkin, “Finding biconnected components and computing tree functions in logarithmic parallel time,” *FOCS*, 1984, pp. 12–22.

[Vi]

U. Vishkin, “Implementations of simultaneous memory address access in models that forbid it,”

*J. Algorithms*, vol. 4, 1983, pp. 45–50.

CrossRef[Vi2]

U. Vishkin, “Randomized speed-ups in parallel computation,” *Proc. 16th ACM Ann. Symp. on Theory of Computing*, 1984, pp. 230–239.