Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Optimal parallel randomized renaming

From MaRDI portal
Publication:290183
Jump to:navigation, search

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


Authors: Martin Farach, S. Muthukrishnan Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:290183&oldid=12172176"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 02:05. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki