Analysis of the expected number of bit comparisons required by quickselect (Q1957651): Difference between revisions

From MaRDI portal
Merged Item from Q5194651
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the probabilistic worst-case time of ``find'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mellin transforms and asymptotics: Digital sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mellin transforms and asymptotics: Finite differences and Rice's integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Constant Arising in the Analysis of Bit Comparisons in Quickselect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic distribution theory for Hoare's selection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickselect and the Dickman Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of multiple Quickselect: An algorithm for finding order statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of quickselect : an algorithm for order statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of multiple quick select / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rates of convergence for Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Quickselect -- Hoare's Find algorithm for several elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limiting distribution for quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for “quicksort” / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Symbol Comparisons in QuickSort and QuickSelect / rank
 
Normal rank

Latest revision as of 06:01, 3 July 2024

scientific article; zbMATH DE number 7105589
  • Analysis of the Expected Number of Bit Comparisons Required by Quickselect
Language Label Description Also known as
English
Analysis of the expected number of bit comparisons required by quickselect
scientific article; zbMATH DE number 7105589
  • Analysis of the Expected Number of Bit Comparisons Required by Quickselect

Statements

Analysis of the expected number of bit comparisons required by quickselect (English)
0 references
Analysis of the Expected Number of Bit Comparisons Required by Quickselect (English)
0 references
0 references
0 references
27 September 2010
0 references
16 September 2019
0 references
Quickselect
0 references
Find
0 references
Searching algorithms
0 references
Asymptotics
0 references
Average-case analysis
0 references
Key comparisons
0 references
Bit comparisons
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references