University of Bonn

Institute of Computer Science V

Discrete Algorithms

Dr. rer. nat. Claus Rick

Contact: Dr. rer. nat. Claus Rick Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik V Römerstraße 164 D-53117 Bonn Tel.: +49 228 73-4120 Fax: +49 228 73-4571 E-mail: rick@cs.uni-bonn.de Office: N106

Research:

• Design and analysis of discrete algorithms
• Computational Biology

List of publications:

• Claus Rick,
  Simple and Fast Linear Space Computation of Longest Common Subsequences,
  Information Processing Letters, Vol. 75/6, 275 - 281,
  Elsevier (2000)
• Claus Rick,
  Efficient Computation of All Longest Common Subsequences,
  Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000),
  Lecture Notes in Computer Science, Vol. 1851, 407 - 418
  Springer Verlag (2000)
• Claus Rick, Hein Röhrig,
  Deriving Non-Approximability Results by Reductions,
  Chapter 8 (pp. 213 - 233) in: Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.),
  Lectures on Proof Verification an Approximation Algorithms,
  LNCS Tutorial, Vol. 1367,
  Springer Verlag (1998)
• Claus Rick,
  A New Flexible Algorithm for the Longest Common Subsequence Problem,
  Proceedings of the 6th Symposium on Combinatorial Pattern Matching (CPM'95),
  Lecture Notes in Computer Science, Vol. 937, 340 - 351,
  Springer Verlag (1995)
  Also in Nordic Journal of Computing (NJC), Vol. 2, No. 4, Winter 1995, 444 - 461.
• Claus Rick,
  New Algorithms for the Longest Common Subsequence Problem,
  Research Report No. 85123-CS, University of Bonn, October 1994