| dc.creator | Bozanis, P. | en |
| dc.date.accessioned | 2015-11-23T10:24:10Z | |
| dc.date.available | 2015-11-23T10:24:10Z | |
| dc.date.issued | 2003 | |
| dc.identifier.isbn | 3-540-07544-5 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/11615/26435 | |
| dc.description.abstract | We propose RPST, a randomized data. structure for the 11/2-dimensional range query problem, based on a version of, Skip Lists, as an alternative to solutions that use. deterministic height balanced trees. Our scheme exhibits, with high probability, logarithmic, output-sensitive search time, expected logarithmic update time, expected constant reconstruction time and linear space overhead with high probability. | en |
| dc.source | Advances in Informatics | en |
| dc.source.uri | <Go to ISI>://WOS:000183490000028 | |
| dc.subject | SEARCH-TREES | en |
| dc.subject | LISTS | en |
| dc.subject | Computer Science, Information Systems | en |
| dc.subject | Computer Science, Theory & | en |
| dc.subject | Methods | en |
| dc.title | A new randomized data structure for the 11/2-dimensional range query problem | en |
| dc.type | bookChapter | en |
