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
Theory Jobs 2011
The computer science job market never comes to a complete close. CI Fellows are still being decided, Oxford is just starting its search for an algorithms professor...
From Computational Complexity
New Complexity Vidcasts
The newly renamed Computational Complexity Channel features two new vidcasts Bill and I hosted last Thursday from San Jose. Bill's Enigma Interview with...
From Computational Complexity
Talks I Missed
The Complexity conference comes to a close today and I head back to Chicago. I tend to go to few talks, preferring hallway conversations, but occasionally I hear...
From Computational Complexity
An Update on Impagliazzo's Worlds
Russell Impagliazzo gave a talk at Complexity about his five worlds. We didn't know whether Heuristica and Algorithmica were different, i.e., whether if NP is easy...
From Computational Complexity
The Longest Day
Tuesday at FCRC. 7 AM: A grad student at Northwestern administers my final exam at 9 AM Chicago time. He has my mobile number just in case but luckily I neverpaper...
From Computational Complexity
A Valiant Weekend
In my role as SIGACT chair, I got to attend the ACM Awards Banquet held at the beginning of FCRC in San Jose. I shared a table with Mitzenmacher who posted on the...
From Computational Complexity
Partioning Students
One last Molly post for the end of the school year. Tomorrow is her birthday and I enter that moment I have been dreading for the past thirteen years: Two teenage...
From Computational Complexity
75 Years of Computer Science
As Lipton and Felten note, today is the 75th anniversary of Turing's On Computable Numbers, With an Application to The Entscheidungsproblem, the seminal paper of...
From Computational Complexity
Cell Phones versus Drunk Driving
Most of you are familiar with the research that using a cell phone is just as dangerous as driving drunk. Method: We used a high-?delity driving simulator toResults...
From Computational Complexity
Is Computer Science Cool Again?
Back in 2005 I worried about loss of excitement about computer science among America's youth. Today computers have become almost as commonplace as televisionsFCRC...
From Computational Complexity
FCRC Early Registration May 16
One final reminder for the FCRC Conference. Early registration deadline is this Monday, May 16. There are a number of events at FCRC of interest to our readers...
From Computational Complexity
Those Happy Samoans
Below is a post I wrote in 2009 but for some reason never made it to this blog. But I had better post it now because, as I found out via Tony Wirth, Samoa is moving...
From Computational Complexity
Forty Years of P v NP
In the afternoon of May 4, 1971, in the Stouffer's Somerset Inn in Shaker Heights, Ohio, Steve Cook presented his STOC paper proving that Satisfiability is NP...
From Computational Complexity
Don't Blame the Tech
Short Announcements: STOC Poster Submission Deadline is Monday. Jaime Morgenstern set up a google groups page for students to find roommates for STOC, FCRC andTechnology...
From Computational Complexity
Ravi Kannan wins the Knuth Prize
Ravi Kannan will receive the 2011 Knuth Prize for his algorithmic work, including approximating volumes of high-dimensional convex objects, computing the Frobenius...
From Computational Complexity
Choosing an Undergrad School
It is the time of year in the US that high school students have found out what schools have accepted them and now have to decide where to spend the next four years...
From Computational Complexity
Do You Know the Way to San Jose?
Lots of CS Goodness going on at FCRC June 4-11. New for 2011 the STOC Poster Session: Share your exciting research on theory's greatest stage! Submission deadline...
From Computational Complexity
Kanellakis and Grace Murray Hopper Prizes
The ACM announced several award winners today. Two of particular interest to the theory community. Craig Gentry, recipient of the Grace Murray Hopper Award for...
From Computational Complexity