Two international conferences in St. Petersburg in June: Experimental Algorithms and Computer Science in Russia

In the summer, two international conferences will be held at the Steklov Mathematical Institute (POMI): the 15th International Symposium on Experimental Algorithms (SEA 2016, June 5–8) and the 11th International Computer Science Symposium in Russia (CSR 2016, June 9–13). Conference programs are already available on the conference pages. There will be a lot of interesting reports. Below is a list of invited reports. For local participants a minimum org is set. contribution. If you want to participate, but pay the org. You do not have a fee, write to me - we will think of something.

• 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 Capacity
  
• 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