Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
From Computational Complexity
Partha Niyogi (1967-2010)
University of Chicago Computer Science and Statistics Professor Partha Niyogi passed away on Friday after a battle with brain cancer. Partha worked in machine...
From Computational Complexity
The Annual Fall Jobs Post
The CRA is working on setting guidelines for job deadlines to help out with some of the gridlock in the job market. Many of the top departments have already moved...
From Computational Complexity
NRC Rankings
The NRC "rankings" of Graduate programs was released yesterday. I put up a Google spreadsheet of the CS rankings. Phds.org will also generate rankings using various...
From Computational Complexity
The Theory Social Network
Derrick Stolee tweeted that the videos from the 2010 Complexity Conference are now on-line. If you want to attend a conference live, don't forget early hotel and...
From Computational Complexity
The World in Its Own Terms
The New York Times Magazine last Sunday focused on technology on education. Lots of good reads but what caught my eye was an article by Microsoft Research's Jaron...
From Computational Complexity
How Can You Spend $150 Million?
Suppose you happen to have $150 million burning in your pocket that you want to use to help the theoretical computer science community ($150 million endowed will...
From Computational Complexity
FOCS Travel Support (Guest Post by Paul Beame)
The program for the FOCS 2010 has an excellent set of selected papers and in addition has tutorials on Saturday by Ketan Mulmuley, Mihai Patrascu, and Tim Roughgarden...
From Computational Complexity
How to Write Up Major Results
First some conference news: FOCS conference and hotel registration available on line, early deadline is September 30. STOC 2011 website is up with the CFP, deadline...
From Computational Complexity
CS Happenings
Yesterday I was at a meeting of the CCC Council, add in a couple of emails and I have lots of short notes on CS stuff. In these meetings I get to hear about CS...
From Computational Complexity
New Institute for Theory of Computing
The Simons Foundation has announced a competition to establish a new Institute for the Theory of Computing in the United States. Computation (and its abstractTTI...
From Computational Complexity
Theory Journals
I got the following request from a reader. I have a question about TCS journals. As I am trying to follow your advice on being more diligent about journalizing...
From Computational Complexity
Cryptography if P = NP
Bill is at Barriers II in Princeton and promises a full report upon his return. Ask many computer scientists what happens if P = NP and you'll get the response...
From Computational Complexity
Comments
Bill and I are strong believers in freedom of speech and have long since had an open comment policy, allowing anonymous comments, no moderation (except old posts...
From Computational Complexity
NSF Updates
Many changes at the National Science Foundation both in programs and personnel. Some highlights of upcoming CISE programs. Expeditions is moving to an 18-month...
From Computational Complexity
Spielman Receives the Nevanlinna Prize
Dan Spielman wins the Nevanlinna prize for "smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical...
From Computational Complexity
But This One Is Different...
This summer I took a two part vacation: Touring Ireland July 26-August 5, with my wife to celebrate twenty years of marriage and a short trip to Santa Fe, Augut...
From Computational Complexity
CRA Snowbird Part II
Considerable discussion about funding at CRA Snowbird. Ken Gabriel, Deputy Director of DARPA, talked about how DARPA is restructuring its programs to become more...
From Computational Complexity
CRA Snowbird Part I
I just returned home from my first trip to the CRA Snowbird Conference, the biennial meeting of CS chairs and other leaders in the CS community. I really enjoyed...
From Computational Complexity
How I Find Homework Problems
What do you get out of this paragraph (from Charlie Stross' The Atrocity Archives via Daniel Lemire) The [Turing] theorem is a hack on discrete number theory that...
From Computational Complexity