INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES

DOI10.1142/S012905419800009XzbMath0967.68050MaRDI QIDQ2703018

Selim G. Akl, S.Pavel

Publication date: 28 February 2001

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

integer sortingon-line packet routingPRAM simulation complexity

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES ⋮ A new computation of shape moments via quadtree decomposition ⋮ From Parallelism to Nonuniversality: An Unconventional Trajectory

Cites Work

• Horizons of parallel computation
• Relations between Concurrent-Write Models of Parallel Computation
• Optimal bounds for decision problems on the CRCW PRAM
• MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗

This page was built for publication: INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES