Optimal average case sorting on arrays

DOI10.1007/3-540-59042-0_100zbMATH Open1379.68110OpenAlexW1576525553MaRDI QIDQ4596648FDOQ4596648

Authors: Rolf Niedermeier, Klaus Reinhardt, Manfred Kunde, Peter Rossmanith 

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_100

Recommendations

• scientific article; zbMATH DE number 1026282
• scientific article; zbMATH DE number 4035170
• Lower bounds for sorting on mesh-connected architectures
• scientific article; zbMATH DE number 3958741
• Optimal deterministic sorting and routing on grids and tori with diagonals

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cited In (7)

• Average-case analysis of perfect sorting by reversals
• A note on average-case sorting
• Efficient sample sort and the average case analysis of PEsort
• Title not available (Why is that?)
• PRAM's towards realistic parallelism: BRAM's
• Optimal deterministic sorting and routing on grids and tori with diagonals
• Beyond the worst-case bisection bound: Fast sorting and ranking on meshes

This page was built for publication: Optimal average case sorting on arrays

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