Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Pointer machine"”.
-
Computational complexity of random-access models
… is considered. These models are the Turing machine and its multidimensional variant, the random access machine (RAM), the tree machine, and the pointer machine. The basic computational properties of the pointer machine are examined in more detail. For example, time and space hierarchy …
-
Αποτελεσματικοί αλγόριθμοι και βελτιωμένες τεχνικές αναζήτησης χωρικής, χρονικής και χώρο-χρονικής πληροφορίας
… refer to the Temporal Precedence Problem on Pine 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 power of parallel time
… we address the following question: Are parallel machines always faster than sequential machines? Our approach is to examine the common machine models of sequential computation. For each such machine ${\cal M}$ that runs in time T, we determine whether it is possible to speed up ${\cal M}$ by a …
-
Algorithms and Data Structures for Geometric Intersection Query Problems
… built for the internal memory model (word-RAM or pointer machine model), but in some settings they are generic enough to be efficient in the I/O-model as well.
-
On Geometric Range Searching, Approximate Counting and Depth Problems
… three dimensions, we solve this problem in the pointer machine model and the external memory model by offering the first optimal data structures in these models of computation. Also, in the RAM model and for points from an integer grid we reduce the space complexity of the fastest known data …