Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm

DOI10.1007/s10852-008-9089-6zbMath1191.68230OpenAlexW2112817012MaRDI QIDQ1040789

J. Blot

Publication date: 25 November 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9089-6

zbMATH Keywords

randomized algorithmsfault-tolerant sortinginversion pair cardinalityrandomized QuickMergesort

Mathematics Subject Classification ID

Searching and sorting (68P10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal Sampling Strategies in Quicksort and Quickselect
• Quicksort with Equal Keys
• Implementing Quicksort programs
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• On the adaptiveness of Quicksort
• A new approach to dynamic all pairs shortest paths
• Increasing the efficiency of quicksort
• Fault-tolerant real-time scheduling

This page was built for publication: Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm