The complexity of selection and ranking in X+Y and matrices with sorted columns
type: Item
instance of: scholarly article
title: The complexity of selection and ranking in X+Y and matrices with sorted columns
zbMATH Open document ID: 0478.68062
DOI: 10.1016/0022-0000(82)90048-4
author: Greg N. Frederickson
author: Donald B. Johnson
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 3752238
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90048-4
OpenAlex ID: W2019315437
cites work: An almost optimal algorithm for unbounded searching
cites work: Time bounds for selection
cites work: Discrete Optimization Via Marginal Analysis
cites work: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
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: Proving simultaneous positivity of linear forms
cites work: Q4176809
description: scientific article; zbMATH DE number 3752238