Дорогой коллега пишет: Летом в Математическом институте Стеклова (ПОМИ) пройдут две международные конференции: 15th International Symposium on Experimental Algorithms (SEA 2016, 5–8 июня) и 11th International Computer Science Symposium in Russia (CSR 2016, 9–13 июня). Программы конференций уже доступны на страницах конференций: http://logic.pdmi.ras.ru/sea2016/ и http://logic.pdmi.ras.ru/csr2016/ Будет куча интересных докладов.
Yurii Nesterov (Ecole Polytechnique de Louvain, Belgium) Complexity bounds for primal-dual methods minimizing the model of objective function ‎- Cat-coloured object
Haim Kaplan (Tel Aviv University, Israel) Minimum Cost Flows in Graphs with Unit Capacities ‎- Cat-coloured object
Juliana Freire (New York University, USA) Provenance for Computational Reproducibility and Beyond ‎- Cat-coloured object
Christos H. Papadimitriou (University of California at Berkeley, USA) Algorithm as a scientific Weltanschauung ‎- Cat-coloured object
Vladimir Kolmogorov (Institute of Science and Technology, Austria) Complexity classifications of Valued Constraint Satisfaction Problems ‎- Cat-coloured object
Virginia Vassilevska Williams (Stanford University, USA) Fine-Grained Algorithms and Complexity ‎- Cat-coloured object
Orna Kupferman (Hebrew University, Israel) On High-Quality Synthesis ‎- Cat-coloured object
Herbert Edelsbrunner (Institute of Science and Technology, Austria) Topological Data Analysis with Bremen Divergences ‎- Cat-coloured object
(доклад колмогорова о сложности, прекрасно) ‎- 9000