A simple proof of a time-space trade-off for sorting with linear comparisons
type: Item
instance of: scholarly article
title: A simple proof of a time-space trade-off for sorting with linear comparisons
zbMATH Open document ID: 0597.68052
DOI: 10.1016/0304-3975(86)90185-4
author: Donald B. Johnson
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3963208
zbMATH Keywords: linear branching programs
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90185-4
OpenAlex ID: W2063879799
cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
cites work: On the time-space tradeoff for sorting with linear queries
description: scientific article; zbMATH DE number 3963208