| dc.contributor.author |
Brodal, G |
en |
| dc.contributor.author |
Lagogiannis, G |
en |
| dc.contributor.author |
Makris, C |
en |
| dc.contributor.author |
Tsakalidis, A |
en |
| dc.contributor.author |
Tsichlas, K |
en |
| dc.date.accessioned |
2014-06-06T06:45:21Z |
|
| dc.date.available |
2014-06-06T06:45:21Z |
|
| dc.date.issued |
2003 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.1016/S0022-0000(03)00013-8 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/2396 |
|
| dc.subject |
Data Structure |
en |
| dc.subject |
Model of Computation |
en |
| dc.subject |
Search Trees |
en |
| dc.title |
Optimal finger search trees in the pointer machine |
en |
| heal.type |
journalArticle |
en |
| heal.identifier.primary |
10.1016/S0022-0000(03)00013-8 |
en |
| heal.publicationDate |
2003 |
en |
| heal.abstract |
We develop a new finger search tree with worst-case constant update time in the pointer machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over 20 years, while many attempts by researchers were made to solve it. The result comes as a consequence of the innovative mechanism that |
en |
| heal.journalName |
Journal of Computer and System Sciences |
en |
| dc.identifier.doi |
10.1016/S0022-0000(03)00013-8 |
en |