After five fun and stimulating years in the wonderful Microsoft Research New England, I have decided to move on. I will be joining Harvard University as a professor of Computer Science in spring 2016. Moreover, I am thrilled to say that Madhu Sudan will also be joining Harvard. Harvard's Computer Science is on a growth streak and so … Continue reading Joining the new Harvard
Author: Boaz Barak
STOC Festival Design: Improving interaction and fun factor; reducing information overload – guest post by Sanjeev Arora
[Yet another personal post in our series] STOC Festival Design: Improving interaction and fun factor; reducing information overload. Sanjeev Arora How can we increase the value added by a conference in today’s information-rich world, when papers have been available on arxiv for months to the experts in that area? These are some personal thoughts (ie … Continue reading STOC Festival Design: Improving interaction and fun factor; reducing information overload – guest post by Sanjeev Arora
Why Doesn’t ACM Have a SIG for Theoretical Computer Science? – Guest post by Moshe Vardi
[Boaz's note - this is another in the series of personal posts on STOC/FOCS reform, this time from Moshe Vardi, a renowned theoretical computer scientist who is also the editor in chief of the communications of the ACM. See also the discussion that's still going on in the comment section of Omer Reingold's post, as well … Continue reading Why Doesn’t ACM Have a SIG for Theoretical Computer Science? – Guest post by Moshe Vardi
Imagining a theory festival – a personal post
This is a personal post, not representing the other members of our working group. While future discussion will naturally talk about (important) technical details such as amount of parallelism, scheduling of talks, number of days and length of breaks, I wanted to talk a bit about the broader vision. I hope other members will also … Continue reading Imagining a theory festival – a personal post
Turning STOC 2017 into a “Theory Festival”
This blog post seeks to solicit input from the theoretical CS community on possible changes to STOC starting 2017. This planning was set in motion as a result of a long discussion session at FOCS 2014 (see these two earlier posts) when strong support was expressed for a longer “theory festival” that would include STOC but … Continue reading Turning STOC 2017 into a “Theory Festival”
DIMACS looking for an associate director
The DIMACS Center at Rutgers University (dimacs.rutgers.edu) is seeking an Associate Director. DIMACS facilitates research, education, and outreach in discrete mathematics, computer science theory, algorithms, mathematical and statistical methods, and their applications. The Associate Director is expected to play a leadership role in planning, developing, and running DIMACS activities and programs, including setting new directions. A PhD in computer science, … Continue reading DIMACS looking for an associate director
2015 Swedish Summer School in Computer Science – apply soon
Last summer I gave a mini-course on the Sum of Squares algorithm in the Swedish Summer School of Computer Science. It was a great experience - the venue was Djurönäset - a hotel in the beautiful Stockholm archipelgo with stunning views and great food. It was organized very smoothly by Jakob Nordström, Per Austrin, and Johan Håstad, … Continue reading 2015 Swedish Summer School in Computer Science – apply soon
NSF mandates (sort of) open access
See here. NSF-sponsored papers should be freely available no more than 12 months after publication in a journal. This is not perfect, but a step in the right direction. Computer scientists should insist that conference proceedings are treated the same way, and made freely available no more than 12 months after publication. Hat tip: Lance Fortnow.
Tips for future FOCS/STOC program chairs
There are only two FOCS/STOC chairs per year, and most would do just fine without my unsolicited advice. Nevertheless, I thought it might make sense to write down some of my thoughts after chairing FOCS 2014, and perhaps even some people that are not program chairs will find it of interest. This is based on … Continue reading Tips for future FOCS/STOC program chairs
Erdős’s Book and the Asymptotic Religion
In an undergraduate algorithms class we learn that an algorithm is a high level way to describe a computer program. The running time of the algorithm is the number of operations it takes on inputs of a particular size- the smaller the better. So, as even Barack Obama knows, if you implement Quick-Sort, with its … Continue reading Erdős’s Book and the Asymptotic Religion