Stronger Quickheaps
暂无分享,去创建一个
Gonzalo Navarro | Peter Sanders | Patricio V. Poblete | Rodrigo Paredes | P. V. Poblete | P. Sanders | G. Navarro | Rodrigo Paredes
[1] Peter Sanders. Fast Priority Queues for Cached Memory , 1999, ALENEX.
[2] Peter Sanders,et al. STXXL: standard template library for XXL data sets , 2008, Softw. Pract. Exp..
[3] Gonzalo Navarro,et al. On Sorting, Heaps, and Minimum Spanning Trees , 2010, Algorithmica.
[4] Arne Andersson. General Balanced Trees , 1999, J. Algorithms.
[5] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[6] Charles E. Leiserson,et al. Cache-Oblivious Algorithms , 2003, CIAC.
[7] John D. Valois. Introspective sorting and selection revisited , 2000 .
[8] David R. Musser,et al. Introspective Sorting and Selection Algorithms , 1997, Softw. Pract. Exp..
[9] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[10] Conrado Martínez,et al. Randomized binary search trees , 1998, JACM.
[11] Robert E. Tarjan,et al. Self-Adjusting Heaps , 1986, SIAM J. Comput..
[12] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[13] R. Prim. Shortest connection networks and some generalizations , 1957 .
[14] Robert E. Tarjan,et al. The pairing heap: A new form of self-adjusting heap , 2005, Algorithmica.
[15] Jean Vuillemin,et al. A data structure for manipulating priority queues , 1978, CACM.
[16] Gerth Stølting Brodal,et al. On the limits of cache-obliviousness , 2003, STOC '03.
[17] Peter van Emde Boas,et al. Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.
[18] Ingo Wegener. BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small) , 1993, Theor. Comput. Sci..