Events

Call for Papers: 23rd RANDOM & 22nd APPROX 2019 September 20-22, 2019 MIT, Cambridge MA http://randomconference.wordpress.com http://approxconference.wordpress.com Paper submission deadline: May 3, 2019 SCOPE The 23rd International Workshop on Randomization and Computation (RANDOM 2019) and the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2019) will be held on Sep 20-22, 2019

1st International Workshop on Smart Circular Economy https://sites.google.com/view/smace2019/home Santorini Island, Greece – May 30, 2019 Accepted and presented papers will appear in IEEE Xplore. ——————————————————————————————————————- Important Dates ========== Paper Submission Deadline: (EXTENDED) March 11, 2019 AoE Acceptance Notification: April 1, 2019 AoE Camera Ready Submission Deadline: April 15, 2019 AoE Early Registration Deadline: April 10,

CIAC 2019 – Second Call for Papers 11th International Conference on Algorithms and Complexity May 27-29, 2019, Rome, Italy http://easyconferences.eu/ciac2019/ The submission server is now open. ———————————- 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

14th International Computer Science Symposium in Russia (CSR 2019) will be held on July 1-5, 2019, in Novosibirsk, Russia. The submission deadline is December 23, 2018. All details can be found on the website: https://logic.pdmi.ras.ru/csr2019/

The 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018) will take place in Paris, France, on 7-9 October 2018, with workshops and tutorials on October 6. The program is now available, together with the list of the workshops/tutorials (as well as a list of a number of co-located events), on the conference

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