S. Albers and J. Westbrook. Self-organizing data structures. In Amos Fiat and Gerhard Woeginger, editors, Online Algorithms: The State of the Art, pages 13--51. Springer LNCS 1442, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Length-Restricted Coding - Gagie (2003) (Correct)
....during a successful search in T is c, then the expected codeword length using this code to encode S is at most c 2#lg c# 1. Using these ideas, dynamic codes can be obtained from dynamic binary search trees. They can also be obtained from other dynamic data structures. Albers and Westbrook [AW96] survey several uses of dynamic data structures for data compression. The problem of static, length unrestricted, non alphabetic coding was addressed by Shannon [Sha48] whose results we discuss in section 1.2; and Fano [Fan49] who presented a similar algorithm. Later, Hu#man [Huf52] presented a ....
S. Albers and J. Westbrook. Self-organizing data structures. In Online Algorithms, pages 13--51, 1996.
Self-Adjusting Trees in Practice for Large Text Collections - Williams, Zobel, Heinz (2002) (2 citations) (Correct)
....in their original description of the splay tree, propose heuristics for reducing the costs of self adjustment and note that the practical e#ciency of various splaying and [heuristic] semisplaying methods remains to be determined . One motivation for our work is to augment theoretical analyses [1] by experimenting with e#ciency heuristics for index construction in large text databases. In addition, we seek to verify whether it is true that splay trees are as e#cient as balanced trees when total running time is the measure of interest and whether, as claimed, they can be much more ....
S. Albers and J. Westbrook. Self-organizing data structures. In Amos Fiat and Gerhard Woeginger, editors, Online Algorithms: The State of the Art, pages 31--51. Springer-Verlag, 1998.
Offline List Update is NP-hard - Ambühl (2000) (Correct)
....time in the number of items in the list. We show that there is no polynomial algorithm unless P = NP . Keywords. On line algorithms, competitive analysis, list update, NP. 1 Introduction The list update problem is a classical online problem in the area of self organizing data structures [16, 4, 8]. In this paper, we will be concerned with the offline version of that problem (OLUP) In both versions, requests to items in an unsorted linear list must be served by accessing the requested item. If the item is at position i in the list, the access incurs a cost of i units in the full cost model ....
S. Albers and J. Westbrook (1998), Self Organizing Data Structures. In A. Fiat, G. J. Woeginger, "Online Algorithms: The State of the Art", Lecture Notes in Comput. Sci., 1442, Springer, Berlin, 13--51.
Optimal Projective Algorithms for the List Update Problem - Ambühl, Gärtner, von Stengel (Correct)
....ratio is never smaller than 1.6. Therefore, COMB is a best possible projective algorithm, and any better algorithm, if it exists, would need a non projective approach. 1 Introduction The list update problem is a classical online problem in the area of self organizing data structures [4]. Requests to items in an unsorted linear list must be served by accessing the requested item. We assume the partial cost model where accessing the ith item in the list incurs a cost of i Gamma 1 units. This is simpler to analyze than the original full cost model [12] where that cost is i. The ....
S. Albers and J. Westbrook (1998), Self Organizing Data Structures. In A. Fiat, G. J. Woeginger, "Online Algorithms: The State of the Art", Lecture Notes in Comput. Sci., 1442, Springer, Berlin, 13--51.
On List Update and Work Function Algorithms - Anderson, Hildrum, Karlin.. (Correct)
....of the list. This approach leads to a new simple proof that a large class of online algorithms, including Move To Front, is (2 Gamma 1=k) competitive. 1 Introduction 1. 1 Motivation The list accessing or list update problem is one of the most well studied problems in competitive analysis [1], 2] 3] 4] 5] The problem consists of maintaining a set S of items in an unsorted linked list, for example as a data structure for implementation of a dictionary. The data structure must support three types of requests: ACCESS(x) INSERT(x) and DELETE(x) where x is the name, or key , of an ....
....not involving the next referenced element. 2 We say an algorithm is strongly competitive if its competitive ratio is within a constant factor of the best competitive ratio achievable. 4 that study could be helpful in the study of dynamic optimality for self adjusting binary search trees [1], 15] It is a long standing open question whether or not there is a strongly competitive algorithm for dynamically rearranging a binary search tree using rotations, in response to a sequence of accesses. The similarity between Move To Front as an algorithm for dynamically rearranging linked ....
S. Albers and J. Westbrook. Self-organizing data structures. In Online Algorithms: The State of the Art, Fiat-Woeginger, Springer, 1998.
Efficient Adaptive Data Compression Using Fano Binary Search.. - Rueda, Oommen (Correct)
No context found.
S. Albers and J. Westbrook. Self-organizing data structures. In Amos Fiat and Gerhard Woeginger, editors, Online Algorithms: The State of the Art, pages 13--51. Springer LNCS 1442, 1998.
Deferred, Self-Organizing BSP Trees - Ar, Montag, Tal (2002) (Correct)
No context found.
Albers, S. and Westbrook, J. Self-Organizing data Structures, from Online Algorithms. The State of the Art, LNCS State of the Art Survey, Fiat, A. and Woeginger G. J., (editors). Springer.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC