The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content

SAS Seminar List

for period 9 January to 6 July 2012

Monday 09 January
11:00-11:30
  Spitalfields Day Welcome: The Mathematical Legacy of Alan Turing Sem 1
11:30-12:30 Woodin, H (UC Berkeley, USA)
  The global structure of the Turing degrees and the bi-interpretability conjecture Sem 1
14:00-15:00 Smart, N (University of Bristol, UK)
  Modern cryptography for non-cryptographers Sem 1
15:15-16:15 Barmpalias, G (Chinese Academy of Sciences, China)
  Measures of Relative Complexity Sem 1
16:30-17:30 Dawar, A (University of Cambridge, UK)
  On syntactic and semantic complexity classes Sem 1
Wednesday 11 January
17:00-17:30 Matiyasevich, Y (Russian Academy of Sciences)
  Diophantine Machines Sem 2
17:30-18:00 Mackie, I (Laboratoire d'Informatique de l'Ecole Polytechnique)
  Conservation of Data Sem 2
18:00-18:30 Weiermann, A
  Extended Goodstein sequences Sem 2
Thursday 12 January
16:00-16:30 Morphett, A (Australian Catholic University)
  Promptness, Randomness and Degrees Sem 2
16:30-17:00 Leon, C (Universitat Hamburg)
  From Narratology to Formal Narrative Structures: What is Relevant in a Story? Sem 2
17:00-17:30 Li, A (Chinese Academy of Sciences)
  Homophily Law of Networks: Principles, Methods, and Experiments Sem 2
Tuesday 17 January
16:00-16:30 Schuster, P (University of Leeds)
  A Proof Pattern in Algebra Sem 1
16:30-17:00 Vaananen, J (University of Helsinki and University of Amsterdam)
  The Logic of Dependence and Independence Sem 1
17:00-17:30 Rathjen, M (University of Leeds)
  Slow Consistency Sem 1
Thursday 19 January
16:00-16:30 Atserias, A (Universitat Politecnica de Catalunya)
  Sherali-Adams Relaxations and Graph Indistinguishability Sem 1
16:30-17:00 Passmore, G O (University of Cambridge)
  Decision Methods over Real and Algebraically Closed Fields Sem 1
Tuesday 24 January
16:00-16:30 Miller, R (City University of New York)
  Computability Questions about Fields Sem 1
16:30-17:00 Bridges, D (University of Canterbury)
  Constructive Thoughts on Operator Algebras Sem 1
17:00-17:30 Alama, J (Universidade Nova de Lisboa (UNL))
  Automated and Human Proofs in General Mathematics: An Initial Comparison Sem 1
Thursday 26 January
16:00-16:30 Steel, G (École Normale Supérieure)
  The "Million Message Attack" in 15 Thousand Message Sem 1
16:30-17:00 Sanders, S (Universiteit Gent)
  Reuniting the antipodes: bringing together Nonstandard Analysis and Constructive Analysis Sem 1
Tuesday 31 January
09:40-09:45
  Welcome: Is Cryptographic Theory Practically Relevant? Sem 1
09:45-10:30 Vaudenay, S (EPFL)
  Privacy in Deniable Anonymous Concurrent Authentication with Setup is Impossible: Do we Care? Sem 1
11:00-11:45 Cachin, C (IBM Research, Zurich)
  Storage encryption and key management Sem 1
11:45-12:30 Naccache, D (ENS Paris)
  Mathematical and practical security problems not directly related to cryptography Sem 1
14:00-14:45 Groth, J (UCL)
  Efficient Verification of ElGamal Ciphertext Shuffles Sem 1
14:45-15:30 Shrimpton, T (Portland State)
  A long answer to the simple question, "Is TLS provably secure?" Sem 1
16:00-16:30 Horne, R, French, G (Barclays and UK Cabinet Office/Barclays)
  Scaling Cryptographic Deployments Sem 1
16:30-17:15 Steel, G (ENS Cachan)
  Analysis of Cryptographic Security APIs Sem 1
Wednesday 01 February
09:00-09:45 Krawczyk, H (IBM Research, USA)
  Cryptographic Extraction Sem 1
