A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 3, p. 233, doi. 10.1007/s002240010001
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2000 AND VI 33 AND IP 3
Results: 2
1
2
Efficient Scheduling of Strict Multithreaded Computations.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 3, p. 173, doi. 10.1007/s002240010002
- By:
- Publication type:
- Article