ALGO 2015
14 -18 September, Patras, Greece

Welcome to ALGO 2015

ALGO is an annual congress combining the premier algorithmic conference European Symposium on Algorithms (ESA) and a number of other specialized conferences and workshops, all related to algorithms and their applications, making ALGO the major European event for researchers, students and practitioners in algorithms.

ALGO 2015 (the 15th in the ALGO series) took place from 14th till 18th September 2015 in Patras, Greece. The congress was hosted by the University of Patras and its Department of Computer Engineering and Informatics, and was organized in cooperation with the European Association for Theoretical Computer Science (EATCS).

Participating Conferences

ALGO 2015 Plenary and Special Event Keynote Speakers

http://www.zib.de/borndoerfer/ Ralf Borndoerfer
Zuse-Institute Berlin, DE
Hypergraphs in Traffic Optimization
http://www.cs.uni-paderborn.de/index.php?id=13034 Burkhard Monien
University of Paderborn, DE
The Complexity of Equilibria for Risk-Modeling Valuations
http://www.cs.bgu.ac.il/~dolev Shlomi Dolev
Ben-Gurion University, IL
Communication-less Secure-Multiparty-Computation
https://www.itu.dk/~pagh Rasmus Pagh
IT University of Copenhagen, DK
Correlated Locality-Sensitive Hashing
http://people.mpi-inf.mpg.de/~tkesselh/ Thomas Kesselheim
Max Planck Institute for Informatics, DE
Online Packing Beyond the Worst Case
http://ru1.cti.gr/Paul_Spirakis Paul Spirakis
Univ. of Liverpool, UK; CTI & Univ. of Patras, GR
On the Discrete Dynamics of Probabilistic (Finite) Population Protocols
http://www.math.uwaterloo.ca/~jochen Jochen Koenemann
University of Waterloo, CA
Recent News for an Old Steiner Tree Formulation
http://www.thilikos.info/ Dimitrios Thilikos
University of Athens, GR & CNRS, LIRMM, FR
Bidimensionality and Parameterized Algorithms
http://people.mpi-inf.mpg.de/~mehlhorn Kurt Mehlhorn
Max Planck Institute for Informatics, DE
Computing Equilibrium Prices in Linear Arrow-Debreu Markets
http://theory.stanford.edu/~virgi/ Virginia Vassilevska Williams
Stanford University, USA
The Strong Exponential Time Hypothesis and Hardness for Easy Problems

Other

HTML Hit Counter
HTML Hit Counter