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

An efficient parallel sorting algorithm

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

DOI10.1016/0020-0190(92)90004-FzbMath0753.68033OpenAlexW2321698191MaRDI QIDQ1199552

Xiaoqing Liu, Junguk L. Kim

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90004-f


zbMATH Keywords

partitioningEREW PRAMmerging


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)





Cites Work

  • Geometric complexity of some location problems
  • On computing the closest boundary point on the convex hull




This page was built for publication: An efficient parallel sorting algorithm

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