DocumentCode
3174853
Title
Three stacks
Author
Fredman, Michael L. ; Goldsmith, Deborah L.
Author_Institution
Bellcore, Morristown, NJ, USA
fYear
1988
fDate
24-26 Oct 1988
Firstpage
514
Lastpage
523
Abstract
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
Keywords
computational complexity; programming theory; additional space; additional time; collisions; linked lists; lower complexity bounds; memory; pointers; relocating; storage allocation; three stacks; upper complexity bounds; Availability; Computational modeling; Data structures; Dictionaries; Software engineering;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1988., 29th Annual Symposium on
Conference_Location
White Plains, NY
Print_ISBN
0-8186-0877-3
Type
conf
DOI
10.1109/SFCS.1988.21967
Filename
21967
Link To Document