Konstan, JosephA. and Riedl, John. Recommender systems: from algorithms to user experience. In User Modeling and User-Adapted Interaction, (22) 1-2: 101-123, Springer Netherlands, Year 2012.

Goodrich, Michael T. and Tamassia, Roberto. Data structures and algorithms in Java. Wiley, Hoboken, NJ, Year 2011.

Yang, You, Ping Yu und Yan Can. Experimental study on the five sort algorithms.. Experimental study on the five sort algorithms.. editor(s) Automation, Mechanic and (MACE), Control Engineering. Year 2011.

Ganter, Bernhard. Two Basic Algorithms in Concept Analysis. Formal Concept Analysis. editor(s) Kwuida, Léonard and Sertkaya, Baris. Lecture Notes in Computer Science, (5986) 312-340, Springer, Berlin / Heidelberg, Year 2010.

Leskovec, Jure and Lang, Kevin J. and Mahoney, Michael W.. Empirical Comparison of Algorithms for Network Community Detection. Year 2010.

Cormen, Thomas H.. Introduction to algorithms. The MIT Press, Cambridge, Masachusetts; London, Year 2009.

Cormen, Thomas H.. Introduction to algorithms. The MIT Press, Cambridge, Masachusetts; London, Year 2009.

Parra, Denis and Brusilovsky, Peter. Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike. Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web. CEUR Workshop Proceedings, (467) Year 2009.

Gruber, Hermann and Holzer, Markus and Ruepp, Oliver. Sorting the slow way: an analysis of perversely awful randomized sorting algorithms. Proceedings of the 4th international conference on Fun with algorithms. FUN'07, 183--197, Springer-Verlag, Berlin, Heidelberg, Year 2007.

O'Madadhain, Joshua and Hutchins, Jon and Smyth, Padhraic. Prediction and ranking algorithms for event-based network data. In SIGKDD Explor. Newsl., (7) 2: 23--30, ACM, New York, NY, USA, Year 2005.

Cullum, J.K. and Willoughby, R.A.. Lanczos algorithms for large symmetric eigenvalue computations: Documentaion and Listings Original Lanczos Codes. Society for Industrial Mathematics, Year 2002.

Cullum, J.K. and Willoughby, R.A.. Lanczos algorithms for large symmetric eigenvalue computations: Theory. Society for Industrial Mathematics, Year 2002.

Kuznetsov, Sergei O. and Obiedkov, Sergei A.. Comparing performance of algorithms for generating concept lattices. In Journal of Experimental & Theoretical Artificial Intelligence, (14) 2-3: 189-216, Year 2002.

Knuth, Donald Ervin. The art of computer programming : 1. Fundamental algorithms. Addison-Wesley, Upper Saddle River, NJ [u.a.], Year 1997.

Knuth, Donald Ervin. The art of computer programming : 1. Fundamental algorithms. Addison-Wesley, Upper Saddle River, NJ [u.a.], Year 1997.

Knuth, Donald Ervin. The art of computer programming : 1. Fundamental algorithms. Addison-Wesley, Upper Saddle River, NJ [u.a.], Year 1997.

Knuth, Donald Ervin. The art of computer programming : 1. Fundamental algorithms. Addison-Wesley, Upper Saddle River, NJ [u.a.], Year 1997.

Knuth, Donald Ervin. The art of computer programming : 1. Fundamental algorithms. Addison-Wesley, Upper Saddle River, NJ [u.a.], Year 1997.

Musser, David R.. Introspective sorting and selection algorithms. In Software — Practice and Experience, (27) 8: 983 - 993 , Year 1997.

Lawson, Charles L. and Hanson, Richard J.. Solving Least Squares Problems (Classics in Applied Mathematics). Society for Industrial Mathematics, Year 1987.