Cache-oblivious selection in sorted \(X+Y\) matrices

DOI10.1016/j.ipl.2008.09.001zbMath1191.68232OpenAlexW2109278004MaRDI QIDQ975535

Shripad Thite, Mark T. de Berg

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.001

zbMATH Keywords

algorithmscache-oblivious algorithmsmatrix selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Labeling a rectilinear map more efficiently
• Computing the maximum overlap of two convex polygons under translations
• Time bounds for selection
• Discrete rectilinear 2-center problems
• Cache-Oblivious Algorithms
• Generalized Selection and Ranking: Sorted Matrices
• On some geometric selection and optimization problems via sorted matrices

This page was built for publication: Cache-oblivious selection in sorted \(X+Y\) matrices