Optimal parallel randomized renaming

DOI10.1016/S0020-0190(96)00182-2zbMATH Open1337.68304MaRDI QIDQ290183FDOQ290183

Authors: Martin Farach, S. Muthukrishnan 

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• The renaming problem: recent developments and open questions
• Fast randomized test-and-set and renaming
• An optimal parallel algorithm for sorting multisets
• Wait-free algorithms for fast, long-lived renaming
• Randomized loose renaming in \(O(\log \log n)\) time

zbMATH Keywords

PRAM algorithmrenaming problem

Mathematics Subject Classification ID

Randomized algorithms (68W20) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Cites Work

• Parallel construction of a suffix tree with applications
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Title not available (Why is that?)

Cited In (1)

• An optimal parallel algorithm for sorting multisets

This page was built for publication: Optimal parallel randomized renaming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290183)