scientific article; zbMATH DE number 910857

zbMATH Open0853.68082MaRDI QIDQ4886030FDOQ4886030

Authors: Uri Zwick, Dorit Dor 

Publication date: 12 December 1996

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (17)

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

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)