High System-Code Security with Low Overhead
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems
Self join elimination and new notions of query containment
Economics and Computation: Five Challenges in Algorithmic Game Theory, Computational Social Choice, and Fair Division
Classifying Bugs with Interpolants
Lower bounds for branching programs of bounded repetition computing CNFs of bounded treewidth: an overview
Four winners in two award categories were celebrated on May 15, 2015.
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