09:45-10:30 Beric, J, Ward, M (Mastercard International)
  The practical application of cryptography to international card payments Sem 1
11:00-11:45 Kiayias, A (Athens)
  Cryptography with Work-based Corruptions and the Combinatorics of Anonymity Sem 1
11:45-12:30 Bond, M (Cryptomathic)
  HSM Portal – Practical Tools built on Theory Sem 1
14:00-14:45 Preneel, B (KU Leuven)
  Theory and practice for hash functions Sem 1
14:45-15:30 Paar, C (Ruhr University Bochum)
  Lessons Learned from Four Years of Implementation Attacks against Real-World Targets Sem 1
16:00-16:45 Danezis, G (Microsoft)
  Secure metrology: From theory to practice Sem 1
Thursday 02 February
09:00-09:45 Ristenpart, T (Wisconsin, Madison)
  Practice-Driven Cryptographic Theory Sem 1
09:45-10:30 Shacham, H (UCSB)
  Cars and Voting Machines: Embedded Systems in the Field Sem 1
11:00-11:45 Chen, L (Hewlett-Packard Laboratories)
  From Cryptographer's Cryptography to Engineer's Crypto Sem 1
11:45-12:30 Wikström, D (KTH - Royal Institute of Technology)
  Verificatum -- An efficient and provably secure mix-net Sem 1
14:00-14:45 Cremers, C (ETH Zurich)
  Key Exchange: Security Models and Automatic Analysis Sem 1
14:45-15:30 McGrew, D (Cisco)
  Problems in Cryptographic Standards and Implementations Sem 1
Tuesday 07 February
16:00-16:30 Aczel, P
  Homotopy Type Theory and the Structure Identity Principle Sem 1
16:30-17:00 Riis, S (Queen Mary, University of London)
  A logicians approach to Network Coding Sem 1
17:00-17:30 Brooke-Taylor, A (Kobe University)
  The Bousfield lattice from a set-theoretic perspective Sem 1
Thursday 09 February
16:00-16:30 Primiero, G (Universiteit Gent)
  Practical Reasoning with Proofs and Types Sem 1
16:30-17:00 Thapen, N (Academy of Sciences of the Czech Republic)
  Proof complexity and search problems Sem 1
Tuesday 14 February
16:00-16:30 Herbert, I (University of California, Berkeley)
  Lowness for Information Sem 1
16:30-17:00 Montalban, A (University of Chicago)
  Computable Structures of High Scott Rank Sem 1
17:00-17:30 Slaman, T (University of California, Berkeley)
  Number theoretic consequences of Ramsey theoretic principles Sem 1
Thursday 16 February
16:00-16:30 Carl, M (Universität Bonn)
  Real closed fields and models of Peano Arithmetic Sem 1
16:30-17:00 Lempp, S (University of Wisconsin-Madison)
  The AE-theory of the partial ordering of the Sigma^0_2-enumeration degrees Sem 1
17:00-17:30 Koepke, P (Universität Bonn)
  Formal mathematics and natural language Sem 1
Friday 17 February
17:30-18:30 Prager, J (IBM Hawthorne NY, USA)
  IBM Watson from Jeopardy! to Healthcare. Could a quiz-show winning computer advise your doctor? CMS Mtg Rm 5
Saturday 18 February
16:25-17:25 Rojas, R (FU Berlin, Germany)
  Zuse and Turing Sem 1
17:40-18:40 Moran, L (Birkbeck College, London)
  The laws fascination with homosexual acts: Insights from the Wolfenden review archive Sem 1
Sunday 19 February
10:00-11:00 Prager, J (IMB Hawthorne NY, USA)
  What does Watson understand? How recent AI activities relate to Turing's vision Sem 1
11:15-12:15 Barendregt, H (Radboud Universiteit Nijmegen)
  From Mind to Turing to Mind Sem 1
13:45-14:45 Stevens, A (Westfaelische Wilhelms-Universitaet Münster)
  Pattern Formation and Turing Pattern in Developing Cell Systems Sem 1
14:45-15:45 Groth, J (University College London)
  Turing and Modern Cryptography Sem 1
