Parallel random access machines with bounded memory wordsize
暂无分享,去创建一个
[1] Richard J. Lipton,et al. Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..
[2] Alok Aggarwal,et al. On communication latency in PRAM computations , 1989, SPAA '89.
[3] Marc Snir,et al. On Parallel Searching , 2011, SIAM J. Comput..
[4] Faith Ellen,et al. Relations between concurrent-write models of parallel computation , 1984, PODC '84.
[5] Ludek Kucera,et al. Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.
[6] Friedhelm Meyer auf der Heide,et al. One, two, three . . . infinity: lower bounds for parallel computation , 1985, STOC '85.
[7] Ming Li,et al. New lower bounds for parallel computation , 1986, STOC '86.
[8] Uzi Vishkin,et al. Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..
[9] Paul Beame,et al. Limits on the power of concurrent-write parallel machines , 1986, STOC '86.
[10] Stephen A. Cook,et al. Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..
[11] Johan Håstad,et al. Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.
[12] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.