Wednesday, June 16 |
 |
Welcome and Opening |
 |
Opening Lecture
Alexander Razborov
Complexity of Propositional
Proofs |
 |
Daniel Raible and
Henning Fernau
A Faster Exact Algorithm
for the Directed Maximum Leaf Spanning Tree Problem |
 |
Maurice Jansen and
Jayalal Sarma M.N.
Balancing Bounded
Treewidth Circuits |
 |
Ling-Ju Hung and
Ton Kloks
Classifying Rankwidth
k-DH-Graphs |
 |
Invited Talk
Juraj Hromkovic
Algorithmics –
Is There Hope for a Unified Theory? |
 |
A.N. Trahtman
A Partially Synchronizing
Coloring |
 |
Matthew Johnson,
Viresh Patel, Daniel Paulusma and Théophile Trunck
Obtaining Online
Ecological Colourings by Generalizing First-Fit |
 |
Nick Gravin
Time optimal d-list
colouring of a graph |
Thursday, June 17 |
 |
Invited Talk
Fedor Fomin
Kernelization |
 |
James Gate and Iain
A. Stewart
Frameworks for Logically
Classifying Polynomial-time Optimisation Problems |
 |
Invited Talk
Miklos Santha
Quantization of random
walks: Search algorithms and hitting time |
 |
Dmitry Itsykson
Lower bound on average-case
complexity of inversion of Goldreich's function by drunken backtracking
algorithms |
 |
Janusz Brzozowski,
Galina Jirásková and Chenglong Zou
Quotient Complexity
of Closed Languages |
 |
Pavel V. Martyugin
Complexity of problems
concerning carefully synchronizing words for PFA and directing words
for NFA |
 |
Anahí Gajardo and
Pierre Guillon
Zigzags in Turing
Machines |
Friday, June 18 |
 |
Invited Talk
Uwe Schöning
Comparing Two Stochastic
Local Search Algorithms for Constraint Satisfaction Problems |
 |
Renat A. Gimadeev
and Mikhail N. Vyalyi
Identical relations
in symmetric groups and separating words with reversible automata |
 |
Arseny M. Shur
Growth of power-free
languages over large alphabets |
 |
Victor Y. Pan, Gouliang
Qian and AI-Long Zheng
On the Power of Randomized
Multiplicative Preprocessing |
 |
Invited Talk
Susanne Albers
Algorithms for Energy
Management |
 |
Nicolas Bourgeois,
Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th.
Paschos and Olivier Pottié
The max quasi-independent
set problem |
 |
Gerold Jäger and
Weixiong Zhang
A SAT based effective
algorithm for the directed Hamiltonian cycle problem |
 |
Pawel Gawrychowski,
Artur Jez and Lukasz Jez
Validating the Knuth-Morris-Pratt
failure function, fast and online |
Saturday, June 19 |
 |
Invited Talk
Prabhakar Raghavan
The quantitative
analysis of user behavior online - data, models and algorithms |
 |
Benedikt Bollig and
Loïc Hélouët
Realizability of
Dynamic MSC Languages |
 |
Nazim Benaissa and
Dominique Méry
Proof-based Design
of Security Protocols |
 |
Thomas Brihaye, Véronique
Bruyère and Julie De Pril
Equilibria in quantitative
reachability games |
Sunday, June 20 |
 |
Mikhail V. Berlinkov
Approximating the
minimum length of synchronizing words is hard |
 |
Nikolay Vereshchagin
An Encoding Invariant
Version of Polynomial Time Computable Distributions |
 |
Elena Kalinina
Prefix-free and Prefix-correct
Complexities with Compound Conditions |
 |
Pavel Karpovich
Monotone complexity
of a pair |
 |
Nathalie Aubrun and
Marie-Pierre Béal
Sofic and almost
of finite type tree-shifts |
 |
Invited Talk
Richard Jozsa
Classical Simulation
and Complexity of Quantum Computations |
 |
Olivier Carton
Right sequential
functions on infinite words |
 |
Bernhard Heinemann
The Cantor Space
as a Generic Model of Topologically Presented Knowledge |
Monday, June 21 |
 |
Richard Jozsa
On the power of commuting quantum computations |
 |
Alexander Razborov
Upper Bounds on the Threshold Quantum Decoherence Rate |
 |
Bob Coecke
The Compositional Structure Of Multipartite Quantum Entanglement |
 |
Kamil Valiev,
Yuri Bogdanov
Quantum Computers - The New Paradigm of Information Technology |
 |
Yuri Ozhigov
Enhancement Of Distributed Computations Using EPR-pairs |
 |
Sergei Moiseev, Firdus Gubaidullin, Sergei Andrianov
Quantum Computer Of Wire Circuit Architecture |
 |
Farid Ablayev,
Alexander Vasiliev
On Computational Power Of Quantum Branching Programs |