16:00-17:00 Richards, J (University of Buckingham)
  The contribution of Alan Turing to British intelligence Sem 1
Tuesday 21 February
16:00-16:30 Freer, C (Massachusetts Institute of Technology)
  Computability and probabilistic symmetries Sem 1
16:30-17:00 The Organizers, SAS (Newton Institute)
  Big open problems: a discussion session Sem 1
Thursday 23 February
16:00-16:30 Davis, M (New York University)
  Universality and Computation Sem 1
16:30-17:00 Schwichtenberg, H (Ludwig-Maximilians-Universität München)
  Proofs and Computations Sem 1
17:00-17:30 Pauly, A (University of Cambridge)
  The structure of Weihrauch degrees Sem 1
Tuesday 28 February
16:00-16:30 Wainer, S (University of Leeds)
  Predictably terminating computations Sem 1
16:30-17:00 Welch, P (University of Bristol)
  Towards transfinite dynamical systems Sem 1
Thursday 01 March
13:30-15:00 Alama, J (Universidade Nova de Lisboa (UNL))
  Meeting of the Interest Group on Formal Mathematics: Fine-grained mathematical dependencies in the Mizar proof assistant Sem 2
16:00-16:30 Holm, B (University of Cambridge)
  Model-comparison games with algebraic rules Sem 1
16:30-17:00 Downey, R (Victoria University of Wellington)
  Things I have been thinking about recently, and things I would like to do Sem 1
17:00-17:30 Setzer, A (Swansea University)
  Beyond inductive definitions -- induction-recursion, induction-induction, coalgebras Sem 1
Tuesday 06 March
16:00-16:30 Smart, N (University of Bristol)
  Fully Homomorphic Encryption Sem 1
16:30-17:00 de Miguel Casado, G (Universidad de Zaragoza)
  Bridging Formal Methods in Computer Science for Scientific Computing and Cognitive Science Modelling Tasks Sem 1
17:00-17:30 Vardi, M (Rice University)
  Synthesis from Components Sem 1
Thursday 08 March
13:30-15:00 Aczel, P (University of Manchester)
  Literate Proving: Informal Discussion Group DS
16:00-16:30 Ambos-Spies, K (Universität Heidelberg)
  On the strongly bounded Turing degrees of the computably enumerable sets Sem 1
16:30-17:00 Pich, J (Charles University, Prague)
  Hard tautologies Sem 1
Tuesday 13 March
16:00-16:30 Lutz, J (Iowa State University)
  Two visions from Turing: Universality and the power of constraining resources Sem 1
16:30-17:00 Becker-Asano, C (Albert-Ludwigs-Universität Freiburg)
  Computational modeling of emotions Sem 1
17:00-17:30 Kalimullin, I (Kazan State University)
  Limitwise monotonicity spectra and uniformity Sem 1
Wednesday 14 March
13:50-14:40 Garfinkel, A (University of California, Los Angeles)
  Far from Turing? Turing’s Paradigm in Physiology Satellite
14:50-15:40 Painter, K (Heriot-Watt University)
  Integrating experiment and theory to elucidate the chemical basis of hair and feather morphogenesis Satellite
15:50-16:10 Grace, M, Hütt, M-T (Jacobs University Bremen)
  Spiral-wave prediction in a lattice of FitzHugh-Nagumo oscillators Satellite
16:10-16:30 Heaton, L, Jones, N S, Lopez, E (University of Oxford & Imperial College London)
  Transport and development in fungal networks Satellite
16:30-16:50 Gaffney, E, Lee, S S (University of Oxford & RIKEN, Japan)
  The Sensitivity of Turing's Pattern Formation Mechanism Satellite
17:10-18:00 Mimura, M (Meiji University, Kanazawa, Japan)
  Turing's instability versus cross-diffusion-driven instability Satellite
18:10-19:00 Sherratt, J (Heriot-Watt University)
  Patterns of Sources and Sinks in Oscillatory Systems Satellite
Thursday 15 March
09:30-10:20 Epstein, I (Brandeis University)
  Experimental and Modeling Studies of Turing Patterns in Chemical Systems Satellite
10:40-11:00 Holzer, M, Scheel, A (University of Minnesota)
  A slow pushed front in a Lotka-Volterra competition model Satellite
