Improved bounds for integer sorting in the EREW PRAM model

DOI10.1006/JPDC.1997.1401MaRDI QIDQ1392302zbMATH OpenOpenAlexFDO

Authors Anders Dessmark, Andrzej Lingas

Publication date 29 July 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1401

zbMATH Keywords

EREW PRAM model

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Upper bounds for sorting integers on random access machines
• An improved reliability bound of a probabilistic parallel integer sorting algorithm
• Fast integer merging on the EREW PRAM
• Fast integer merging on the EREW PRAM
• Improved deterministic parallel integer sorting
• Improved nonconservative sequential and parallel integer sorting
• Tight Bounds on the Complexity of Parallel Sorting
• Optimal parallel quicksort on EREW PRAM
• A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm
• Improved bounds on sorting with length-weighted reversals

Cited in

(4)

• Improved fast integer sorting in linear space
• A theoretical look at \textsc{Electre Tri}-nB and related sorting models
• Sorting short integers: the exposition
• Integer merging on EREW PRAM

This page was built for publication: Improved bounds for integer sorting in the EREW PRAM model

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