Theoretical Computer Science
Faculty of Mathematics and Computer Science
Jagiellonian University
 
UJ coat of arms
Algorithmics Research Group   abacus
 
 
2008
  • Andrzej Hołubowicz,
    Complexity of selected graph problems,
    supervisor: Maciej Ślusarek
     
  • Arkadiusz Pawlik,
    Internet System for Programming Contests,
    supervisor: Paweł M. Idziak
2007
  • Maciej Chociej,
    Painter`s algorithm for 3D real time graphics,
    supervisor: Maciej Ślusarek
     
  • Grzegorz Łukasik,
    On-line coloring of interval graphs,
    supervisor: Maciej Ślusarek
     
  • Tadeusz Prochwicz,
    Cryptographic mechanisms in electronic communication,
    supervisor: Paweł M.Idziak
     
  • Michał Staromiejski,
    The Weil pairing and the computation of discrete logarithms on elliptic curves,
    supervisor: Paweł M. Idziak
2006
  • Lech Duraj,
    Computational complexity of some tillling problems,
    supervisor: Pawel M. Idziak
     
  • Grzegorz Gutowski,
    On-line coloring of k-connected subgraphs.,
    supervisor: Maciej Ślusarek
     
  • Andrzej Pezarski,
    On-line clique covering of interval graphs,
    supervisor: Paweł M. Idziak
     
  • Andrzej Stencel,
    Hidden subgroup problem in quantum computing,
    supervisor: Tomasz Gorazd
     
  • Paweł Walter,
    Teaching mathematics through algorithmics,
    supervisor: Paweł M. Idziak
2005
  • Grzegorz Herman,
    Computational complexity of bipartite orders,
    supervisor: Pawel M. Idziak
     
  • Piotr Mizera,
    A kinetic approach to the shooter problem,
    supervisor: Maciej Ślusarek
     
  • Mikołaj Zalewski,
    Mobile programming,
    supervisor: Tomasz Gorazd
     
  • Maciej Żenczykowski,
    Efficient autonomous real-time system for the verification and selection of alternative numerical solutions,
    supervisor: Paweł M. Idziak
2004
  • Bartłomiej Bosek,
    Adaptive online coloring of upgrowing orders,
    supervisor: Paweł M. Idziak
     
  • Przemysław Broniek,
    Real-time scheduling on bounded number of processors,
    supervisor: Paweł M. Idziak
     
  • Jarosław Duda,
    Plane fractal covering,
    supervisor: Tomasz Gorazd
     
  • Piotr Micek,
    Lower bound for the adaptive coloring online problem of upgrowing orders,
    supervisor: Paweł M. Idziak
     
  • Anna Zych,
    Algorithmic invariants for partially ordered sets,
    supervisor: Paweł M. Idziak
2003
  • Kamil Kloch,
    Off- and on-line dimension of partially ordered sets,
    supervisor: Paweł M. Idziak
     
  • Rafał Mamak,
    An optimal algorithm for the recognition of circular arc graphs,
    supervisor: Maciej Ślusarek
2002
  • Iwona Cieślik,
    Applications of quantum algorithms to solvable groups,
    supervisor: Tomasz Gorazd
     
  • Marcin Klisiak,
    Extracting Authoritative Sources from WWW through Analisys of Hypertext Link Structure,
    supervisor: Tomasz Gorazd
     
  • Jacek Krzaczkowski,
    Quantum computing in number theory and cryptography,
    supervisor: Paweł M. Idziak
     
  • Mateusz Matula,
    Managing an online service centre using Open Source systems,
    supervisor: Tomasz Gorazd
2001
  • Wojciech Jawor,
    Approximation of NP-complete problems and the PCP Theorem,
    supervisor: Maciej Ślusarek
     
  • Mariusz Pytel,
    Approximation algorithms for resource allocation problems,
    supervisor: Maciej Ślusarek
2000
  • Marcin Kozik,
    Object complexity measures,
    supervisor: Paweł M. Idziak
     
  • Tomasz Krawczyk,
    Graph elimination algorithms,
    supervisor: Maciej Ślusarek
     
  • Wiesław Rotter,
    Efficient transformation algorithms for integer matrices,
    supervisor: Maciej Ślusarek
1999
  • Marcin Bilski,
    Generative complexity in semigroup varieties,
    supervisor: Paweł M. Idziak
     
  • Grzegorz Król,
    New heuristics and approximation methods for the graph coloring problem,
    supervisor: Maciej Ślusarek
1998
  • Piotr Kot,
    Computing homology of cubical complexes in R^n,
    supervisor: Maciej Ślusarek
1996
  • Zbigniew Jagiełło,
    Implementation of mergeable priority queues - a comparative analysis,
    supervisor: Maciej Ślusarek
     
  • Leszek Mika,
    Combinatorial hierarchy inside NP,
    supervisor: Paweł M. Idziak
     
  • Edward Szczypka,
    Computational complexity of the isomorphism testing for equivalence relations,
    supervisor: Paweł M. Idziak
1995
  • Marian Folwarczny,
    Graph coloring algorithms,
    supervisor: Maciej Ślusarek
     
  • Jacek Magnuski,
    Succint graph representations,
    supervisor: Maciej Ślusarek
     
  • Janusz Woźniak, Marcin Żelawski,
    A distributed system for 2-dimensional packing,
    supervisor: Maciej Ślusarek
1993
  • Jan Podoski,
    Computational complexity of the isomorphism testing for partially ordered sets,
    supervisor: Paweł M. Idziak
1992
  • Andrzej Kubicz,
    A comparative analysis of text indexing methods,
    supervisor: Maciej Ślusarek
1991
  • Jacek Bień,
    Textual databases,
    supervisor: Maciej Ślusarek
     
  • Wiesław Chmielnicki,
    Data compression algorithms,
    supervisor: Maciej Ślusarek
 
 
  webmaster: www-tcs@tcs.uj.edu.pl