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 require...

Full description

Saved in:
Bibliographic Details
Main Authors: Fredman, M.L., Goldsmith, D.L.
Format: Conference Proceeding
Language:English
Subjects:
Availability
Computational modeling
Data structures
Dictionaries
Software engineering
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
DOI:10.1109/SFCS.1988.21967