Datové struktury pro setříděné ukládání dat
In this work we study two variants of a bucketing game. This game is used for the lower bound proof of time complexity of item insertion into a sorted array, a data structure for the order maintenance problem. We show that these two variants of the bucketing game have the same time complexity up to...
Main Author: | |
---|---|
Other Authors: | |
Format: | Dissertation |
Language: | English |
Published: |
2010
|
Online Access: | http://www.nusl.cz/ntk/nusl-298661 |