Seminarium, Teoretisk datalogi

Kalenderhändelser saknas för aktuell period.

Kommande kalenderhändelser:

• Philipp Rümmer: SAT-based learning to verify liveness of randomised parameterised systems

  6 mar

  Seminarium, Teoretisk datalogi

  måndag 2017-03-06, 13.15

  Medverkande: Philipp Rümmer, Uppsala University

  Plats: Room 4523, Lindstedtsvägen 5, KTH CSC

  2017-03-06T13:15:00.000+01:00 2017-03-06T13:15:00.000+01:00 Philipp Rümmer: SAT-based learning to verify liveness of randomised parameterised systems (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Philipp Rümmer: SAT-based learning to verify liveness of randomised parameterised systems (Seminarium, Teoretisk datalogi)

• Ciaran McCreesh: Finding little graphs inside big graphs (in parallel)

  10 mar

  Seminarium, Teoretisk datalogi

  fredag 2017-03-10, 12.00

  Medverkande: Ciaran McCreesh, University of Glasgow

  Plats: Room 4523, Lindstedtsvägen 5, KTH CSC

  2017-03-10T12:00:00.000+01:00 2017-03-10T12:00:00.000+01:00 Ciaran McCreesh: Finding little graphs inside big graphs (in parallel) (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Ciaran McCreesh: Finding little graphs inside big graphs (in parallel) (Seminarium, Teoretisk datalogi)

• Aaron Potechin: A nearly tight sum-of-squares lower bound for the planted clique problem

  13 mar

  Seminarium, Teoretisk datalogi

  måndag 2017-03-13, 12.00

  Medverkande: Aaron Potechin, Institute for Advanced Study

  Plats: Room 4523, Lindstedtsvägen 5, KTH CSC

  2017-03-13T12:00:00.000+01:00 2017-03-13T12:00:00.000+01:00 Aaron Potechin: A nearly tight sum-of-squares lower bound for the planted clique problem (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Aaron Potechin: A nearly tight sum-of-squares lower bound for the planted clique problem (Seminarium, Teoretisk datalogi)