3rd Highlights of Algorithms conference

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.

Quantum Computation school

March 19-22, 2018
UC San Diego
http://cseweb.ucsd.edu/~slovett/workshops/quantum-computation-2018/

The 3.5-day Spring school will bring TCS researchers up to speed on the current excitement in quantum computing. The past decade had marked tremendous experimental progress, from one or two-qubit devices to dozens of qubits and more. What are the theoretical models for such devices, and what are their prospects? Can they be classically simulated, and if not, can they accomplish algorithmic speed-ups? What are the obstacles to full-blown fault-tolerant quantum computation? And what does all this tell us about complexity theory, cryptography, and quantum information?

TTI-Chicago Summer Workshop Program

June 18 – September 14, 2018
TTI-Chicago, Chicago IL
http://www.ttic.edu/summer-workshop-2018/

Submission deadline: December 15, 2017

Would you like to get a group of 4-40 people together for a week to discuss a topic of common interest? Would you like to do it in an easy-to-reach vibrant city with a substantial local research community and with lodging, coffee breaks, and meeting room paid for by someone else? Is your topic of interest roughly within the areas of Theory, Machine Learning, Vision, NLP, Speech, Robotics, or Computational Biology? Then submit a proposal to the TTI-Chicago Summer Workshop Program! Workshops will run Monday-Friday (you can also propose a shorter workshop), and be held at TTI-Chicago. Dormitory-style lodging will be provided for free for up to 25 attendees. We will also supply continental breakfast and coffee breaks. Workshop structure is pretty much entirely up to you – talks, tutorials, brainstorming sessions, etc. – whatever works best for your topic. Workshop proposals (just 1-2 pages) are due December 15, 2017. More information at http://www.ttic.edu/summer-workshop-2018/

Hardness Escalation in Communication Complexity and Query Complexity

October 14, 2017
FOCS 2017, Berkeley
https://raghumeka.github.io/workshop.html

The topic of this workshop is ‘hardness escalation’, a growing research area whereby lower bounds and separations in communication complexity are obtained by developing “simulation theorems”. The basic idea of a simulation theorem is to start with a simple ‘one-party’ function and “lift it” to a multi-party setting via function composition. These simulation theorems have introduced new tools into complexity theory, and have led to the resolution of many longstanding open problems including in graph theory, combinatorial optimization, circuit complexity and cryptography, proof complexity, game theory, and communication complexity. Moreover the field has led to a revival of query complexity, with new techniques leading to the resolution of some longstanding open problems. The goal of the workshop is to present a broad introduction to the area as well as highlight the recent developments.

Winter School in Software Engineering

December 11-16, 2017
Pune, India
https://isoft.acm.org/winterschool17/

Submission deadline: October 15, 2017

Winter School in Software Engineering (WSSE) aims to encourage students to delve into Software Engineering Research by providing them with a forum to get a first hand experience of the field. Renowned speakers from regional and international research communities will discuss on a range of topics in software engineering that uncover state-of-the-art research, on-going explorations and open problems in the field, together with providing hands-on experience for the participants. Also, experts from the industry will provide their perspective on software engineering in practice as well as give prototype tool demonstrations. WSSE will present an excellent forum to network with top academicians, industry researchers and fellow students, discuss advances in the area and learn from a rich lineup of talks.

XIII Summer School in Discrete Mathematics

January 8-12, 2018
Valparaiso, Chile
http://eventos.cmm.uchile.cl/discretas2018/

Submission deadline: October 27, 2017

The school is aimed to students in mathematics, sciences and engineering interested in algorithms, computer science, combinatorics, optimization, games, and their applications. The courses are oriented towards graduate and advance undergraduate students.