Jiří Sgall

I am a member of the Department of Applied Mathematics of the Faculty of Mathematics and Physics at the Charles University in Prague. I am also affiliated with Institute of Mathematics of the Academy of Sciences of the Czech Republic.

Publications and research interests

• Surveys
  
• On-line and approximation algorithms, scheduling
• Complexity and combinatorics (including communication complexity, complexity of propositional proof systems, and circuit complexity)
• Other areas (combinatorial games, cryptography, DNA computations, alternative set theory)

Teaching - výuka

• Seminar z aproximacnich a online algoritmu (approximation and online algorithms seminar)
  
• Seminar z vypocetni slozitosti (complexity seminar - now maintained by Michal Koucky)
• more (mostly in Czech)

Previous years (a selection)

• Spring 2002: Probabilistic proofs and NP-completeness (the PCP theorem and its consequences, includes some notes in English)

Scientific activities

• Editorial
  
  • Associate Editor of Journal of Scheduling
  • Associate Editor of Operations Research Letters
  • Field Editor of Discrete Mathematics & Theoretical Computer Science
  • Guest Editor of a special volume of  Theoretical Computer Science from MFCS 2001
  • Proceedings of MFCS 2001, Springer LNCS 2136
• Conference committee
  
  • Program committee chair of ICALP 2011
  • Program committee co-chair of MAPSP 2011
    
  • Program committee chair of MFCS 2001
  • Program committee member: MFCS 2010, STACS 2010, ESA 2009, PPAM-SPC 2009, IFIP TCS 2008, SAGA 2007, ESCAPE 2007, APPROX 2006, ICALP 2006, AAIM 2006, MAPSP 2005, ICALP 2003, MAPSP 2003, ESA 2002, MFCS 2002,  MFCS 2000, STACS 1999, MFCS 1998.
  • Organizing committee member: ESA 1999, Logic Colloquium 1998
• Other
  
  • EATCS council member 2001-2009

My CV, also in Czech (usually slightly obsolete)

Contact Information

Last changed March 2, 2010