
	Home
	Seminar

	Institute home page

Algorithms and Complexity Theory
Research Group

at
Institute of Computer Science,
University of Wroclaw.

Name	Research interests
Marcin Bieńkowski	On-line algorithms; Approximation algorithms;
Monika Demichowicz	Computational biology;
Artur Jeż	Computational complexity; Automata and formal languages; Combinatorial Theory
Tomasz Jurdziński	Theory of computation: automata theory, complexity theory, formal languages; Distributed and mobile computing; Information security;
Przemysława Kanarek	Design of algorithms;
Krzysztof Kozielczyk	Network protocols; Secure network protocols; Distributed computing; Software development process;
Maciej Liśkiewicz	Computational and structural complexity; Efficient algorithms and parallel processing; Interactive proof systems and cryptography; Computational biology; Information hiding;
Krzysztof Loryś (Group leader)	Approximation algorithms; Parallel computations; Computational complexity; Formal languages; Periodic sorting networks; Switching networks;
Aleksander Mądry	Combinatorial Optimization; Computational Complexity; Quantum Cryptography; Randomness in Computer Science;
Katarzyna Paluch	Design of algorithms;
Marek Piotrów	Design of algorithms;
Łukasz Piwowar	Realistic computer graphics; Discreete adaptive radiosity; Interactive progressive raytracing;
Paweł Rajba	Design of algorithms;
Paweł Rzechonek	Design of algorithms;
Przemysław Skibiński	Lossless data compression; Text compression; Dictionary compression; Transformation; Preprocessing; Filtering;
Grzegorz Stachowiak	Design of algorithms;
Paweł Zalewski	Design of algorithms;
Grażyna Zwoźniak	Design of algorithms;