Abstract
The following problems are shown to be solvable in O(log* n) time with optimal speedup with high probability on a randomized CRCW PRAM using O(n) space: Space allocation: Given nonnegative integers , ...,, allocate nonoverlapping blocks of consecutive memory cells of sizes , ..., from a base segment of (∑) consecutive memory cells. Estimation: Given integers in the range 1.., compute "good" estimates of the number of occurrences of each value in the range 1... Semisorting: Given integers , ..., in the range 1.., store the integers 1, ..., in an array of () cells such that for all ∈ {1, ...,}, all elements of {: 1 ≤ ≤ and = } occur together, separated only by empty cells. Integer chain-sorting: Given integers , ..., in the range 1.., construct a linked list containing the integers 1, ..., such that for all , ∈ {1, ..., }, if precedes in the list, then ≤ .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
