Results 1 
5 of
5
Purely Functional, RealTime Deques with Catenation
 Journal of the ACM
, 1999
"... We describe an efficient, purely functional implementation of deques with catenation. In addition to being an intriguing problem in its own right, finding a purely functional implementation of catenable deques is required to add certain sophisticated programming constructs to functional programming ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We describe an efficient, purely functional implementation of deques with catenation. In addition to being an intriguing problem in its own right, finding a purely functional implementation of catenable deques is required to add certain sophisticated programming constructs to functional programming languages. Our solution has a worstcase running time of O(1) for each push, pop, inject, eject and catenation. The best previously known solution has an O(log k) time bound for the k deque operation. Our solution is not only faster but simpler. A key idea used in our result is an algorithmic technique related to the redundant digital representations used to avoid carry propagation in binary counting.
Persistent data structures
 IN HANDBOOK ON DATA STRUCTURES AND APPLICATIONS, CRC PRESS 2001, DINESH MEHTA AND SARTAJ SAHNI (EDITORS) BOROUJERDI, A., AND MORET, B.M.E., "PERSISTENCY IN COMPUTATIONAL GEOMETRY," PROC. 7TH CANADIAN CONF. COMP. GEOMETRY, QUEBEC
, 1995
"... ..."
Maintenance of 2 and 3Connected Components of Graphs, Part I: 2 and 3EdgeConnected Components
, 1990
"... In this paper a data structure is presented to efficiently maintain the 2and 3edgeconnected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O(nlogn[ e) time in total. The data structure allows for inserti ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper a data structure is presented to efficiently maintain the 2and 3edgeconnected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O(nlogn[ e) time in total. The data structure allows for insertions of nodes also (in the same time bounds, taking n as the final number of nodes).
Seminar on Advanced topics in data structures Fall 2000/2001
, 2000
"... We shall focus on the following three problems in data structures 1. The Unionfind problem. 2. Constructing optimal alphabetic binary trees. 3. The suffix tree. Depending upon the number of students participating we may touch other topics as well. ..."
Abstract
 Add to MetaCart
We shall focus on the following three problems in data structures 1. The Unionfind problem. 2. Constructing optimal alphabetic binary trees. 3. The suffix tree. Depending upon the number of students participating we may touch other topics as well.