A unified approach to models of synchronous parallel machines
From MaRDI portal
Publication:5402545
DOI10.1145/800133.804336zbMath1282.68105OpenAlexW2008840956MaRDI QIDQ5402545
Publication date: 14 March 2014
Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800133.804336
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Related Items
Routing, merging, and sorting on parallel models of computation, Unbounded fan-in circuits and associative functions, On the parallel complexity of discrete relaxation in constraint satisfaction networks, Optimal parallel randomized algorithms for sparse addition and identification, A space efficient algorithm for the monotone planar circuit value problem, Tree-size bounded alternation, \(\varepsilon\)-productions in context-free grammars, On uniform circuit complexity, Division in idealized unit cost RAMs, A complexity theory of efficient parallel algorithms, The maximum flow problem is log space complete for P, Nearly Work-Efficient Parallel Algorithm for Digraph Reachability, Data independence of read, write, and control structures in PRAM computations, Expected parallel time and sequential space complexity of graph and digraph problems, Unambiguity of circuits, Associative processors as a tool for maximal parallelism, Unnamed Item, Optical computing, An optimal parallel connectivity algorithm, Depth-first search is inherently sequential, Speedups of deterministic machines by synchronous parallel machines, Parallel random access machines with powerful instruction sets
