Restricted CRCW PRAMs

DOI10.1016/0304-3975(94)90138-4zbMath0801.68051OpenAlexW2044515180MaRDI QIDQ1314395

Naomi Nishimura

Publication date: 22 February 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90138-4

zbMATH Keywords

PRAMcontext-free languagesCOMMON CRCW PRAMwrite-determination

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Parallel time O(log n) recognition of unambiguous context-free languages
• Tree-size bounded alternation
• Simulation of Parallel Random Access Machines by Circuits
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On Parallel Searching
• Relations between Concurrent-Write Models of Parallel Computation
• A fast parallel algorithm for routing in permutation networks
• A universal interconnection pattern for parallel computers
• On the Tape Complexity of Deterministic Context-Free Languages
• Parallelism in random access machines

This page was built for publication: Restricted CRCW PRAMs