Here you go... bei Unklarheiten ungeniert
[R01] Hoare, C. A. R.
Quicksort. Computer Journal 5 (1): 10-15. (1962).
[R02] Ben-Or, M.
Lower bounds for algebraic computation trees. In Proceedings of...: 80-86. (1983).
[R03] Gajentaan, A. and Overmars, M. H.
On a class of O(n^2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165-185. (1995).
[R04] Perl, Y., Itai, A., and Avni, H.
Interpolation search - a log logN search. Commun. ACM 21, 7, 550-553. (1978).
[R05] Sleator, D. D. and Tarjan, R. E.
Self-Adjusting Binary Search Trees. Journ. of the ACM, Vol. 32, No. 3, 652-686. (1985).
[R06] Tarjan, R. E.
Amortized Computational Complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2): 306–318. (1985).
[R07] Chan, T. M.
Optimal output-sensitive convex hull algorithms in two and three dimensions. 1996.
[R08] Pettie, S. and Ramachandran, V.
An optimal minimum spanning tree algorithm. Journal of the ACM, vol. 49, no. 1, pp.16-34, (2002).
[R09] Fredman, M. L. and Tarjan, R. E.
Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, vol. 34, issue 3, pp.596-615, (1987).
[B01] Ottmann, T. und Widmayer, P.:
Algorithmen und Datenstrukturen. 4. Auflage, Spektrum Verlag. (2002).
[B02] Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C.:
Introduction to Algorithms, second edition, MIT Press and McGraw-Hill. (2001).
[B03] de Berg, M., Cheong, O., van Kreveld and M., Overmars, M.:
Computational Geometry: Algorithms and Applications. Third Edition, Springer Verlag. (2008).
[B04] Sedgewick, R.:
Algorithms, Second Edition, Addison-Wesley. (1998).