The following pages link to (Q5501271):
Displaying 12 items.
- Modelling thermal transients from magmatic underplating -- an example from the Vøring margin (NE atlantic) (Q416083) (← links)
- The number of bit comparisons used by quicksort: an average-case analysis (Q428664) (← links)
- Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← links)
- Average-case analysis of quicksort and binary insertion tree height using incompressibility (Q2379940) (← links)
- Compact Hilbert indices: space-filling curves for domains with unequal side lengths (Q2380065) (← links)
- Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm (Q2966500) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- The Number of Symbol Comparisons in QuickSort and QuickSelect (Q3638078) (← links)
- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq (Q3638257) (← links)
- How Many Comparisons Does Quicksort Use? (Q4857539) (← links)
- Analysis of Branch Misses in Quicksort (Q5194799) (← links)
- Towards a Realistic Analysis of Some Popular Sorting Algorithms (Q5364228) (← links)