scientific article; zbMATH DE number 3982516
From MaRDI portal
Publication:3746884
Recommendations
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
- Using fewer processors to reduce time complexities of semigroup computations
- Optimal and efficient algorithms for summing and prefix summing on parallel machines
- scientific article; zbMATH DE number 493142
- Parallel time and space upper-bounds for the subset-sum problem
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- A note on minimizing the sum of quadratic completion times on two identical parallel machines
- On generic complexity of the subset sum problem for semigroups of integer matrices
- scientific article; zbMATH DE number 6479070
- The parallel complexity of integer prefix summation
Cited in
(5)- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
- Limits on the power of concurrent-write parallel machines
- Using fewer processors to reduce time complexities of semigroup computations
- A parametric algorithm for semigroup computation on mesh with buses
- Sorting roughly sorted sequences in parallel
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746884)
