Complexity of algebraic implementations for abstract data types

DOI10.1016/0022-0000(81)90014-3zbMath0474.68021OpenAlexW2093416902MaRDI QIDQ1158952

Bernd Mahr, Hartmut Ehrig

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90014-3

zbMATH Keywords

Turing machinesupper and lower boundsexpressive power

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (4)

Complexity of algebraic implementations for abstract data types ⋮ Algebraic implementation of abstract data types ⋮ Complexity analysis of term-rewriting systems ⋮ Implementation of data types by algebraic methods

Cites Work

• Final algebra semantics and data type extensions
• Complexity of algebraic implementations for abstract data types
• Algebraic implementation of abstract data types
• Initial Algebra Semantics and Continuous Algebras
• Extensions and implementations of abstract data type specifications
• Data type specification
• Straight-line program length as a parameter for complexity measures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of algebraic implementations for abstract data types