Events

CIAC 2019 – Preliminary Call for Papers 11th International Conference on Algorithms and Complexity May 27-29, 2019, Rome, Italy http://easyconferences.eu/ciac2019/ ———————————- Aims and Scope ———————————- The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis, and experimentation of

Recent Advances in Algorithms International Computer Science Student School May 22–26, 2018, St. Petersburg, Russia https://compsciclub.ru/en/raa18 This year, the school is devoted to modern trends in obtaining conditional hardness of algorithmic problems. In the school will learn about new developments in complexity theory which allow to derive tight bounds on the time required to solve

The 6th FILOFOCS workshop will be held at Tel-Aviv University on   November 22-23, 2017. This is the 6th edition of this series of workshops and is part of the activities of FILOFOCS (French-Israeli Laboratory on Foundations of Computer Science), a LEA (Laboratoire Européen Associé) of the CNRS and Tel-Aviv University. See http://www.liafa.univ-paris-diderot.fr/~adiro/filofocs//filofocs_lab/filofocs_lab.html for more details on

AmosFest – a workshop in honor of Amos Fiat’s 61st birthday will be held at Tel-Aviv University on November 20-21, 2017. We are planning a feast of scientific talks, food, and wild partying, attended by Amos Fiat and his colleagues, students and friends. This event will be followed by another very interesting event, the 6th French-Israeli workshop

CALL FOR PAPERS First Symposium on Simplicity in Algorithms Co-located with ACM-SIAM Symposium on Discrete Algorithms (SODA’18) January 7-10, 2018 New Orleans, LA, USA Submission deadline: August 24, 2017 Website: https://simplicityalgorithms.wixsite.com/sosa/ ********************************************** Symposium on Simplicity in Algorithms is a new conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance

Research School on Recent Advances in Parameterized Complexity will be held on December 3-7, 2017, at Tel Aviv, Israel. For details, see http://rapctelaviv.weebly.com

EPFL WORKSHOP on ALGORITHMIC CHALLENGES IN DATA SCIENCE You are cordially invited to attend the workshop on algorithmic challenges in data science, to be held on Wednesday through Friday, 14-16 June 2017 at EPFL, Switzerland. Speakers include: Nina Balcan (CMU) Moses Charikar (Stanford) Artur Czumaj (University of Warwick) Vitaly Feldman (IBM research) Amir Globerson (Tel

The PC chairs asked me to advertise that the submission deadline for the 2017 symposium on Algorithmic Game Theory is now the 5th of May.

Recent Advances in Algorithms International Computer Science Student School May 22–26, 2017, St. Petersburg, Russia http://raa-school.org AIM OF THE SCHOOL The school offers the unique opportunity to learn about recent breakthroughs in several domains of algorithms: from classical areas like network flow algorithms and longest paths in graphs to recently emerged areas like streaming algorithms

After a huge success of HALG 2016 (200+ participants and a very strong collection of talks in the great city of Paris), we would like to invite all of you to the 2nd Highlights of Algorithms (HALG 2017) that will take place in Berlin, June 9 – 11, 2017. The Highlights of Algorithms series of conferences is a flagship conference of