Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Quicksort / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10852-008-9089-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112817012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adaptiveness of Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant real-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sampling Strategies in Quicksort and Quickselect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Algorithm for a Generalization of the Shortest-Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort with Equal Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Quicksort programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the efficiency of quicksort / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:01, 2 July 2024

scientific article
Language Label Description Also known as
English
Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
scientific article

    Statements

    Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (English)
    0 references
    0 references
    25 November 2009
    0 references
    randomized algorithms
    0 references
    fault-tolerant sorting
    0 references
    inversion pair cardinality
    0 references
    randomized QuickMergesort
    0 references

    Identifiers