Quantum Computer Science School 2018

~ shacharlovett

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.

New York Area Theory Day (Fall 2017)

~ shacharlovett

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.

2018 IEEE International Symposium on Information Theory

~ shacharlovett

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/

3rd Highlights of Algorithms conference

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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.