Some Theorems on Sorting

DOI10.1137/0117001MaRDI QIDQ5556838zbMATH OpenOpenAlexFDO

Authors

Publication date 1969

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0117001

zbMATH Keywords

probability theory

Cited in

(10)

• Asymptotic analysis of dichotomous search with search and travel costs
• The analysis of Quicksort programs
• Monotonicity and efficient computation of optimal dichotomous search
• On polychotomous search problems
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Operations research applications of dichotomous search
• On a problem of optimal search
• Some Maximal Solutions of the Generalized Subadditive Inequality
• Some Recurrence Relations of Recursive Minimization
• On dichotomous search with direction-dependent costs for a uniformly hidden object

This page was built for publication: Some Theorems on Sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5556838)