August 6-17, 2017
Sofia, Bulgaria
http://esslli2018.folli.info
Registration deadline: July 31, 2017
Aggregator for CS theory workshops, schools, and so on
August 6-17, 2017
Sofia, Bulgaria
http://esslli2018.folli.info
Registration deadline: July 31, 2017
August 6-10, 2017
Djuronaset, Stockholm, Sweden
http://s3cs.csc.kth.se
Submission deadline: March 15, 2017
We will celebrate our 5th summmer school anniversary by going significantly out of our comfort zone and learn about quantum computation.
June 19-22, 2018
Harvard University, Cambridge, MA
https://womenintheory.wordpress.com/
Registration deadline: January 16, 2018
This is a workshop for female graduate students and exceptional undergraduates (fourth year) in theoretical computer science. The workshop will have first-rate technical content and will be a great opportunity for students to meet their peers from around the world.
We will supply dorm rooms, breakfast and lunch, and will probably also be able to cover at least part if not all of the travel expenses.
More detailed information including how to apply can be found on the workshop website.
June 18-20, 2018
Paris, France
http://ctw18.lipn.univ-paris13.fr/
Submission deadline: February 2, 2018
Registration deadline: May 2, 2018
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2018 welcomes contributions on theory and applications of discrete algorithms, graphs and combinatorial optimization in the wide sense (4-page “long abstract” submissions invited).
August 20-24, 2018
Bonn, Germany
http://www.hcm.uni-bonn.de/combinatorial-optimization-2018/
Submission deadline: April 30, 2018
In this summer school, leading experts present recent progress on classical combinatorial optimization problems, utilizing a variety of new techniques. Each of the five invited speakers teaches a mini-course spanning three lectures.
January 22-26, 2018
Lyon, France
https://graphlimitslyon.sciencesconf.org
The International research school on Graph Limits is part of the thematic semester “Graphs, groups and Dynamics” held in Lyon between September 2017 and February 2018.
January 22-25, 2018
University of Technology Sydney, city campus
http://conference.iiis.tsinghua.edu.cn/QCSS2018/
Registration deadline: January 15, 2018
The Quantum Computer Science School is a week-long series of lectures and academic activities for senior undergraduates and graduates, held at the University of Technology Sydney, Australia, between 22 to 25 January 2018. The lectures of this school will focus on topics from quantum information, quantum computation, and computer science. This gives a good opportunity for students to catch up with the trend of quantum software and information. This event also features a public lecture by Prof Andrew Yao from Tsinghua University. Senior undergraduate and graduates in science and engineering are very welcome to participate in this school. More detailed information, including how to register, can be found on the event website.
December 1, 2017
New York University
http://www.cs.columbia.edu/theory/f17-tday.html
The New York Area Theory Day is a semiannual event, aimed to bring together people in the New York Metropolitan area who are interested in theoretical computer science. This time it will take place at New York University and feature three long and five short talks on a broad variety of topics.
June 17-22, 2018
Vail, Colorado
https://www.isit2018.org/
Submission deadline: January 9, 2018
The 2018 IEEE International Symposium on Information Theory will be held from June 17 to 22, 2018 in Vail, Colorado in the USA. The conference welcomes submissions that are broadly under the purview of information theory or which use information-theoretic ideas/measures in its arguments.
The technical program committee this year has a large number of members from the theory CS community and welcomes submissions in theoretical computer science and adjacent areas that fall under the broad scope of ISIT.
There is a 5 page limit on submissions, which means they are either short results, or they are outlines of bigger results which would then have a full version posted somewhere. In particular, small cute results are appreciated. So ISIT could be a good forum for such results in TCS, while also advertising the problems, concepts, and techniques to the broader information theory community.
The call for papers and other details are available at https://www.isit2018.org/
The submission deadline for registering papers is Jan 9, 2018 and submitting the papers is Jan 12.
The conference also seeks half-day tutorial proposals, which should provide clear and focused teaching material covering new and emerging topics within the scope of the conference. Proposals for tutorials are due Dec 15. https://www.isit2018.org/authors/call-for-tutorials/
June 4-6, 2018
Amsterdam
http://2018.highlightsofalgorithms.org/
Submission deadline: December 12, 2017
The HALG 2018 conference seeks high-quality nominations for invited talks that will highlight recent advances in algorithmic research. Similarly to previous years, there are two categories of invited talks:
A. survey (60 minutes): a survey of an algorithmic topic that has seen exciting developments in last couple of years.
B. paper (30 minutes): a significant algorithmic result appearing in a paper in 2017 or later.
To nominate, please email halg2018.nominations@gmail.com the following information:
1. Basic details: speaker name + topic (for survey talk) or paper’s title, authors, conference/arxiv + preferable speaker (for paper talk).
2. Brief justification: Focus on the benefits to the audience, e.g., quality of results, importance/relevance of topic, clarity of talk, speaker’s presentation skills. Pay attention to potentially non-obvious information, e.g., the topic might seem out of scope, or the material seems inadequate for one talk.
All nominations will be reviewed by the Program Committee (PC) to select speakers that will be invited to the conference.
Nominations deadline: December 12, 2017 (for full consideration).
Please keep in mind that the conference does not provide financial support for the speakers.