scientific article

zbMath0596.68047MaRDI QIDQ3730022

Walter L. Ruzzo, Patrick W. Dymond

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

CREW-PRAMCROW-PRAMParallel Random Access Machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (17)

Parallel pointer machines ⋮ An unambiguous class possessing a complete set ⋮ PRAM's towards realistic parallelism: BRAM's ⋮ On nondeterminism in parallel computation ⋮ Parallel computation with threshold functions ⋮ An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits ⋮ Complexity theory of parallel time and hardware ⋮ Separating the power of EREW and CREW PRAMs with small communication width ⋮ Parallel recognition and ranking of context-free languages ⋮ Tree-size bounded alternation ⋮ Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract) ⋮ A complexity theory of efficient parallel algorithms ⋮ Properties that characterize LOGCFL ⋮ Data independence of read, write, and control structures in PRAM computations ⋮ StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) ⋮ Restricted CRCW PRAMs ⋮ On the parallel recognition of unambiguous context-free languages

This page was built for publication: