Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimal parallel algorithm for sorting multisets

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

DOI10.1016/S0020-0190(98)00103-3zbMath1339.68062MaRDI QIDQ293338

Sanguthevar Rajasekaran

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001033?np=y


zbMATH Keywords

computational complexityrandomized algorithmsarbitrary CRCW PRAMmultiset sorting


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)




Cites Work

  • Unnamed Item
  • Optimal parallel randomized renaming
  • Faster optimal parallel prefix sums and list ranking
  • Parallel Merge Sort
  • Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms


This page was built for publication: An optimal parallel algorithm for sorting multisets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:293338&oldid=12174760"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki