30 results on '"Fich, Faith E."'
Search Results
2. Short Headers Suffice for Communication in a DAG with Link Failures
3. Separating the power of EREW and CREW PRAMs with small communication width
4. Limits on the power of parallel random access machines with weak forms of write conflict resolution
5. Optimal Bounds for the Predecessor Problem and Related Problems
6. A tradeoff between search and update time for the implicit dictionary problem
7. A characterization of a dot-depth two analogue of generalized definite languages
8. The parallel complexity of exponentiating polynomials over finite fields.
9. Simulations among concurrent-write PRAMs
10. A characterization of a dot-depth two analogue of generalized definite languages
11. A tradeoff between search and update time for the implicit dictionary problem
12. A tradeoff between search and update time for the implicit dictionary problem
13. Optimal bounds for the predecessor problem
14. Separating the Power of EREW and CREW PRAMs with Small Communication Width
15. Pointers versus Arithmetic in PRAMs
16. Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution
17. Permuting in Place
18. Lower bounds for the cycle detection problem.
19. Toward Understanding Exclusive Read
20. Relations between Concurrent-Write Models of Parallel Computation
21. Relations between concurrent-write models of parallel computation
22. Lower bounds for the cycle detection problem
23. Languages of R-trivial monoids
24. Bounds for width two branching programs
25. New bounds for parallel prefix circuits
26. A homomorphic characterization of regular languages
27. On generalized locally testable languages
28. A generalized setting for fixpoint theory
29. Bounds for Width Two Branching Programs
30. Languages of [formula omitted]-trivial monoids
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.