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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 61; H. 1; S. 7 - 10
Hauptverfasser: Farach, Martin, Muthukrishnan, S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 14.01.1997
Elsevier Science
Elsevier Sequoia S.A
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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