Optimal parallel randomized renaming

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.

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 61; číslo 1; s. 7 - 10
Hlavní autori: Farach, Martin, Muthukrishnan, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 14.01.1997
Elsevier Science
Elsevier Sequoia S.A
Predmet:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Mathematical models
Parallel processing
PRAM algorithm
Renaming Problem
Studies
Theoretical computing
Renaming Problem
PRAM algorithm
Randomization
Parallel computation
Algorithms
Random access storage
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(96)00182-2