|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
29th Annual Symposium on Foundations of Computer Science (FOCS 1988)
Three stacks (PDF)
White Plains, NY, USA
October 24-October 26
ISBN: 0-8186-0877-3
| ASCII Text | x | ||
| M.L. Fredman, D.L. Goldsmith, "Three stacks," Foundations of Computer Science, IEEE Annual Symposium on, pp. 514-523, 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1988.21967, author = {M.L. Fredman and D.L. Goldsmith}, title = {Three stacks}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1988}, isbn = {0-8186-0877-3}, pages = {514-523}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21967}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Three stacks SN - 0-8186-0877-3 SP514 EP523 A1 - M.L. Fredman, A1 - D.L. Goldsmith, PY - 1988 KW - lower complexity bounds KW - upper complexity bounds KW - storage allocation KW - three stacks KW - pointers KW - linked lists KW - relocating KW - memory KW - collisions KW - additional time KW - additional space VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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.
Index Terms:
lower complexity bounds, upper complexity bounds, storage allocation, three stacks, pointers, linked lists, relocating, memory, collisions, additional time, additional space
Citation:
M.L. Fredman, D.L. Goldsmith, "Three stacks," focs, pp.514-523, 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988
Usage of this product signifies your acceptance of the Terms of Use.