Rajamani Sundar

Learn More
A deque with heap order is a linear list of elements with real-valued keys which allows insertions and deletions of elements at both ends of the list. It also allows the ndmin (equivalently ndmax) operation, which returns the element of least (greatest) key, but it does not allow a general deletemin (deletemax) operation. Such a data structure is also(More)
Given an ordered universe U, we study the problem of representing each subset of U by a unique binary search tree so that dictionary operations can be performed efficiently. While efficient randomized solutions to the problem are known, its deterministic complexity has remained unexplored. We exhibit representations that permit the execution of dictionary(More)
This thesis investigates the amortized complexity of some fundamental data structure problems and introduces interesting ideas for proving lower bounds on amortized complexity and for performing amortized analysis. The problems are as follows: Dictionary Problem: A dictionary is a dynamic set that supports searches of elements and changes under insertions(More)
We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types. We investigate a number of strategies for a restricted case of the problem and provide upper and lower bounds on their performance (how quickly they eect ideal congurations of our data structure). In most cases, the bounds provide nontrivial improvements over(More)
We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O (1) time. The randomized version supports new sequence creations in O(log 2 n) expected(More)
The main aim of this research work is to propose a probabilistic methodology to estimate the location of point P in global positioning system and to simulate it using MATLAB. The GPS receiver requires a minimum of four satellites to provide a three-dimensional (3D) fix and three satellites to provide a two-dimensional (2D) fix.A three-dimensional (3D) fix(More)
We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log 2 n) expected(More)
  • 1