Efficient List Ranking on the Reconfigurable Mesh, with Applications

Finding a vast array of applications, the list-ranking problem has emerged as one of the fundamental techniques in parallel algorithm design. Surprisingly, the best previously known algorithm to rank a list of n items on a reconfigurable mesh of size \(n \times n\) was running in O(log n ) time. It was open for more than 8 years to obtain a faster algorithm for this important problem.