On the time-space tradeoff for sorting with linear queries
type: Item
instance of: scholarly article
title: On the time-space tradeoff for sorting with linear queries
zbMATH Open document ID: 0547.68062
DOI: 10.1016/0304-3975(82)90060-3
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3872697
zbMATH Keywords: sorting
zbMATH Keywords: linear queries
zbMATH Keywords: time-space tradeoff
zbMATH Keywords: branching programs
author: Andrew Chi-Chih Yao
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90060-3
OpenAlex ID: W2027988279
cites work: Q4080721
cites work: A Counting Approach to Lower Bounds for Selection Problems
cites work: Some Monotonicity Properties of Partial Orders
description: scientific article; zbMATH DE number 3872697