Experimental Algorithms and Computer Science: June 5=?UTF-8?Q?=E2=80=9313=2C_?=St. Petersburg, Russia

Scientific programs of Symposium of Experimental Algorithms (SEA 2016)
and Computer Science Symposium in Russia (CSR 2016) are now available
online:

http://logic.pdmi.ras.ru/sea2016/program
http://logic.pdmi.ras.ru/csr2016/program

Note that obtaining a Russian visa takes time and that June is a
tourist season. Hence, to be on the safe side, we recommend you to
register and to book hotel/tickets at you earliest convenience.

Invited talks at SEA and CSR:

* Yurii Nesterov (Ecole Polytechnique de Louvain, Belgium)
Complexity bounds for primal-dual methods minimizing the model of
objective function

Haim Kaplan (Tel Aviv University, Israel)
Minimum Cost Flows in Graphs with Unit Capacities

Juliana Freire (New York University, USA)
Provenance for Computational Reproducibility and Beyond

Christos H. Papadimitriou (University of California at Berkeley, USA)
Algorithm as a scientific Weltanschauung

Vladimir Kolmogorov (Institute of Science and Technology, Austria)
Complexity classifications of Valued Constraint Satisfaction Problems

Virginia Vassilevska Williams (Stanford University, USA)
Fine-Grained Algorithms and Complexity

Orna Kupferman (Hebrew University, Israel)
On High-Quality Synthesis

Herbert Edelsbrunner (Institute of Science and Technology, Austria)
Topological Data Analysis with Bregman Divergences