Defense of dissertations

Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness

9 Oct

Public defences of doctoral theses

Computer Science

Friday 2015-10-09, 14:00

Participating: Sangxia Huang

Location: F3 Lindstedtsvägen 26, Stockholm

Doctoral student: Sangxia Huang , TCS

2015-10-09T14:00:00.005+02:00 2015-10-09T14:00:00.005+02:00 Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness (Public defences of doctoral theses) F3 Lindstedtsvägen 26, Stockholm (KTH, Stockholm, Sweden)Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness (Public defences of doctoral theses)

An Empirical Study of the Global Behavior of Structured Overlay Networks as Complex Systems

20 Oct

Public defences of doctoral theses

Tuesday 2015-10-20, 13:00

Location: Sal C, Elektrum, KTH-ICT, Kista

2015-10-20T13:00:00.190+02:00 2015-10-20T13:00:00.190+02:00 An Empirical Study of the Global Behavior of Structured Overlay Networks as Complex Systems (Public defences of doctoral theses) Sal C, Elektrum, KTH-ICT, Kista (KTH, Stockholm, Sweden)An Empirical Study of the Global Behavior of Structured Overlay Networks as Complex Systems (Public defences of doctoral theses)