An applicative random-access stack

DOI10.1016/0020-0190(83)90106-0MaRDI QIDQ1062446zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A scalable lock-free stack algorithm
• A bidirectional multiple stack algorithm
• Random access machines with multi-dimensional memories
• scientific article; zbMATH DE number 3900130
• Space-time trade-offs for stack-based algorithms
• Space-time trade-offs for stack-based algorithms
• Delay analysis of the n-ary stack random-access algorithm

Cites work

• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• Can programming be liberated from the von Neumann style?
• Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm
• Symmetric list processor

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062446)