Fast connected components algorithms for the EREW PRAM
暂无分享,去创建一个
[1] Uriel Feige,et al. Short random walks on graphs , 1993, SIAM J. Discret. Math..
[2] Baruch Awerbuch,et al. New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM , 1987, IEEE Transactions on Computers.
[3] Hillel Gazit,et al. An optimal randomized parallel algorithm for finding connected components in a graph , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[4] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[5] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[6] Dilip V. Sarwate,et al. Computing connected components on parallel computers , 1979, CACM.
[7] Rüdiger Reischuk,et al. Exact time bounds for computing boolean functions on PRAMs without simultaneous writes , 1990, SPAA '90.
[8] Francis Y. L. Chin,et al. Efficient parallel algorithms for some graph problems , 1982, CACM.
[9] Y ChinFrancis,et al. Efficient parallel algorithms for some graph problems , 1982 .
[10] Donald B. Johnson,et al. A parallel algorithm for computing minimum spanning trees , 1992, SPAA '92.
[11] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[12] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[13] Donald B. Johnson,et al. Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[14] Noam Nisan,et al. Pseudorandom generators for space-bounded computations , 1990, STOC '90.
[15] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[16] Tak Wah Lam,et al. Finding connected components in O(log n loglog n) time on the EREW PRAM , 1993, SODA '93.
[17] Noam Nisan,et al. On read-once vs. multiple access to randomness in logspace , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[18] Endre Szemerédi,et al. Undirected Connectivity in O(log ^1.5 n) Space , 1992, FOCS.
[19] E. Szemerédi,et al. Undirected connectivity in O(log/sup 1.5/n) space , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[20] Stephen A. Cook,et al. Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..
[21] Rüdiger Reischuk,et al. Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs , 1994, J. Comput. Syst. Sci..
[22] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[23] Endre Szemerédi,et al. Undirected Connectivity in O(l~gl*~ n) Space* , 1992 .
[24] Richard Cole,et al. Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[25] Richard Cole,et al. Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms , 1991, Inf. Comput..
[26] Walter L. Ruzzo,et al. Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space. , 1991, STOC '91.