Stefan Szeider

Stefan Szeider is an Austrian computer scientist who works on the areas of algorithms, computational complexity, theoretical computer science, and more specifically on propositional satisfiability, constraint satisfaction problems, and parameterised complexity. He is a full professor at the Faculty of Informatics at the Vienna University of Technology (TU Wien), the head of the Algorithms and Complexity Group, and co-chair of the [http://www.vcla.at/ Vienna Center for Logic and Algorithms (VCLA)] of TU Wien. Provided by Wikipedia
Showing 1 - 3 results of 3 for search 'Szeider, Stefan', query time: 0.02s Refine Results
  1. 1
    Theory and Applications of Satisfiability Testing – SAT 2010 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings
    by Strichman, Ofer
    Published 2010
    Other Authors: “…Szeider, Stefan…”
    Get full text
    Electronic Kit Book
  2. 2
    Theory and Applications of Satisfiability Testing – SAT 2010 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings /
    Published 2010
    Other Authors: “…Szeider, Stefan…”
    Full Text via HEAL-Link
    Electronic eBook
  3. 3
    Parameterized and Exact Computation 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers /
    Published 2013
    Other Authors: “…Szeider, Stefan…”
    Full Text via HEAL-Link
    Electronic eBook
Search Tools: RSS Feed – Email Search