scientific article; zbMATH DE number 910857

MaRDI QIDQ4886030zbMATH OpenFDO

Authors Uri Zwick, Dorit Dor

Publication date 12 December 1996

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) 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

(18)

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

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)