Some Results for Elementary Operations

  title={Some Results for Elementary Operations},
  author={Athanasios K. Tsakalidis},
  booktitle={Efficient Algorithms},
  • A. Tsakalidis
  • Published in Efficient Algorithms 1 September 2009
  • Computer Science
We present a number of results for elementary operations concerning the areas of data structures, computational geometry, graph algorithms and string algorithms. Especially, we focus on elementary operations like the dictionary operations, list manipulation, priority queues, temporal precedence, finger search, nearest common ancestors, negative cycle, 3-sided queries, rectangle enclosure, dominance searching, intersection queries, hidden line elimination and string manipulation. 


New Upper Bounds for Generalized Intersection Searching Problems
This work shows how to improve the bounds of several generalized intersection searching problems as well as how to obtain upper bounds for some problems not treated before.
New Results on Intersection Query Problems
Simple algorithms for three problems belonging to the class of intersection query problems that solve the static 2-dimensional dominance searching problem with respect to a set of obstacles and a result for the static d-dimensional range searching problem is presented.
Two algorithms for maintaining order in a list
The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list).
A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets
A new algorithm for solving a version of the partially persistent sorted set problem that can make use of any of the existing balanced tree schemes that can be implemented with “path copying,” at the expense of not efficiently implementing some operations on partially persistent search trees.
Dynamic interpolation search
A new data structure called Interpolation Search tree (IST) is presented which supports interpolation search and insertions and deletions and for a wide class of probability distributions.
AVL-Trees for Localized Search
We present a data structure based on AVL-trees which allows to perform an insertion or a deletion in time O(log d) where'd is the distance of the position searched for from the finger which points to