Optimal parallel randomized renaming (1997) [2 citations — 0 self]
Download:
by Martin Farach, S. Muthukrishnan
Information Processing Letters
http://www.cs.rutgers.edu/~farach/pubs/PSort.pdf
Add To MetaCart
Abstract:
We consider the Renaming Problem, a basic processing step in string algorithms, for which we give a simultaneously work and time optimal Las Vegas type PRAM algorithm. The Renaming Problem is closely related to the Multiset Sorting Problem. 1
Citations
| 587 | An Introduction to Parallel Algorithms – J'aJ'a - 1992 |
| 305 | Parallel merge sort – Cole - 1988 |
| 57 | Optimal bounds for decision problems on the CRCW PRAM – Beame, Hastad - 1989 |
| 38 | Parallel construction of a suffix tree with applications – Apostolico, Iliopoulos, et al. - 1988 |
| 29 | Using approximation algorithms to design parallel algorithms that may ignore processor allocation – Goodrich - 1991 |
| 22 | An alphabet independent approach to two dimensional pattern matching – Amir, Benson, et al. - 1994 |
| 19 | A fast probabilistic parallel sorting algorithm – Reischuk - 1981 |
| 4 | Wigderson: Relations Between Concurrent-Write Models of Parallel Computation – Fich, Ragde, et al. - 1988 |
| 1 | A fast and efficient suffix tree contruction algorithm – Farach, Muthukrishnan - 1995 |
