Programme

The full programme for CiE2021 will be announced in due course. Below you already find info on the invited speakers and special sessions.

 

Invited speakers

 

Laura Crosilla

University of Oslo, Norway

Cantor’s paradise and the forbidden fruit

 

 

Markus Lohrey

Universität Siegen. Germany

Compression techniques in group theory

 

 

 

 

 

Joël Ouaknine

Max Planck Institute for software systems, Germany
Holonomic Techniques, Periods, and Decision Problems

Christine Tasson

tutorial speaker

Université Paris Diderot, France

Probabilistic Programming and Computation

 

 

 

 

Special sessions

 

Computational geometry

Organizors: Maike Buchin (Ruhr-Universität Bochum, Germany) and Maarten Löffler (Utrecht University, Netherlands)

 

Wolfgang Mulzer Free University Berlin

The many computational models of computational geometry.

Tillmann Miltzow Utrecht University

Recent trends in geometric computation models and its relation to the existential theory of the reals.

Esther Ezra Bar-Ilan University

On 3SUM-hard problems in the Decision Tree Model.

Karl Bringmann Saarland University

Conditional lower bounds for geometric problems.

 

 

Classical Computability theory: Open problems and solutions

Organizors: Noam Greenberg (Victoria University of Wellington, New Zealand) and Steffen Lempp (University of Wisconsin)

Marat Faizrakhmanov, Kazan Federal University
Title: Limitwise Monotonic Spectra and Their Generalizations

Andrea Sorbi University of Siena
Title: Effective inseparability and its applications

Liang Yu Nanjing University
Title: Computability of limit sets for two-dimensional flows

Ning Zhong University of Cincinnati
Title: TBA

 

Proof theory and computation

Organizors: David Fernández Duque (Ghent University, Belgium) and Juan Pablo Aguilera (Ghent University, Belgium)

Lorenzo Carlucci, University of Rome I “La Sapienza”
Title: TBA

Francesca Poggiolesi, CNRS, Université Paris 1 Panthéon-Sorbonne
Title: Defining Formal Explanation in Classical Logic by Substructural Derivability

Yue Yang, National university of Singapore
Title: TBA

Leszek KolodziejczykUniversity of Warsaw
Title.: In search of the first-order part of Ramsey’s theorem for pairs

 

Quantum computation and information

Organizors: Harry Buhrman (Universiteit van Amsterdam, Netherlands) and Frank Verstraete (Ghent University, Belgium)

 

Church’s thesis in constructive mathematics (HaPoC session)

Organizors: Marianna Antonutti-Marfori (Ludwig-Maximilians-Universität München, Germany) and Alberto Naibo (Université Paris 1 Panthéon-Sorbonne)

The HaPoC special session will this year be part of a satellite workshop with the same topic. Other speakers invited to this workshop are: Benno van den Berg, Takako Nemoto, Douglas Bridges and Johanna Franklin.

 

Mate Szabo, University of Oxford

Title: Péter on Church’s Thesis, Constructivity and Computer Science

Liron Cohen,  Ben-Gurion University

Title: Formally Computing with the Non-Computable

Angeliki Koutsoukou-Argyraki, University of Cambridge

Title: On preserving the computational content of mathematical proofs: toy examples for a formalising strategy

David Turner, University of Kent

Title: Constructive mathematics, Church’s Thesis, and free choice sequences.

 

Computational Pangenomics

Organizors: Nadia Pisanti (University of Pisa, Italy) and Solon Pissis (CWI and Vrije Universiteit, Netherlands)

Francesca Ciccarelli, King’s College London, UK.
Title: Gene deregulations driving cancer at single patient resolution

Benedict Paten, University of California Santa Cruz, USA.
Title: Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted

Brona Brejova, Comenius University in Bratislava, Slovakia.
Probabilistic models for k-mer frequencies

Rayan Chikhi, Pasteur Institute, France.

Title: A tale of optimizing the space taken by de Bruijn graphs