Seminar, Theoretical computer science

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

6 Mar

Seminar, Theoretical computer science

Monday 2017-03-06, 13:15

Participating: Philipp Rümmer, Uppsala University

Location: 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 (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Philipp Rümmer: SAT-based learning to verify liveness of randomised parameterised systems (Seminar, Theoretical computer science)

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

10 Mar

Seminar, Theoretical computer science

Friday 2017-03-10, 12:00

Participating: Ciaran McCreesh, University of Glasgow

Location: 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) (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Ciaran McCreesh: Finding little graphs inside big graphs (in parallel) (Seminar, Theoretical computer science)

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

13 Mar

Seminar, Theoretical computer science

Monday 2017-03-13, 12:00

Participating: Aaron Potechin, Institute for Advanced Study

Location: 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 (Seminar, Theoretical computer science) 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 (Seminar, Theoretical computer science)

Prahladh Harsha: On polynomial approximations to AC0

15 Mar

Seminar, Theoretical computer science

Wednesday 2017-03-15, 10:00

Participating: Prahladh Harsha, (Tata Institute of Fundamental Research)

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

2017-03-15T10:00:00.000+01:00 2017-03-15T10:00:00.000+01:00 Prahladh Harsha: On polynomial approximations to AC0 (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Prahladh Harsha: On polynomial approximations to AC0 (Seminar, Theoretical computer science)

Dmitry Sokolov: Dag-like communication and its applications

16 Mar

Seminar, Theoretical computer science

Thursday 2017-03-16, 13:15

Participating: Dmitry Sokolov, St. Petersburg Department of V. A. Steklov Institute of Mathematics

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

2017-03-16T13:15:00.000+01:00 2017-03-16T13:15:00.000+01:00 Dmitry Sokolov: Dag-like communication and its applications (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Dmitry Sokolov: Dag-like communication and its applications (Seminar, Theoretical computer science)

Valentin Goranko: Logical modelling, specification, verification and synthesis of multi-agent systems: an introduction

20 Mar

Seminar, Theoretical computer science

Monday 2017-03-20, 13:15

Participating: Valentin Goranko, (Stockholm University)

Location: Room Biblioteket 1440, Lindstedtsvägen 3

2017-03-20T13:15:00.000+01:00 2017-03-20T13:15:00.000+01:00 Valentin Goranko: Logical modelling, specification, verification and synthesis of multi-agent systems: an introduction (Seminar, Theoretical computer science) Room Biblioteket 1440, Lindstedtsvägen 3 (KTH, Stockholm, Sweden)Valentin Goranko: Logical modelling, specification, verification and synthesis of multi-agent systems: an introduction (Seminar, Theoretical computer science)

Igor Carboni Oliveira: Complexity theory beyond deterministic exponential time and applications

27 Mar

Seminar, Theoretical computer science

Monday 2017-03-27, 12:00

Participating: Igor Carboni Oliveira, Charles University

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

2017-03-27T12:00:00.000+02:00 2017-03-27T12:00:00.000+02:00 Igor Carboni Oliveira: Complexity theory beyond deterministic exponential time and applications (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Igor Carboni Oliveira: Complexity theory beyond deterministic exponential time and applications (Seminar, Theoretical computer science)

Meysam Aghighi: Complexity results in automated planning

10 Apr

Seminar, Theoretical computer science

Monday 2017-04-10, 12:00

Participating: Meysam Aghighi, Linköping University

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

2017-04-10T12:00:00.000+02:00 2017-04-10T12:00:00.000+02:00 Meysam Aghighi: Complexity results in automated planning (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Meysam Aghighi: Complexity results in automated planning (Seminar, Theoretical computer science)

Lenore Zuck: Witnessing: From Optimization to Verification to Optimization

21 Apr

Seminar, Theoretical computer science

Friday 2017-04-21, 12:00

Participating: Lenore Zuck, University of Illinois, Chicago

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

2017-04-21T12:00:00.000+02:00 2017-04-21T12:00:00.000+02:00 Lenore Zuck: Witnessing: From Optimization to Verification to Optimization (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Lenore Zuck: Witnessing: From Optimization to Verification to Optimization (Seminar, Theoretical computer science)

Thatchaphol Saranurak: Dynamic (Minimum) Spanning Forest with Worst-case Update Time

24 Apr

Seminar, Theoretical computer science

Monday 2017-04-24, 12:00

Participating: Thatchaphol Saranurak, (TCS group - KTH)

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

2017-04-24T12:00:00.000+02:00 2017-04-24T12:00:00.000+02:00 Thatchaphol Saranurak: Dynamic (Minimum) Spanning Forest with Worst-case Update Time (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Thatchaphol Saranurak: Dynamic (Minimum) Spanning Forest with Worst-case Update Time (Seminar, Theoretical computer science)

Sam Hopkins: A meta-algorithm for Bayesian estimation

2 May

Seminar, Theoretical computer science

Tuesday 2017-05-02, 10:15

Participating: (Sam Hopkins, Cornell University)

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

2017-05-02T10:15:00.000+02:00 2017-05-02T10:15:00.000+02:00 Sam Hopkins: A meta-algorithm for Bayesian estimation (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Sam Hopkins: A meta-algorithm for Bayesian estimation (Seminar, Theoretical computer science)

Amin Coja-Oghlan: Information-theoretic thresholds

8 May

Seminar, Theoretical computer science

Monday 2017-05-08, 12:00

Participating: Amin Coja-Oghlan(Goethe University)

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

2017-05-08T12:00:00.000+02:00 2017-05-08T12:00:00.000+02:00 Amin Coja-Oghlan: Information-theoretic thresholds (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Amin Coja-Oghlan: Information-theoretic thresholds (Seminar, Theoretical computer science)

Mateus de Oliveira Oliveira: Representations of Monotone Boolean Functions by Linear Programs

15 May

Seminar, Theoretical computer science

Monday 2017-05-15, 13:15

Participating: Mateus de Oliveira Oliveira

Location: Room 4523, Lindstedtsvägen 5

2017-05-15T13:15:00.000+02:00 2017-05-15T13:15:00.000+02:00 Mateus de Oliveira Oliveira: Representations of Monotone Boolean Functions by Linear Programs (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5 (KTH, Stockholm, Sweden)Mateus de Oliveira Oliveira: Representations of Monotone Boolean Functions by Linear Programs (Seminar, Theoretical computer science)

Emir Demirović: An Interactive journey through combinatorial optimization: resilient solutions, multiple objectives, and logic-based approaches for timetabling

16 May

Seminar, Theoretical computer science

Tuesday 2017-05-16, 10:15

Participating: Emir Demirović, Technische Universität Wien

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

2017-05-16T10:15:00.000+02:00 2017-05-16T10:15:00.000+02:00 Emir Demirović: An Interactive journey through combinatorial optimization: resilient solutions, multiple objectives, and logic-based approaches for timetabling (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Emir Demirović: An Interactive journey through combinatorial optimization: resilient solutions, multiple objectives, and logic-based approaches for timetabling (Seminar, Theoretical computer science)

Ina Schaefer: Part I: Future-Proof Software and Part II: How to test the universe? - Efficient Testing of Software Product Lines

22 May

Seminar, Theoretical computer science

Monday 2017-05-22, 10:00

Participating: Ina Schaefer, (Technische Universität Braunschweig, Germany)

Location: Room 1537, Lindstedtsvägen 3

2017-05-22T10:00:00.000+02:00 2017-05-22T10:00:00.000+02:00 Ina Schaefer: Part I: Future-Proof Software and Part II: How to test the universe? - Efficient Testing of Software Product Lines (Seminar, Theoretical computer science) Room 1537, Lindstedtsvägen 3 (KTH, Stockholm, Sweden)Ina Schaefer: Part I: Future-Proof Software and Part II: How to test the universe? - Efficient Testing of Software Product Lines (Seminar, Theoretical computer science)

Robert Robere: Unified and optimal lower bounds for monotone computation

29 May

Seminar, Theoretical computer science

Monday 2017-05-29, 12:00

Participating: Robert Robere, University of Toronto

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

2017-05-29T12:00:00.000+02:00 2017-05-29T12:00:00.000+02:00 Robert Robere: Unified and optimal lower bounds for monotone computation (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Robert Robere: Unified and optimal lower bounds for monotone computation (Seminar, Theoretical computer science)

Hubert Chan: Revisiting Diffusion Process for Hypergraph Laplacian

30 May

Seminar, Theoretical computer science

Tuesday 2017-05-30, 13:15

Participating: Hubert Chan, (University of Hong Kong)

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

2017-05-30T13:15:00.000+02:00 2017-05-30T13:15:00.000+02:00 Hubert Chan: Revisiting Diffusion Process for Hypergraph Laplacian (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Hubert Chan: Revisiting Diffusion Process for Hypergraph Laplacian (Seminar, Theoretical computer science)

Romain Wallon: Pseudo-Boolean Constraints: Reasoning and Compilation

11 Sep

Seminar, Theoretical computer science

Monday 2017-09-11, 13:15

Participating: Romain Wallon (Université d'Artois)

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

2017-09-11T13:15:00.000+02:00 2017-09-11T13:15:00.000+02:00 Romain Wallon: Pseudo-Boolean Constraints: Reasoning and Compilation (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Romain Wallon: Pseudo-Boolean Constraints: Reasoning and Compilation (Seminar, Theoretical computer science)

Sagnik Mukhopadhyay: Simulation theorems via pseudo-random properties

25 Sep

Seminar, Theoretical computer science

Monday 2017-09-25, 12:00

Participating: Sagnik Mukhopadhyay, Theory Group, KTH

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

2017-09-25T12:00:00.000+02:00 2017-09-25T12:00:00.000+02:00 Sagnik Mukhopadhyay: Simulation theorems via pseudo-random properties (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Sagnik Mukhopadhyay: Simulation theorems via pseudo-random properties (Seminar, Theoretical computer science)

Tegawendé Bissyandé: Free-form and code-to-code search - Leveraging Q&A Data towards Accurate Matching of Diverse Solutions

26 Sep

Seminar, Theoretical computer science

Tuesday 2017-09-26, 13:00

Participating: Tegawendé Bissyandé, Research Associate @SnT / Univ. Luxembourg

Location: Room 1440 (Biblioteket), Lindstedtsvägen 3

2017-09-26T13:00:00.000+02:00 2017-09-26T13:00:00.000+02:00 Tegawendé Bissyandé: Free-form and code-to-code search - Leveraging Q&A Data towards Accurate Matching of Diverse Solutions (Seminar, Theoretical computer science) Room 1440 (Biblioteket), Lindstedtsvägen 3 (KTH, Stockholm, Sweden)Tegawendé Bissyandé: Free-form and code-to-code search - Leveraging Q&A Data towards Accurate Matching of Diverse Solutions (Seminar, Theoretical computer science)

Elena Troubitsyna: Formal goal-oriented development of adaptable and resilient systems

10 Oct

Seminar, Theoretical computer science

Tuesday 2017-10-10, 13:15

Participating: Elena Troubitsyna, Åbo Akademi, Finland

Location: Room 4618, Lindstedtsvägen 5, KTH CSC

2017-10-10T13:15:00.000+02:00 2017-10-10T13:15:00.000+02:00 Elena Troubitsyna: Formal goal-oriented development of adaptable and resilient systems (Seminar, Theoretical computer science) Room 4618, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Elena Troubitsyna: Formal goal-oriented development of adaptable and resilient systems (Seminar, Theoretical computer science)

Bart Bogaerts: Symmetry exploitation for combinatorial problems

6 Nov

Seminar, Theoretical computer science

Monday 2017-11-06, 12:00

Participating: Bart Bogaerts, Katholieke Universiteit Leuven

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

2017-11-06T12:00:00.000+01:00 2017-11-06T12:00:00.000+01:00 Bart Bogaerts: Symmetry exploitation for combinatorial problems (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Bart Bogaerts: Symmetry exploitation for combinatorial problems (Seminar, Theoretical computer science)

Michele Scquizzato: Distributed computation of large-scale graph problems

13 Nov

Seminar, Theoretical computer science

Monday 2017-11-13, 12:00

Participating: Michele Scquizzato, TCS Group, KTH

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

2017-11-13T12:00:00.000+01:00 2017-11-13T12:00:00.000+01:00 Michele Scquizzato: Distributed computation of large-scale graph problems (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Michele Scquizzato: Distributed computation of large-scale graph problems (Seminar, Theoretical computer science)

Jakob Nordström: Understanding conflict-driven SAT solving through the lens of proof complexity

20 Nov

Seminar, Theoretical computer science

Monday 2017-11-20, 12:00

Participating: Jakob Nordström, TCS Group, KTH

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

2017-11-20T12:00:00.000+01:00 2017-11-20T12:00:00.000+01:00 Jakob Nordström: Understanding conflict-driven SAT solving through the lens of proof complexity (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Jakob Nordström: Understanding conflict-driven SAT solving through the lens of proof complexity (Seminar, Theoretical computer science)

Johannes Klaus Fichte: Parameterized complexity of answer set programming

27 Nov

Seminar, Theoretical computer science

Monday 2017-11-27, 12:00

Participating: Johannes Klaus Fichte, Technische Universität Wien

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

2017-11-27T12:00:00.000+01:00 2017-11-27T12:00:00.000+01:00 Johannes Klaus Fichte: Parameterized complexity of answer set programming (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Johannes Klaus Fichte: Parameterized complexity of answer set programming (Seminar, Theoretical computer science)

Thomas Watson: Query-to-communication lifting for BPP

6 Dec

Seminar, Theoretical computer science

Wednesday 2017-12-06, 12:00

Participating: Thomas Watson, University of Memphis

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

2017-12-06T12:00:00.000+01:00 2017-12-06T12:00:00.000+01:00 Thomas Watson: Query-to-communication lifting for BPP (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Thomas Watson: Query-to-communication lifting for BPP (Seminar, Theoretical computer science)