Pages that link to "Item:Q1101213"
From MaRDI portal
The following pages link to On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213):
Displaying 5 items.
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Using fewer processors to reduce time complexities of semigroup computations (Q1823684) (← links)
- A parametric algorithm for semigroup computation on mesh with buses (Q1924320) (← links)
- A computer-assisted optimal depth lower bound for nine-input sorting networks (Q3210158) (← links)
- (Q3746884) (← links)