11:00-11:20 Venkataraman, C (University of Warwick)
  Turing patterns on growing surfaces Satellite
11:20-11:40 Fleck, C, Greese, B, Huelskamp, M (ZBSA, University of Freiburg & Botanical Institute, University of Cologne)
  Influence of cell-to-cell variability on spatial pattern formation Satellite
12:00-12:50 Nishiura, Y (Tohoku University)
  Collision dynamics in dissipative systems Satellite
13:30-15:00 Schwichtenberg, H (Ludwig-Maximilians-Universität München)
  Computational content of coinductive proofs (Interest Group in Formal Mathematics) Sem 1
14:00-14:50 Dahlem, M (Technische Universität Berlin)
  Localized travelling pulses in mirgaine Satellite
15:10-15:30 Vaeth, M (Free Univ. of Berlin)
  Spatial Patterns for Reaction-Diffusion Systems with Unilateral Conditions Satellite
15:30-15:50 Pellicer, M (Universitat de Girona)
  A PDE approach for the dynamics of the inflammatory stage in diabetic wound healing Satellite
15:50-16:10 Lee, S, Shibata, T (RIKEN, CDB)
  Self-organisation of Cell Asymmetry : Turing’s inspiration is alive in a single cell Satellite
16:10-16:30 Woolley, T, Baker, R E, Gaffney, E A (University of Oxford)
  Stochastic reaction and diffusion on growing domains: understanding the breakdown of robust pattern formation Satellite
16:50-17:40 Kondo, S (Nagoya University)
  Turing pattern formation without diffusion Satellite
17:50-18:40 Jülicher, F (Max Planck Institute for the Physics of Complex Systems)
  Pattern formation in active fluids Satellite
Friday 16 March
09:30-10:20 Stevens, A (Westfalische Wilhelms-Universitat Munster)
  Turing- and Non-Turing Type Pattern in Interacting Cell Systems Satellite
10:40-11:00 Walsh, J, Angstmann, C, Curmi, P (UNSW)
  Linear Stability Analysis of Turing Patterns on Arbitrary Manifolds Satellite
11:00-11:20 Madzvamuse, A (University of Sussex)
  Pattern formation during growth development: models, numerics and applications Satellite
11:20-11:40 Kucera, M, Jaros, F, Vejchodsky, T (Institute of Mathematics of the Academy of Sciences of the Czech Republik)
  The influence of non-standard boundary conditions on the generation of spatial patterns Satellite
12:00-12:50 Bär, M (Physikalisch-Technische Bundesanstalt)
  Pattern formation in multiscale systems: Homogenization and beyond Satellite
14:00-14:50 Scheel, A (University of Minnesota)
  Wavenumber selection in closed reaction-diffusion systems Satellite
15:10-15:30 Baier, G, Goodfellow, M, Taylor, P (University of Manchester)
  Epileptic Seizure Dynamics as a Selforganised Spatio-temporal Pattern Satellite
15:30-15:50 Khare, S, Singh Baghel, R, Dhar, J (Hindustan College of Sciences & Technolgy)
  Spatial Pattern Formation in Phytoplankton Dynamics in 1-D and 2-D System Satellite
15:50-16:10 Weise, LD (Universiteit Utrecht)
  Spiral wave initiation in the Reaction-Diffusion-Mechanics models Satellite
16:10-16:30 Vasiev, B, Harrison, N, Diez del Corral, R (Liverpool University)
  Chemotaxis and morphogen dynamics in biological tissues Satellite
16:50-17:40 De Kepper, P, Szalai, I, Cuiñas, D (Centre national de la recherche scientifique)
  The design of Turing patterns in solution chemistry Satellite
17:50-18:40 Othmer, H (University of Minnesota)
  The Effect of the Signaling Scheme on the Robustness of Pattern Formation in Development Satellite
Tuesday 20 March
16:00-16:30 Krajicek, J (Charles University, Prague)
  Proof complexity generators Sem 1
16:30-17:00 Arslanov, M (Kazan State University)
  Definable relations in the Turing degree structures Sem 1
