Complexity of algebraic implementations for abstract data types
type: Item
instance of: scholarly article
title: Complexity of algebraic implementations for abstract data types
zbMATH Open document ID: 0474.68021
DOI: 10.1016/0022-0000(81)90014-3
author: Bernd Mahr
author: Hartmut Ehrig
published in: Journal of Computer and System Sciences
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3744508
zbMATH Keywords: expressive power
zbMATH Keywords: upper and lower bounds
zbMATH Keywords: Turing machines
MaRDI profile type: Publication
full work available at URL: 0022-0000(81)90014-3
OpenAlex ID: W2093416902
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Data type specification
cites work: Q4773298
cites work: Q3667921
cites work: Q3208066
cites work: Extensions and implementations of abstract data type specifications
cites work: Q3917479
cites work: Q3885176
cites work: Algebraic implementation of abstract data types
cites work: Q4160385
cites work: Q4199504
cites work: Q4178466
cites work: Q3965556
cites work: Q4525285
cites work: Straight-line program length as a parameter for complexity measures
cites work: Q3774983
cites work: Final algebra semantics and data type extensions
description: scientific article; zbMATH DE number 3744508