Theoretical Computer Science
Faculty of Mathematics and Computer Science
Jagiellonian University
 
UJ coat of arms
Algorithmics Research Group   abacus
 
 

Marcin Kozik

PhD

phone: (+48-12) 664 69 35
fax: (+48-12) 664 69 13
email: email
office: ul. Gronostajowa 3, 30-387 Krakow
room: 106

photo

research interests
universal algebra
computational complexity theory
Constraint Satisfaction Problem

selected publications
  • Libor Barto, Marcin Kozik, Miklos Maroti, Todd Niven
         CSP dichotomy for special triads
         [in preparation]
  • Marcin Kozik
         Varietal membership problem is 2EXPTIME complete
         [submitted] [manuscript]
  • Libor Barto, Marcin Kozik, Todd Niven
         The CSP dichotomy holds for digraphs with no sources and no sinks
         (a positive answer to a conjecture of Bang-Jensen and Hell)
         [to appear, SIAM Journal on Computing] [manuscript]
  • Libor Barto, Marcin Kozik, Miklos Maroti, Ralph McKenzie, Todd Niven
         Congruence modularity implies cyclic terms (for finite algebras)
         [to appear, Algebra Universalis] [manuscript]
  • Marcin Kozik
        A finite set of functions with an EXPTIME-complete composition problem
        [to appear, Theoretical Computer Science] [manusript]
  • Marcin Kozik, Gabor Kun
         The subdirectly irreducible algebras in the variety generated by graph algebras
         [Algebra Universalis 58(2008) 229-242]
  • Libor Barto, Marcin Kozik, Todd Niven
        Graphs, polymorphisms and the complexity of homomorphism problems
        [Proceedings of the 40th ACM Symposium on Theory of Computing, STOC'08, 789-796]
  • Marcin Kozik
         Computationally and algebraically complex finite algebra membership problems
         [International Journal of Algebra and Computation 17(2007) 1635-1666] [manuscript]
  • Iwona Cieślik, Marcin Kozik, Piotr Micek
         On-line coloring of Is-free graphs and co-planar graphs
         [Discrete Mathematics and Theoretical Computer Science Proceedings AF (2006), 61-68]
  • Marcin Kozik
         On some complexity problems in finite algebras
         [dissertation, Vanderbilt University]
  • Marcin Kozik
         Measurements of object complexity
         [masters thesis, Jagiellonian University]

  • some recent collaborators 
    Libor BartoCharles University, Prague
    Todd Niven

    short cv
    2000Master of Science in Computer ScienceJagiellonian UniversityKrakow, Poland
    2002Master of Science in MathematicsVanderbilt UniversityNashville, TN
    2004Philosophy Doctor in MathematicsVanderbilt UniversityNashville, TN
    2004Jonsson prize for the best graduate student researchVanderbilt UniversityNashville, TN
    2004AssistantJagiellonian UniversityKrakow, Poland
    2006PostdocCharles University and
    Eduard Čech Center
    Prague, Czech Republic
    2007Associate ProfessorJagiellonian UniversityKrakow, Poland
    2007PostdocCharles University and
    Eduard Čech Center
    Prague, Czech Republic
     
     
      webmaster: www-tcs@tcs.uj.edu.pl