• Vienna Ball of Sciences 2018

    Vienna Center for Logic and Algorithms (VCLA) of the Faculty of Informatics, respecting the tradition of its co-founder Helmut Veith, is once again partnering up with the Vienna Ball of Sciences, which is going to take place on January 27, 2018 – starting at 8 pm in the splendid ball room of Vienna’s […]

    Read More
  • Video Competition: Algorithms in 60 Seconds

    Can you imagine life without algorithms? Already thinking about the future? We are not able to put an age limit on playfully learning about algorithms and fostering computational thinking. However our video competition will need to. Read more on competition for middle and high school pupils „Algorithms in 60 Seconds“ (German: Jugend-Wettbewerb „Algorithmen […]

    Read More
  • Reach VCLA ―Enrich Social Media

    Social media constitute  an important medium for disseminating information. To achieve the spill over effect of the knowledge accumulated within the constituting research groups of VCLA and to connect their members with the network of stakeholders and the general public, VCLA is expanding the channels within the digital community.

    Read More
  • ALGO 2017 Congress on Algorithms

    This September, the premier annual gathering on algorithms in Europe took place in the science hub of central Europe – Vienna.

    Read More

Talks

(subscribe: list, rss feed, calendar feed)
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

Mar
14

O-Joung Kwon

Deletion problems regarding graphs of bounded rank-width
Monday, March 14, 2016 at 11:00

News

PhD Position in Parameterized Complexity

PhD Position in Parameterized Complexity at TU Vienna, Austria

Pre-doc position in theoretical computer science

Application deadline: October 31st;
PhD thesis in the area of constraint satisfaction problems

New VCLA calendar feature

Subscribe to the VCLA calendar feed

Post-doc position in Applied Logic (1 year)

Application deadline: September 30, 2013
Start of position: November 2013 or later

Lecture by Robert Sedgewick

“If You Can Specify It, You Can Analyze It” —The Lasting Legacy of Philippe Flajolet
May 21st, 2013