Wojciech Rytter

From Wikipedia, the free encyclopedia

Wojciech Rytter is a Polish computer scientist, a professor of computer science at the University of Warsaw. His research focuses on the design and analysis of algorithms, and in particular on stringology.

Professional career

Rytter earned a masters degree in 1971 and a Ph.D. in 1975 from Warsaw University, and earned his habilitation in 1985.[1] He has been on the faculty of Warsaw University since 1971, and is now a full professor there.[2] He has also held long-term visiting positions at the New Jersey Institute of Technology, Liverpool University, Bonn University, the University of California, Riverside, Warwick University, and the University of Mexico.[1][2]

Books

Rytter is the author or co-author of:[3]

  • Zagadnienie stabilności automatów skończonych Stochastycznych (in Polish, PKiN, 1972)
  • Automaty funkcyjne (in Polish, Centrum Obliczeniowe Polskiej Akademii Nauk, 1976)
  • Złożność czasowa dwukierunkowych automatów stosowych i programów rekurencyjnych (in Polish, 1983)
  • Efficient parallel algorithms (with Alan Gibbons, Cambridge University Press, 1988)
  • Analysis of algorithms and data structures (with Lech Banachowski and Antoni Kreczmar, Addison-Wesley, 1991)
  • Text algorithms (with Maxime Crochemore, Oxford University Press, 1994)
  • Fast parallel algorithms for graph matching problems (with Marek Karpinski, Clarendon Press, 1998)
  • Jewels of stringology: text algorithms (with Maxime Crochemore, World Scientific, 2002)

Awards and honors

Rytter is a member of the Academia Europaea.[2]

References

  1. ↑ 1.0 1.1 Curriculum vitae, retrieved 2013-01-15.
  2. ↑ 2.0 2.1 2.2 Wojciech Rytter at the Academia Europaea, retrieved 2013-01-15.
  3. ↑ As listed in Worldcat, retrieved 2013-01-15.

External links

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.