November 22-23, 2017
Tel-Aviv University, Israel
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 the previous workshops and other activities of FILOFOCS.
October 29 – November 2, 2017
Sde Boker, Israel
Registration deadline: September 29, 2017
The school is a 5 day event. The school will try to cover different aspects of the emerging field of high dimensional expanders. The School will be composed of several lecture series that will be delivered by young and exciting scientists that work on these topics.
January 15-19, 2018
Registration deadline: October 31, 2017
January 8-10, 2018
Donald Knuth’s 80th birthday on January 10, 2018 will be celebrated by two connected events, both in Piteå, Sweden.
January 8-10 (Monday-Wednesday morning): The scientific symposium ”Knuth80: Algorithms, Combinatorics, and Information” in honor of Don’s career-long efforts that have inspired us all. Don’s interests and accomplishments are very broad, and the symposium will therefore include contributions from distinguished scientists in several areas where Don’s influence has been important.
January 10, afternoon (Wednesday): The world premiere of Fantasia Apocalytica, a multimedia work for pipe organ and video that Don has written. It will be performed by the Canadian organist Jan Overduin on the magnificent new pipe organ in Studio Acusticum in Piteå.
January 7-10, 2018
Submission deadline: August 24, 2017
The Symposium on Simplicity in Algorithms is a new conference in theoretical computer science dedicated to advancing simplicity and elegance in the design and analysis of algorithms. The 1st SOSA will be co-located with SODA 2018 in New Orleans. Ideal submissions will present simpler algorithms for important algorithmic problems, or present simpler analyses of known algorithms, or offer insights that simplify our understanding of important computational problems.