Konstan, JosephA., Riedl, John,
Recommender systems: from algorithms to user experience, in:
User Modeling and User-Adapted Interaction
22
1-2
(2012),
S. 101-123.
Goodrich, Michael T., Tamassia, Roberto
Data structures and algorithms in Java,
5. ed., internat. student version. Aufl.,
Hoboken, NJ 2011.
Yang, You, Ping Yu und Yan Can
; Automation, Mechanic (Bearb.) ; (MACE), Control Engineering (Bearb.):
Experimental study on the five sort algorithms..
In: Experimental study on the five sort algorithms.,
2011
Ganter, Bernhard,
Two Basic Algorithms in Concept Analysis, in:
Kwuida, Léonard, Sertkaya, Baris (Hrsg.), Formal Concept Analysis,
Bd. 5986, Berlin / Heidelberg 2010,
S. 312-340.
Leskovec, Jure, Lang, Kevin J., Mahoney, Michael W.,
Rezension zu: Empirical Comparison of Algorithms for Network Community Detection
(2010).
Cormen, Thomas H.
Introduction to algorithms,
Cambridge, Masachusetts; London 2009.
Cormen, Thomas H.
Introduction to algorithms,
Cambridge, Masachusetts; London 2009.
Parra, Denis, Brusilovsky, Peter:
Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike.
467.
In: Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web,
2009
(CEUR Workshop Proceedings)
Gruber, Hermann, Holzer, Markus, Ruepp, Oliver:
Sorting the slow way: an analysis of perversely awful randomized sorting algorithms.
In: Proceedings of the 4th international conference on Fun with algorithms.
Berlin, Heidelberg
: Springer-Verlag,
2007
(FUN'07). - ISBN
978-3-540-72913-6,
S. 183--197
O'Madadhain, Joshua, Hutchins, Jon, Smyth, Padhraic,
Prediction and ranking algorithms for event-based network data, in:
SIGKDD Explor. Newsl.
7
2
(2005),
S. 23--30.
Cullum, J.K., Willoughby, R.A.
{Lanczos algorithms for large symmetric eigenvalue computations: Documentaion and Listings Original Lanczos Codes}.
Cullum, J.K., Willoughby, R.A.
{Lanczos algorithms for large symmetric eigenvalue computations: Theory}.
Kuznetsov, Sergei O., Obiedkov, Sergei A.,
Comparing performance of algorithms for generating concept lattices, in:
Journal of Experimental & Theoretical Artificial Intelligence
14
2-3
(2002),
S. 189-216.
Knuth, Donald Ervin
The art of computer programming : 1. Fundamental algorithms,
3. ed., 1. printing. Aufl.,
Upper Saddle River, NJ [u.a.] 1997.
Knuth, Donald Ervin
The art of computer programming : 1. Fundamental algorithms,
3. ed., 1. printing. Aufl.,
Upper Saddle River, NJ [u.a.] 1997.
Knuth, Donald Ervin
The art of computer programming : 1. Fundamental algorithms,
3. ed., 1. printing. Aufl.,
Upper Saddle River, NJ [u.a.] 1997.
Knuth, Donald Ervin
The art of computer programming : 1. Fundamental algorithms,
3. ed., 1. printing. Aufl.,
Upper Saddle River, NJ [u.a.] 1997.
Knuth, Donald Ervin
The art of computer programming : 1. Fundamental algorithms,
3. ed., 1. printing. Aufl.,
Upper Saddle River, NJ [u.a.] 1997.
Musser, David R.,
Introspective sorting and selection algorithms, in:
Software — Practice and Experience
27
8
(1997),
S. 983 - 993 .
Lawson, Charles L., Hanson, Richard J.
Solving Least Squares Problems (Classics in Applied Mathematics),
New edition. Aufl..