| dc.contributor.author |
Lagogiannis, G |
en |
| dc.contributor.author |
Makris, C |
en |
| dc.contributor.author |
Tsakalidis, A |
en |
| dc.date.accessioned |
2014-06-06T06:46:56Z |
|
| dc.date.available |
2014-06-06T06:46:56Z |
|
| dc.date.issued |
2006 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.1016/j.jda.2005.01.006 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/3303 |
|
| dc.subject |
Computer Model |
en |
| dc.subject |
Data Structure |
en |
| dc.subject |
Ordered Set |
en |
| dc.subject |
Search Trees |
en |
| dc.subject |
Structural Change |
en |
| dc.subject |
Word Length |
en |
| dc.subject |
Lower Bound |
en |
| dc.title |
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem |
en |
| heal.type |
journalArticle |
en |
| heal.identifier.primary |
10.1016/j.jda.2005.01.006 |
en |
| heal.publicationDate |
2006 |
en |
| heal.abstract |
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations |
en |
| heal.journalName |
Journal of Discrete Algorithms |
en |
| dc.identifier.doi |
10.1016/j.jda.2005.01.006 |
en |