acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

The Molly Solution

This week Bill and I are both at the Dagstuhl Workshop on Algebraic Methods in Computation Complexity. I'll try to cover some of the talks and discussions on the...

From Computational Complexity

Complexity Vidcast 2

Bill and I battle it out over what should be taught in a complexity course in our new vidcast.  

PCing
From My Biased Coin

PCing

This week I got my batches of papers to review for NSDI and LATIN. If I'm quiet for a while, I'm busy reading (and writing reviews). Needless to say, I didn't...

From Computational Complexity

Publicity for P versus NP

On the New York Times website, John Markoff writes an article Prizes Aside, the P-NP Puzzler has Consequences motivated by my CACM article on The Status of the....

More Harvard Classes Available Online
From My Biased Coin

More Harvard Classes Available Online

Thanks to the Harvard Extension School, the lectures for several more Harvard courses have been put online. My understanding is that these are classes taught at...

From Computational Complexity

You are coordially invited... Why?

When you get an invitation via email should you accept? How well targeted is it? Some real examples that I got.   EXAMPLE ONE: I would like to invite you toclick...

From Computational Complexity

Two Recent Complexity Books omit Mahaney's theorem- ovesight or wisdom?

In a prior post (a while back) I pondered if Mahaney's theorem (SAT \le_m S, S Spare, implies P=NP) should be taught in a basic grad course in complexity. I thought...

Job Competitions
From My Biased Coin

Job Competitions

Stefan Savage made an insightful comment related to the issue of jobs: I've long felt that its a fallacy that there exists a fine-grained Platonic ideal of "goodness"...

"Core" TCS
From My Biased Coin

"Core" TCS

Enough time has perhaps passed from Mihai's controversial post to consider, constructively I hope, some of the comments that arose here on this blog from it.One...

From Computational Complexity

On Being Narrow

In a tweet a few days ago, David Bacon wonders why everyone always assumes all he can do is quantum computing? Oh, because that's all he's done. Time to do something...

Semantic Communication, Madhu Sudan
From My Biased Coin

Semantic Communication, Madhu Sudan

Madhu Sudan gave a colloquium at Harvard yesterday on his work on Universal Semantic Communication and Goal-Oriented Communication (both with Brendan Juba, thehere...

From Computational Complexity

The Journal Manifesto 2.0

Reminder: FOCS early registration deadline today. Go here Below is a revised version of the Journal Manifesto. I restate the key sentence from my last post and...

GPU News
From My Biased Coin

GPU News

Since I've now co-authored a paper on GPUs, I'm now "in-the-loop" (thanks to my co-author John Owens) on the news of NVIDIA's announcement of its "next generation"...

Justice!
From My Biased Coin

Justice!

Harvard is putting the lectures (and other materials) online for a fantastic course, Justice, taught by Michael Sandel. It's a class on moral reasoning, exactly...

From Computational Complexity

The Journal Manifesto

Some people say that for-profit journals do not currently serve our community well. Some even think they cannot do so. Others think they are doing a fine job as...

From Computational Complexity

The IT Rules

My family has discovered a British Series, the IT Crowd, about two techies in a corporate IT department. An American version never got past the pilot phase.   ...

Blog Posts of the Day
From My Biased Coin

Blog Posts of the Day

A blog post worth reading is Mihai Patrascu's post on, essentially, coming in second, if only for the chance to play armchair psychologist and try to deconstruct...

From Computational Complexity

Debunking Proofs

One of the comments of the last post asked my (or someones) opinion on the proofs floating around that P=NP or P\ne NP. As a grad student I used to readWhat...

UC President Interview
From My Biased Coin

UC President Interview

Luca Trevisan points to this NY Times Magazine interview with UC president Mark Yudof. Is it just me, or is this guy just completely tone deaf to the current situation...

From Computational Complexity

Inspiring a Love of Math

A reader writes I come to you by way of your computational complexity blog. I get that there is some really good stuff there, but frankly don’t understand about...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account