amortized analysis factor of the best static search trees exercise (bshows that splay trees are optimalto within constant factor of the best optimal search trees theseas well as two other strong resultsare proved in the original splay tree paper [ amortization is used in [ to merge balanced search tree efficiently the merge operation for splay trees is described in [ solution to exercise can be found in [ exercise is from [ amortized analysis is used in [ to design an online algorithm that processes series of queries in time only constant factor larger than any offline algorithm in its class brown"implementation and analysis of binomial queue algorithms,siam journal on computing ( ) - brown and tarjan"design and analysis of data structure for representing sorted lists,siam journal on computing ( ) - fredman and tarjan"fibonacci heaps and their uses in improved network optimization algorithms,journal of the acm ( ) - gajewska and tarjan"deques with heap order,information processing letters ( ) - khoong and leong"double-ended binomial queues,proceedings of the fourth annual international symposium on algorithms and computation ( ) - port and moffat" fast algorithm for melding splay trees,proceedings of first workshop on algorithms and data structures ( ) - sleator and tarjan"self-adjusting binary search trees,journal of the acm ( ) - sleator and tarjan"amortized efficiency of list update and paging rules,communications of the acm ( ) - sleator and tarjan"self-adjusting heaps,siam journal on computing ( ) - tarjan"amortized computational complexity,siam journal on algebraic and discrete methods ( ) - vuillemin" data structure for manipulating priority queues,communications of the acm ( ) -