Three Stacks

The storage allocation for three stacks has been traditionally accomplished by using pointers to store the stacks as linked lists or by relocating the stacks within memory when collisions take place. The former approach requires additional space to store the pointers, and the latter approach requires additional time. The authors explore the extent to which some additional space or time is required to maintain three stacks. They provide a formal setting for this topic and establish upper and lower complexity bounds on various aspects. >

Authors

• Michael L. Fredman
• Deborah L. Goldsmith

Keywords

• Data structures
• Dictionaries
• Software engineering
• Computational modeling
• Availability
• Lower Bound
• State Space
• Memory Cells
• Reaction Steps
• Standard Algorithm
• Load Data
• Local Map
• Size Of Space
• National Science Foundation
• Hamming Distance
• Memory State
• Local Zone
• Residual Component
• Memory Size
• Allocation Algorithm
• Amount Of Movement
• Memory Block
• Item Residuals