Classifying Bugs with Interpolants
Lower bounds for branching programs of bounded repetition computing CNFs of bounded treewidth: an overview
Transactional Data Structure Libraries
Thursday, May 12, 2016 at 17:00
Leslie Lamport will answer questions regarding his Heidelberg Laureate Forum lecture.
Workers in forests: developments in parallel decision diagrams
Rigorous System Design in BIP
The position will initially be for one year, but the project will be running until 4/2018 and prolongation of the position is negotiable.
There is an opening for a fully funded postdoc position for the duration of two years at the Vienna University of Technology.
There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving at the Vienna University of Technology, Vienna, Austria.
The Vienna Center for Logic and Algorithms announces the first edition of the VCLA International Student Awards
Funded Doctoral positions
PhD Position in Parameterized Complexity at TU Vienna, Austria