Talks

(subscribe: list, rss feed, calendar feed)
Jun
30

Martin Schäf

Classifying Bugs with Interpolants

Jun
23

Igor Razgon

Lower bounds for branching programs of bounded repetition computing CNFs of bounded treewidth: an overview

May
12

Idit Keidar

Transactional Data Structure Libraries
Thursday, May 12, 2016 at 17:00

May
31

Leslie Lamport

Leslie Lamport will answer questions regarding his Heidelberg Laureate Forum lecture.

Apr
28

Tom van Dijk

Workers in forests: developments in parallel decision diagrams

Apr
12

Joseph Sifakis

Rigorous System Design in BIP

News

PostDoc position within the project “Oligomorphic clones”

The position will initially be for one year, but the project will be running until 4/2018 and prolongation of the position is negotiable.

Postdoc position in Parameterized Complexity at Vienna University of Technology, Austria

There is an opening for a fully funded postdoc position for the duration of two years at the Vienna University of Technology.

Funded PhD position in Quantified Boolean Formula (QBF) solving

There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving at the Vienna University of Technology, Vienna, Austria.

VCLA International Student Awards

The Vienna Center for Logic and Algorithms announces the first edition of the VCLA International Student Awards

PhD Position in Parameterized Complexity

PhD Position in Parameterized Complexity at TU Vienna, Austria