Thursday 22 March
13:30-15:00 Paulson, L (University of Cambridge)
  The relative consistency of the axiom of choice mechanized using Isabelle/ZF DS
16:00-16:30 Hamkins, JD (City University of New York)
  Infinite chess: the mate-in-n problem is decidable and the omega-one of chess Sem 1
16:30-17:00 Soare, R (University of Chicago)
  The Art of Classical Computability: Why Turing and Not Church? Sem 1
Monday 26 March
09:30-10:30 Krajicek, J (Charles University, Prague)
  Complexity of computations and proofs and pseudo-finite structures Sem 1
11:00-11:30 Galesi, N (Università degli Studi di Roma La Sapienza)
  Proof Complexity of Paris-Harrington Tautologies Sem 1
11:30-12:30 Kreutzer, S (Technische Universität Berlin)
  Logical Methods in the Complexity Analysis of Graph Algorithms Sem 1
14:00-15:00 Dantchev, S (Durham University)
  Parameterised Proof Complexity Sem 1
15:00-15:30 Beyerdorff, O (Università degli Studi di Roma La Sapienza)
  Parameterized Complexity of DPLL Search Procedures Sem 1
16:00-16:30 Yang, F (University of Helsinki)
  Model Checking for Modal Intuitionistic Dependence Logic Sem 1
16:30-17:30 Kontinen, J (University of Helsinki)
  Complexity results for dependence logic Sem 1
Tuesday 27 March
09:00-10:00 Atserias, A (Universitat Politècnica de Catalunya)
  Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs Sem 1
10:00-10:30 Hamkins, JD (City University of New York)
  The hierarchy of equivalence relations on the natural numbers under computable reducibility Sem 1
11:00-11:30 Adams, R (University of London)
  Ordinal Strength of Logic-Enriched Type Theories Sem 1
11:30-12:30 Kreutzer, S (Technische Universität Berlin)
  Logical Methods in the Complexity Analysis of Graph Algorithms II Sem 1
14:00-15:00 Durand, A (Université Denis Diderot)
  The complexity of enumeration and counting for acyclic conjunctive queries Sem 1
15:00-15:30 Kopczynski, E (Uniwersytet Warszawski)
  Bounded degree and planar spectra Sem 1
16:00-16:30 Kullmann, O (Swansea University)
  SAT Solving: Present and Future Sem 1
16:30-17:00 Vardi, M (Rice University)
  Phase Transitions and Computational Complexity Sem 1
17:30-18:30 Hodges, A (University of Oxford)
  Alan Turing: the creative power of mathematics Sem 1
Wednesday 28 March
09:00-10:00 Santhanam, R (University of Edinburgh)
  Strong Lower Bounds for Constant-Depth Frege Imply Lower Bounds for Frege Sem 1
10:00-10:30 Johannsen, J (Ludwig-Maximilians-Universität München)
  Separations between propositional proof systems related to clause learning Sem 1
11:00-11:30 Eguchi, N (Tohoku University)
  Towards a New Theory of Bounded Arithmetic for PSPACE computations Sem 1
11:30-12:30 Buss, S (University of California, San Diego)
  NP search problems: Complexity and reducibilities Sem 1
14:00-16:00 Cramer, M, Koepke, P, Schroeder, B (Universities of Bonn and Duisburg/Essen)
  Interest Group in Formal Mathematics: Natural Language Proof Checking - The Naproche System DS
Thursday 29 March
09:00-10:00 Chen, Y (Shanghai Jiao Tong University)
  From almost optimal algorithms to logics for complexity classes via listings and a halting problem Sem 1
10:00-10:30 Lauria, M (Academy of Sciences of the Czech Republic)
  Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi) Sem 1
11:00-11:30 Kolodziejczyk, L (Uniwersytet Warszawski)
  Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates Sem 1
11:30-12:30 Buss, S (University of California, San Diego)
  NP search problems: Provability and reducibilities Sem 1
14:00-15:00 Holm, B (University of Cambridge)
  Descriptive complexity of linear algebra Sem 1
15:00-15:30 Pakusa, W (RWTH Aachen University)
  Definability of linear equation systems over groups and rings Sem 1
