scientific article; zbMATH DE number 910857

MaRDI QIDQ4886030zbMATH OpenFDO

Authors Uri Zwick, Dorit Dor

Publication date 12 December 1996

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Selecting the Median
• On lower bounds for selecting the median
• On the implementation of the median
• Comparing medians
• Towards a well-defined median
• scientific article; zbMATH DE number 2010140

Cited in

(17)

• Range Medians
• Comparing medians
• Comparator networks for binary heap construction
• The double selection problem
• An improved algorithm for finding the median distributively
• Progress in selection
• Median selection requires \((2+\varepsilon)n\) comparisons
• Finding the \(\alpha n\)-th largest element
• Partial sorting problem on evolving data
• Median bounds and their application
• On median and quartile sets of ordered random variables
• On selecting the k largest with median tests
• Selection from read-only memory and sorting with minimum data movement
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Comparator networks for binary heap construction
• Finding a mediocre player
• Finding a mediocre player

This page was built for publication:

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