Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs
暂无分享,去创建一个
[1] Fabrizio Luccio,et al. A Visibility Problem in VLSI Layout Compaction , 1984 .
[2] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..
[3] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[4] Richard M. Karp,et al. A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .
[5] Richard Cole,et al. Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[6] Lynn Conway,et al. Introduction to VLSI systems , 1978 .
[7] Stephen A. Cook,et al. Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..