16:00-16:30 Pich, J
  Proof complexity of circuit lower bounds Sem 1
16:30-17:30 Nguyen, PT (Université de Montréal)
  Developing logical theories for several NP search classes Sem 1
Friday 30 March
09:00-10:00 Thapen, N (Academy of Sciences of the Czech Republic)
  Fragments of approximate counting Sem 1
10:00-10:30 Jerábek, E (Academy of Sciences of the Czech Republic)
  Root finding in TC^0 and open induction Sem 1
11:00-11:30 Lindell, S (Haverford College)
  Infinitary methods in finite model theory Sem 1
11:30-12:30 Schweikardt, N (Goethe-Universität Frankfurt)
  Locality from circuit lower bounds Sem 1
Tuesday 03 April
16:00-16:30 Kolaitis, P (University of California, Santa Cruz)
  The Complexity of Query Answering in Inconsistent Databases Sem 2
16:30-17:00 Abramsky, S (University of Oxford)
  Propositional calculus and the nature of reality Sem 2
17:00-17:30 Pattinson, D (Imperial College London)
  Reasoning in non-wellfounded logics Sem 2
Thursday 05 April
16:00-16:30 Pudlak, P (Academy of Sciences of the Czech Republic)
  Disjoint NP-pairs, automatizability and games Sem 2
Tuesday 10 April
10:00-11:00 Gordon, A (Microsoft Research)
  Verifying Crypto Protocols Written in C Sem 1
11:30-12:30 Vaikuntanathan, V (Toronto)
  Multi-key Homomorphic Encryption and Applications Sem 1
13:30-14:30 Warinschi, B (Bristol)
  Compositionality of game-based secure key-exchange Sem 1
14:30-15:30 Micali, S (MIT)
  Rational Proofs Sem 1
16:00-17:00 Maurer, U (ETH Zürich)
  Constructive cryptography Sem 1
Wednesday 11 April
09:00-10:00 Rogaway, P (UC, Davis)
  Foundations of Garbled Circuits Sem 1
10:00-11:00 Fischlin, M (TU, Darmstadt)
  Meta-Reductions Sem 1
11:30-12:30 Groth, J (UCL)
  Pairing-based succinct non-interactive zero-knowledge arguments Sem 1
13:30-14:30 Blanchet, B (ENS)
  From crypto verif specifications to computationally secure implementations of protocols Sem 1
14:30-15:30 Gentry, C (IBM Research)
  Quadratic Span Programs for Succinct NIZKs without PCPs Sem 1
16:00-17:00 Rothblum, G (Microsoft Research)
  How to Compute in the Presence of Leakage Sem 1
Thursday 12 April
09:00-10:00 Persiano, P (Salerno)
  Definitions of Predicate Encryption Sem 1
10:00-11:00 Kiltz, E (Ruhr-Universität Bochum)
  How provably secure are cryptographic primitives used in practice Sem 1
11:30-12:30 Pointcheval, D (ENS - Paris)
  Efficient Smooth Projective Hash Functions and Applications Sem 1
13:30-14:30 Sahai, A (UCLA)
  Leakage-Resilient Zero-Knowledge Proofs and their Applications Sem 1
14:30-15:30 Tauman Kalai, Y
  Where Delegation Meets Einstein Sem 1
16:00-17:00 Tessaro, S (Massachusetts Institute of Technology)
  Semantic security for the wiretap channel Sem 1
17:00-18:00 Goldwasser, S (MIT)
  Rothschild Lecture: Pseudo Deterministic Algorithms and Applications to Cryptography Sem 1
Friday 13 April
09:00-10:00 Naor, M (Weizmann Institute of Science)
  The Privacy of the Analyst and The Power of the State Sem 1
10:00-11:00 Pietrzak, C (IST Austria)
  How to fake auxiliary input Sem 1
11:30-12:30 Barak, B (Microsoft Research New England)
  Zero Knowledge Proofs and Nuclear Disarmament Sem 1
13:30-14:30 Fournet, C (Microsoft Research)
  Cryptographically verified implementation of TLS 1.2 Sem 1
14:30-15:30 Dodis, Y (New York)
  Overcoming Weak Expectations Sem 1
