The Library
Optimal parallel randomized renaming
Tools
UNSPECIFIED (1997) Optimal parallel randomized renaming. INFORMATION PROCESSING LETTERS, 61 (1). pp. 7-10. ISSN 0020-0190.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
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.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Journal or Publication Title: | INFORMATION PROCESSING LETTERS | ||||
Publisher: | ELSEVIER SCIENCE BV | ||||
ISSN: | 0020-0190 | ||||
Official Date: | 14 January 1997 | ||||
Dates: |
|
||||
Volume: | 61 | ||||
Number: | 1 | ||||
Number of Pages: | 4 | ||||
Page Range: | pp. 7-10 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |