An applicative random-access stack

DOI10.1016/0020-0190(83)90106-0zbMath0572.68013OpenAlexW2001170336MaRDI QIDQ1062446

Eugene W. Myers

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90106-0

zbMATH Keywords

applicative algorithms for a random-access stackapplicative programmingsingly- linked list representationskew-binary number systemstack data abstraction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (7)

Regular numeral systems for data structures ⋮ Making data structures persistent ⋮ Optimal purely functional priority queues ⋮ Two skew-binary numeral systems and one application ⋮ An Overview of Edison ⋮ Priority queues with decreasing keys ⋮ A parallel algorithm for finding a blocking flow in an acyclic network

Cites Work

• Unnamed Item
• Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm
• Can programming be liberated from the von Neumann style?
• Symmetric list processor

This page was built for publication: An applicative random-access stack