G. S. Brodal, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas  Home/Search
Context
Related
| brics.dk/~gerth/Pa...algorithmica02.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: brics.dk/~gerth/pub21 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines. This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following two operations: insert and precedes. The operation insert(a) introduces a new element a in the structure, while the operation precedes(a, b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O(log... (Update)
Active bibliography (related documents): More All
1.4: Optimal Solutions for the Temporal Precedence Problem - Brodal, Makris, Sioutas.. (Correct)
0.4: Efficient Algorithms for the Temporal Precedence Problem - Ranjan, Pontelli, Gupta (1998) (Correct)
0.4: Complexity Analysis of Late Binding in Dynamic.. - Pontelli, Ranjan, Gupta (Correct)
Similar documents based on text: More All
0.6: Identifying Occurrences of Maximal Pairs in Multiple.. - Iliopoulos, Makris.. (2002) (Correct)
0.3: On the Canonical k-Vertex Polygon Spatial Retrieval.. - Bistiolas, Sioutas.. (Correct)
0.3: The Temporal Precedence Problem - Ranjan, Pontelli, Gupta, Longpre (1998) (Correct)
BibTeX entry: (Update)
@misc{ brodal-optimal,
author = "G. S. Brodal and C. Makris and S. Sioutas and A. Tsakalidis and K. Tsichlas",
title = "Optimal Solutions for the Temporal Precedence Problem",
url = "citeseer.ist.psu.edu/article/brodal02optimal.html" }
Citations (may not include all citations):99 Two Algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
66 A class of algorithms which require nonlinear time to mainta.. (context) - Tarjan - 1979
46 Preserving order in a forest in less than logarithmic time a.. (context) - Boas - 1977
32 Design and implementation of an efficient priority queue (context) - Boas, Kaas et al. - 1977
25 Faster deterministic sorting and searching in linear space - Andersson - 1996
19 Worst case optimal insertion and deletion methods for decomp.. (context) - Overmars, van Leeuwen - 1981
13 Maintaining order in a generalized linked list (context) - Tsakalidis - 1984
11 Eliminating Amortization: On Data Structures with Guaranteed.. (context) - Raman - 1992
9 An optimal RAM implementation of catenable min double-ended .. (context) - Kosaraju - 1994
9 Finger search trees with constant insertion time - Brodal - 1998
7 the complexity of parallel implementation of logic programs - Pontelli, Ranjan et al. - 1997
4 The Temporal Precedence problem - Ranjan, Pontelli et al. - 2000
2 An average time update scheme for balanced binary search tre.. (context) - Overmars - 1982
1 Efficient algorithms for the Temporal Precedence problem - Ranjan, Pontelli et al. - 1998
Documents on the same site (http://www.brics.dk/~gerth/pub21.html):
Worst Case Efficient Data Structures - Brodal (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC