acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

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

GCT Workshop (Guest Post by Josh Grochow)

Last week, the Center for Computational Intractability hosted a Geometric Complexity Theory Workshop. Geometric complexity theory (GCT) is an approach to P vs...

From Computational Complexity

Drowning in Data

At a CCC Council meeting last week, a common theme emerged. The Army is "swimming with sensors and drowning in data". Biologists are considering trashing some of...

From Computational Complexity

Theory Happenings

FOCS accepts, abstracts and PDFs. The conference itself will be held October 23-26 in Las Vegas. There is a proposed TCS version of Math Overflow, a Q&A site to...

From Computational Complexity

Broader Impacts

Nicole Immorlica reports on the NSF CISE Broader Impacts Summit held last week in DC. We've all seen it. Most of us have even written one. I'm talking about that...

From Computational Complexity

The Future of STOC

I set up a new blog, Future of STOC to discuss role of our main conference and how to achieve it. At STOC this year we had a relatively large attendance of 350...

From Computational Complexity

L

L

From Computational Complexity

News from Cambridge

Now that teaching has ended I plan to focus again on my P v NP book. I won't go on a full blog sabbatical, instead I'll aim to post once a week as well as keeptweets...

From Computational Complexity

Sims Complexity

I called home last night and my daughter Molly had an exciting story to tell. She was at her friend Danielle's house (the same Molly and Danielle from the video...

From Computational Complexity

STOC and EC and Complexity, Oh My

Tomorrow I'm off to Cambridge, MA for the 42nd Symposium on the Theory of Computing (STOC), the 25th Conference on Computational Complexity (CCC) and the 11th Conference...

From Computational Complexity

Conference Acceptance Rates

In the latest CACM, Jilin Chen and Joseph Konstan analyze data from the ACM DL and conclude that low-acceptance rate conference have papers with higher impact (more...

From Computational Complexity

Advice for an Engineer

A reader from Mexico asks I am a near-to-be graduate student from Computational Engineering. However, it wasn't what I expected from my career. I want to be a mathematician...

From Computational Complexity

Avner Magen (1968-2010)

Toronto Professor Avner Magen died in a climbing accident on Saturday. He's had a number of important results on a variety of algorithmic topics.Avner was one of...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account