Optimal parallel randomized renaming

Martin Farach, Shanmugavelayutham Muthukrishnan

    Research output: Contribution to journalArticle

    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.

    Original languageEnglish (US)
    Pages (from-to)7-10
    Number of pages4
    JournalInformation Processing Letters
    Volume61
    Issue number1
    StatePublished - Jan 14 1997

    Fingerprint

    Sorting
    String Algorithms
    Multiset
    Processing

    Keywords

    • PRAM algorithm
    • Renaming problem

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Signal Processing
    • Information Systems
    • Computer Science Applications

    Cite this

    Farach, M., & Muthukrishnan, S. (1997). Optimal parallel randomized renaming. Information Processing Letters, 61(1), 7-10.

    Optimal parallel randomized renaming. / Farach, Martin; Muthukrishnan, Shanmugavelayutham.

    In: Information Processing Letters, Vol. 61, No. 1, 14.01.1997, p. 7-10.

    Research output: Contribution to journalArticle

    Farach, M & Muthukrishnan, S 1997, 'Optimal parallel randomized renaming', Information Processing Letters, vol. 61, no. 1, pp. 7-10.
    Farach M, Muthukrishnan S. Optimal parallel randomized renaming. Information Processing Letters. 1997 Jan 14;61(1):7-10.
    Farach, Martin ; Muthukrishnan, Shanmugavelayutham. / Optimal parallel randomized renaming. In: Information Processing Letters. 1997 ; Vol. 61, No. 1. pp. 7-10.
    @article{3464bee4667147739f48f971b6dac99c,
    title = "Optimal parallel randomized renaming",
    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.",
    keywords = "PRAM algorithm, Renaming problem",
    author = "Martin Farach and Shanmugavelayutham Muthukrishnan",
    year = "1997",
    month = "1",
    day = "14",
    language = "English (US)",
    volume = "61",
    pages = "7--10",
    journal = "Information Processing Letters",
    issn = "0020-0190",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - Optimal parallel randomized renaming

    AU - Farach, Martin

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 1997/1/14

    Y1 - 1997/1/14

    N2 - 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.

    AB - 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.

    KW - PRAM algorithm

    KW - Renaming problem

    UR - http://www.scopus.com/inward/record.url?scp=0030736468&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0030736468&partnerID=8YFLogxK

    M3 - Article

    VL - 61

    SP - 7

    EP - 10

    JO - Information Processing Letters

    JF - Information Processing Letters

    SN - 0020-0190

    IS - 1

    ER -