Konstan, J. & Riedl, J. (2012),
'Recommender systems: from algorithms to user experience', User Modeling and User-Adapted Interaction
22
(1-2)
, 101-123
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Goodrich, M. T. & Tamassia, R.
(2011),
Data structures and algorithms in Java
, Wiley
, Hoboken, NJ
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Yang, You, P. Y. u. Y. C. (2011),
'Experimental study on the five sort algorithms.'
, in Mechanic Automation & Control Engineering (MACE), ed.,
'Experimental study on the five sort algorithms.'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Ganter, B. (2010),
Two Basic Algorithms in Concept Analysis, in Léonard Kwuida & Baris Sertkaya, ed.,
'Formal Concept Analysis'
, Springer, Berlin / Heidelberg
, pp. 312-340
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Leskovec, J.; Lang, K. J. & Mahoney, M. W. (2010),
'Empirical Comparison of Algorithms for Network Community Detection'
, cite arxiv:1004.3539
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Cormen, T. H.
(2009),
Introduction to algorithms
, The MIT Press
, Cambridge, Masachusetts; London
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Cormen, T. H.
(2009),
Introduction to algorithms
, The MIT Press
, Cambridge, Masachusetts; London
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Parra, D. & Brusilovsky, P. (2009),
Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike, in
'Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Gruber, H.; Holzer, M. & Ruepp, O. (2007),
Sorting the slow way: an analysis of perversely awful randomized sorting algorithms, in
'Proceedings of the 4th international conference on Fun with algorithms'
, Springer-Verlag, Berlin, Heidelberg
, pp. 183--197
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
O'Madadhain, J.; Hutchins, J. & Smyth, P. (2005),
'Prediction and ranking algorithms for event-based network data', SIGKDD Explor. Newsl.
7
(2)
, 23--30
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Cullum, J. & Willoughby, R.
(2002),
Lanczos algorithms for large symmetric eigenvalue computations: Documentaion and Listings Original Lanczos Codes
, Society for Industrial Mathematics
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Cullum, J. & Willoughby, R.
(2002),
Lanczos algorithms for large symmetric eigenvalue computations: Theory
, Society for Industrial Mathematics
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Kuznetsov, S. O. & Obiedkov, S. A. (2002),
'Comparing performance of algorithms for generating concept lattices', Journal of Experimental & Theoretical Artificial Intelligence
14
(2-3)
, 189-216
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Knuth, D. E.
(1997),
The art of computer programming : 1. Fundamental algorithms
, Addison-Wesley
, Upper Saddle River, NJ [u.a.]
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Knuth, D. E.
(1997),
The art of computer programming : 1. Fundamental algorithms
, Addison-Wesley
, Upper Saddle River, NJ [u.a.]
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Knuth, D. E.
(1997),
The art of computer programming : 1. Fundamental algorithms
, Addison-Wesley
, Upper Saddle River, NJ [u.a.]
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Knuth, D. E.
(1997),
The art of computer programming : 1. Fundamental algorithms
, Addison-Wesley
, Upper Saddle River, NJ [u.a.]
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Knuth, D. E.
(1997),
The art of computer programming : 1. Fundamental algorithms
, Addison-Wesley
, Upper Saddle River, NJ [u.a.]
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Musser, D. R. (1997),
'Introspective sorting and selection algorithms', Software — Practice and Experience
27
(8)
, 983 - 993
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Lawson, C. L. & Hanson, R. J.
(1987),
Solving Least Squares Problems (Classics in Applied Mathematics)
, Society for Industrial Mathematics
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]