Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. L. Adleman, Two theorems on random polynomial time, Proc. 19th IEEE Symposium on Foundations of Computer Science (1978), pp. 75–83.
2. B. Awerbuch and Y. Shiloach, New connectivity and MSF algorithms for ultracomputers and PRAM, Proc. IEEE conf. on parallel proc., 1983, 175–179.
3. P. Beame, Limits on the power of concurrent-write parallel machines, 18th ACM Symp. on Theory of Computing, Berkeley, 1986, pp. 169–176.
4. S.A Cook and C. Dwork, Bounds on the time for parallel RAM's to compute simple functions, Proc. 14th ACM Symp. on Theory of Computing, 1982, pp 231–233.
5. F. Fich, F. Meyer auf der Heide, P. Ragde, and A Wigderson, One, two, three, ..., infinity: lower bounds for parallel computation, 24th ACM Symp. on Theory of Computing, 1985, pp 48–58.