16:00-17:00 Barthe, G (Madrid Institute of Advanced Studies (IMDEA))
  Computer-aided security proofs Sem 1
Monday 16 April
14:00-16:00 Glaschick, R (Heinz Nixdorf MuseumsForum, Paderborn, Germany)
  Materialization of Universal Turing Machines Sem 2
Tuesday 17 April
16:00-16:30 Murphy, N (Universidad Politécnica de Madrid)
  Uniformity, circuits and non-deterministic Turing machines Sem 2
16:30-17:00 Woods, D (CALTECH (California Institute of Technology))
  The computational complexity of small universal Turing machines Sem 2
17:00-17:30 Neary, T (University of Zurich and ETH Zurich)
  The program-size complexity of universal Turing machines Sem 2
Tuesday 01 May
16:00-16:30 Kolokolova, A (Memorial University of Newfoundland)
  Proof complexity of expander graph techniques Sem 1
16:30-17:00 Paterson, K (University of London)
  Cryptographic theory for practice's sake Sem 1
Thursday 03 May
16:00-16:30 Kabanets, V (Simon Fraser University)
  Yin and Yang of Computer Science: Algorithms versus Lower Bounds Sem 1
16:30-17:00 Natarajan, R (Tata Institute of Fundamental Research)
  Circularity, Paradoxes and Proofs Sem 1
17:00-17:30 Melnikov, A (Nanyang Technological University)
  Hyperarithmetical categoricity and abelian groups Sem 1
Tuesday 08 May
16:00-16:30 Garlik, M (Charles University, Prague)
  Ajtai's Completeness Theorem for Nonstandard Finite Structures Sem 1
16:30-17:00 Downey, R (Victoria University of Wellington)
  Open Problem Session Sem 1
Wednesday 09 May
14:00-15:00 Riis, S (Queen Mary, University of London)
  Valiants Shift problem: A reduction to a problem about graph guessing games Sem 1
Thursday 10 May
16:00-16:30 Setzer, A (Swansea University)
  Consistency, physics, and coinduction Sem 1
16:30-17:00 Aczel, P (University of Manchester)
  Syntax and Semantics - another look, especially for dependent type theories Sem 1
17:00-17:30 Mayordomo, E (Universidad de Zaragoza)
  Effective Fractal Dimension in Computational Complexity and Algorithmic Information Theory Sem 1
Tuesday 15 May
16:00-16:30 Lubarsky, R (Florida Atlantic University)
  Elementary Real Analysis Sem 1
16:30-17:00 Beckmann, A (University of Swansea)
  Consistency statements in Bounded Arithmetic Sem 1
Thursday 17 May
16:00-16:30 Cook, S (University of Toronto)
  A Complexity Class Based on Comparator Circuits Sem 1
16:30-17:00 Tarafder, S (Universiteit van Amsterdam)
  Algebra-valued models of set theory Sem 1
17:00-17:30 Müller, S (Charles University, Prague)
  Polylogarithmic Cuts of Models of Weak Arithmetic Sem 1
Tuesday 22 May
16:00-16:30 Seisenberger, M (University of Swansea)
  On the Computational Content of the Minimal-Bad-Sequence Argument Sem 1
16:30-17:00 Berger, U (University of Swansea)
  Coinduction in Computable Analysis Sem 1
17:00-17:30 Lange, K (Wellesley College)
  Complexity of exponential integer parts on real closed exponential fields Sem 1
Tuesday 29 May
16:00-16:30 Avigad, J (Carnegie Mellon University)
  Uniform distribution and algorithmic randomness Sem 1
16:30-17:00 McKensey, Z (University of Cambridge)
  Automorphisms of models of set theory Sem 1
Thursday 31 May
16:00-16:30 Ramanujam, R (Institute of Mathematical Sciences, Chennai)
  Bounds on proof size in security verification Sem 1
16:30-17:00 Soskova, M (Sofia University St. Kliment Ohridski)
  Definability via Kalimullin Pairs Sem 1
17:00-17:30 Escardo, M
  Searchable sets and ordinals in system T Sem 1
Thursday 07 June
16:00-16:30 Lewis, A (University of Leeds)
  The complexity of computable categoricity Sem 1
