Efficient optimal pagination of scrolls
Diehr and Faaland developed an algorithm that finds the minimum sum of key length pagination of a scroll of n items, and which uses O(n log n) time, solving a problem…
Efficient optimal pagination of scrolls
Decentralized extrema-finding in circular configurations of processors
Computing connected components on parallel computers
Fast parallel sorting algorithms
An insertion technique for one-sided height-balanced trees
A linear space algorithm for computing maximal common subsequences
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved