scispace - formally typeset
Search or ask a question

Showing papers by "Robert E. Tarjan published in 1978"



Journal ArticleDOI
TL;DR: This analysis leads to a data structure for representing sorted lists when the access pattern exhibits a (perhaps time-varying) locality of reference that is substantially simpler and may be practical for lists of moderate size.
Abstract: In this paper we explore the use of 2-3 trees to represent sorted lists. We analyze the worst-case cost of sequences of insertions and deletions in 2-3 trees under each of the following three assumptions: (i) only insertions are performed; (ii) only deletions are performed; (iii) deletions occur only at the small end of the list and insertions occur only away from the small end. Our analysis leads to a data structure for representing sorted lists when the access pattern exhibits a (perhaps time-varying) locality of reference. This structure has many of the properties of the representation proposed by Guibas, McCreight, Plass, and Roberts [1977], but it is substantially simpler and may be practical for lists of moderate size.

157 citations


Journal ArticleDOI
TL;DR: It is shown that there exists a family of directed acyclic graphs Gn and constants c1, c2, c3 such that each graph Gn has n nodes and each node in Gn has indegree at most 2.
Abstract: A certain pebble game on graphs has been studied in various contexts as a model for the time and space requirements of computations [1,2,3,8]. In this note it is shown that there exists a family of directed acyclic graphs G n and constants c 1, c 2, c 3 such that

34 citations


01 Sep 1978
TL;DR: The black-white pebble game of Cook and Sethi was shown to require as many pebbles in the worst case as the normal game, to within a constant factor as mentioned in this paper.
Abstract: We examine two variations of a one-person pebble game played on directed graphs, which has been studied as a model of register allocation. The black-white pebble game of Cook and Sethi is shown to require as many pebbles in the worst case as the normal pebble game, to within a constant factor. For another version of the pebble game, the problem of deciding whether a given number of pebbles is sufficient for a given graph is shown to be complete in polynomial space.

33 citations


Proceedings ArticleDOI
01 May 1978
TL;DR: The structure has many of the properties of the representation proposed by Guibas, McCreight, Plass, and Roberts, but is substantially simpler and may be practical for lists of moderate size.
Abstract: This paper describes a data structure which is useful for representing linear lists when the pattern of accesses to a list exhibits a (perhaps time-varying) locality of reference. The structure has many of the properties of the representation proposed by Guibas, McCreight, Plass, and Roberts [4], but is substantially simpler and may be practical for lists of moderate size. The analysis of our structure includes a general treatment of the worst-case node splitting caused by consecutive insertions into a 2-3 tree.

20 citations