| 1 (2008) | |||||||||||||
Abstract | |||||||||||||
| Advanced topics in data structures: bibliography list #2 1. Red black tree were first introduced in [10]. A better presentation can be found in [12]. 2. Finger search tree were introduced in [7]. 3. The jordan sorting algorithm is in [8]. See also [13]. 4. Triangulation of a simple polygon in O(log log n) time is in [13]. A linear time algorithm is in [2]. 5. The algorithm for single source shortest path in a simple polygon is from [6]. 6. Various kinds of biased search trees are described in [1]. 7. Splay trees were introduces in [11]. Material on compression via splay trees can be found in [9] and [5]. The recent proof of the dynamic finger conjecture is in [4, 3]. 8. Dynamic trees are described in [11]. | |||||||||||||
Details der Publikation | |||||||||||||
| |||||||||||||