Author:
Beame Paul,Fich Faith E.,Sinha Rakesh K.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference12 articles.
1. P. Beame, 1986, Lower Bounds in Parallel Machine Computation, Department of Computer Science, University of Toronto
2. Upper and lower time bounds for parallel random access machines without simultaneous writes;Cook;SIAM J. Comput.,1986
3. M. Dietzfelbinger, M. Kutyłowski, R. Reischuk, 1990, Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes, Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, Crete, 125, 135
4. Parallel random access machines with owned global memory and deterministic context-free language recognition;Dymond;Lecture Notes in Computer Science,1986
5. The complexity of computation on the parallel random access machine;Fich,1993
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献