Professor Standa Živný

Professor in Computer Science; Fellow of Jesus College


Professor Zivny's research centres around the application of mathematics to the design and analysis of algorithms, with a long-standing interest in optimisation of discrete functions. Much of his work deals with developing efficient algorithms for optimisation problems that can be modelled by separable discrete functions, and proving under which conditions efficient algorithms for such problems can exist. Such problems are studied under many different names in various contexts of computer science: constraint satisfaction problems, pseudo-Boolean optimisation, inference in graphical models, Gibbs energy minimisation, or Markov Random Fields.


  • Algorithms
  • Computational complexity
  • Discrete optimisation
  • Constraint satisfaction
  • Submodular functions


English, Czech