A communication hierarchy of parallel computations
From MaRDI portal
Publication:1129258
DOI10.1016/S0304-3975(97)00033-9zbMath0902.68074MaRDI QIDQ1129258
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
The Communication Hierarchy of Time and Space Bounded Parallel Machines ⋮ WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY ⋮ On Models of a Nondeterministic Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of synchronization in parallel computations
- The method of forced enumeration for nondeterministic automata
- Alternating multihead finite automata
- Some properties of space-bounded synchronized alternating Turing machines with universal states only
- Communication for alternating machines
- Deterministic versus nondeterministic space in terms of synchronized alternating machines
- Turing machines with sublogarithmic space
- Relationships between nondeterministic and deterministic tape complexities
- Bridging across the log(n) space frontier
- Counting is easy
- Nondeterministic Space is Closed under Complementation
- Alternation
- Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
- ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
- ${\text{ASPACE}}(o(\log \log n))$ is Regular
- ON THE POWER OF ONE-WAY GLOBALLY DETERMINISTIC SYNCHRONIZED ALTERNATING TURING MACHINES AND MULTIHEAD AUTOMATA
This page was built for publication: A communication hierarchy of parallel computations
