Pages that link to "Item:Q5953102"

The following pages link to On the probabilistic worst-case time of ``find'' (Q5953102):

Displaying 13 items.

• A survey of max-type recursive distributional equations (Q558662) (← links)
• The analysis of range quickselect and related problems (Q650886) (← links)
• The functional equation of the smoothing transform (Q690873) (← links)
• Exponential bounds for the running time of a selection algorithm (Q760796) (← links)
• Process convergence for the complexity of radix selection on Markov sources (Q1713466) (← links)
• Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← links)
• Convergence of the population dynamics algorithm in the Wasserstein metric (Q2316585) (← links)
• QUICKSELECT revisited (Q2834338) (← links)
• Distributional convergence for the number of symbol comparisons used by QuickSelect (Q2837754) (← links)
• QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find (Q3191202) (← links)
• Partial fillup and search time in LC tries (Q4962683) (← links)
• On stochastic recursive equations of sum and max type (Q5754680) (← links)
• Stochastic recursions on directed random graphs (Q6184920) (← links)