16:30-17:00 Soskova, A (Sofia University)
  Conservative extensions and the jump of a structure Sem 1
Monday 02 July
09:30-10:30 Lutz, J (Iowa State University)
  Alan Turing in the twenty-first century: normal numbers, randomness, and finite automata Sem 1
11:00-12:00 Nies, A (University of Auckland)
  Demuth randomness and its variants Sem 1
12:00-12:30 Sanders, S (Universiteit Gent)
  Nonstandard Analysis: a new way to compute Sem 1
14:00-15:00 Shen, A (Université de Montpellier 2)
  Topological arguments in Kolmogorov complexity Sem 1
15:00-15:30 Miyabe, K (Kyoto University)
  Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness Sem 1
17:00-17:30 Petrovic, T (University of Zagreb)
  Two betting strategies that predict all compressible sequences Sem 1
17:30-18:00 Rute, J (Carnegie Mellon University)
  Computable randomness and its properties Sem 1
Tuesday 03 July
09:00-10:00 Simpson, S (Pennsylvania State University)
  Propagation of partial randomness Sem 1
10:00-10:30 Cholak, P (University of Notre Dame)
  Computably enumerable partial orders Sem 1
11:00-12:00 Brattka, V (University of Cape Town)
  On the computational content of the Baire Category Theorem Sem 1
12:00-12:30 Porter, C (University of Notre Dame)
  Trivial measures are not so trivial Sem 1
14:00-15:00 Hoyrup, M (INRIA Paris - Rocquencourt)
  On the inversion of computable functions Sem 1
15:00-15:30 Herbert, I (University of California, Berkeley)
  (Almost) Lowness for K and finite self-information Sem 1
17:00-17:30 Bauwens, B (Universidade do Porto)
  Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs Sem 1
Wednesday 04 July
09:00-10:00 Hitchcock, J M (University of Wyoming)
  Limitations of Efficient Reducibility to the Kolmogorov Random Strings Sem 1
10:00-10:30 Zimand, M (Towson University)
  Language compression for sets in P/poly Sem 1
11:00-12:00 Koucky, M (Academy of Sciences of the Czech Republic)
  The story of superconcentrators – the missing link Sem 1
12:00-12:30 Nguyen, D (University at Buffalo)
  Autoreducibility for NEXP Sem 1
Thursday 05 July
09:00-10:00 Turetsky, D (Victoria University of Wellington)
  SJT-hardness and pseudo-jump inversion Sem 1
10:00-10:30 Teutsch, J (Pennsylvania State University)
  Translating the Cantor set by a random Sem 1
11:00-12:00 Barmpalias, G (Chinese Academy of Sciences)
  Exact pairs for the ideal of the $K$-trivial sequences in the Turing degrees Sem 1
12:00-12:30 Heiber, P A (Universidad de Buenos Aires)
  Normality and Differentiability Sem 1
14:00-14:30 Fouche, W (University of South Africa)
  Kolmogorov complexity and Fourier aspects of Brownian motion Sem 1
14:30-15:00 Franklin, J (University of Connecticut)
  Ergodic theory and strong randomness notions Sem 1
15:00-15:30 Reznikova, Z (Novosibirsk State University)
  Integration of ideas and methods of Kolmogorov Complexity and classical mathematical statistics Sem 1
17:00-17:30 Ryabko, D (INRIA, Lille, France)
  Limit capacity of non-stochastic steganographic systems and Hausdorff dimension Sem 1
Friday 06 July
10:00-10:30 Tadaki, K (Chuo University)
  Cryptography and Algorithmic Randomness Sem 1
11:00-12:00 Lewis, A (University of Leeds)
  The typical Turing degree Sem 1
12:00-12:30 Takahashi, H (University of Electro-Communications, Tokyo)
  Algorithmic randomness and stochastic selection function Sem 1
14:00-15:00 Day, A (University of California, Berkeley)
  Cupping with random sets Sem 1
16:00-17:00 Downey, R (Victoria University of Wellington)
  Resolute sets and initial segment complexity Sem 1
Other Seminars
Seminars in the University
National and International Scientific Research Meetings

Back to top ∧