Algorithmen & Komplexität

Informatik 1

Arbeitsgruppe

Forschung

Lehre

Diverses

Proseminar Algorithmik (Winter 2025/26)

Themen

• k-Means Clustering
  Kanungo, Mount, Netanyahu, Piatko, Silverman, Wu. An efficient k-means clustering algorithm: Analysis and implementation. IEEE Trans. Pattern Analysis and Machine Intelligence. 24:881-892, 2002.


• Correlation Clustering
  Jafarov. Four Algorithms for Correlation Clustering: A Survey. MSc Thesis, U. Chicago.


• Page-Rank Algorithmus
  Chung. A Brief Survey of PageRank Algorithms. IEEE Trans. Network Science and Engineering 1(1), 2014.


• Berechnung von Betweenness Centrality
  Jacob, Koschützki, Lehmann, Peeters, Tenfelde-Podehl. Algorithms for Centrality Indices. In: Network Analysis - Methodological Foundations, chapter 15, LNCS 3418, 2005.


• String Matching
  CLRS, chapter 32: String Matching.


• Shortest Common Superstring
  Turner. Approximation algorithms for the shortest common superstring problem. Information and Computation 83(1):1-20, 1989.


• Longest Common Subsequence
  CLRS, section 15.4: Longest Common Subsequence.


• LZW Kompression
  Welch. A Technique for High-Performance Data Compression. IEEE Computer 17:8-19, 1984.


• RSA Kryptosystem
  CLRS, section 31.7: RSA Crypto System.


• Algorithmen für Primzahltests


• Cuckoo Hashing
  Cuckoo Hashing.J. Algorithms 51(2):122-144, 2004.


• Fibonacci Heaps
  CLRS, chapter 19: Fibonacci Heaps.


• B-Bäume
  CLRS, chapter 18: B-Trees.


• Alpha-Beta-Suche für Spielbäume
  Knuth, Moore. An analysis of alpha-beta pruning. Artificial Intelligence 6(4):293-326, 1975.