On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
From MaRDI portal
Publication:1101213
DOI10.1016/0304-3975(87)90058-2zbMath0642.68059MaRDI QIDQ1101213
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90058-2
upper bounds; lower bounds; completely-connected network of random-access machines; semigroup summation problem
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
A nearly optimal deterministic parallel Voronoi diagram algorithm, A computer-assisted optimal depth lower bound for nine-input sorting networks
Cites Work
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Finding the maximum, merging, and sorting in a parallel computation model
- A universal interconnection pattern for parallel computers
- Parallelism in random access machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item