Selection in \(X+Y\) and matrices with sorted rows and columns
type: Item
instance of: scholarly article
title: Selection in \(X+Y\) and matrices with sorted rows and columns
zbMATH Open document ID: 0557.68040
DOI: 10.1016/0020-0190(85)90123-1
author: D. Kharzeev
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 3888920
zbMATH Keywords: sorting
zbMATH Keywords: algorithm
zbMATH Keywords: smallest element
zbMATH Keywords: divide-and-conquer
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90123-1
OpenAlex ID: W2079849501
cites work: Time bounds for selection
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: Generalized Selection and Ranking: Sorted Matrices
cites work: Q4172927
cites work: Sorting X + Y
cites work: Estimates of Location Based on Rank Tests
cites work: Lower Bounds for Selection in X + Y and Other Multisets
cites work: Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
cites work: Q4176809
description: scientific article; zbMATH DE number 3888920