Access Restriction

Author Driscoll, James R. ♦ Sleator, Daniel D K ♦ Tarjan, Robert E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword LISP ♦ Amortization ♦ Catenation ♦ Concatenation ♦ Data structures ♦ Functional programming ♦ List ♦ Queue ♦ Stack
Abstract This paper considers the problem of representing stacks with catenation so that any stack, old or new, is available for access or update operations. This problem arises in the implementation of list-based and functional programming languages. A solution is proposed requiring constant time and space for each stack operation except catenation, which requires O(log log $\textit{k})$ time and space. Here $\textit{k}$ is the number of stack operations done before the catenation. All the resource bounds are amortized over the sequence of operations.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 5
Page Count 17
Starting Page 943
Ending Page 959

Open content in new tab

   Open content in new tab
Source: ACM Digital Library