acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

A possible NP-Intermediary Problem

(REMINDERS: STOC Early Registration closes on April 30. CCC Early Registration closes May 3. EC Early Registration closes on May 6. ) Here is a problem whose...

From Computational Complexity

Google VS Experts VS readers VS Bing

If you want to find something out you can ask Google, ask an expert, or (if you have a blog) ask your readers. Google is the most common; however, there are times...

From Computational Complexity

Is there a pangramic palindrome?

Pangrams are sentences that contain every letter of the alphabet. The classic is The quick brown fox jumped over a lazy dog. There are more here. Palindromes...

From Computational Complexity

Is Guessing a good idea?

The following is from an Ask Marilyn Column. I paraphrase this since its from memory. READER'S LETTER: I have heard of exams where you are penalized for guessing...

From Computational Complexity

Tom L DVD and Birthday and You Tube and...

April 9 was Tom Lehrer's 82nd birthday! To celebrate I give you breaking news that a Tom L DVD was released April 13, 2010. It seems to have some videos of him...

From Computational Complexity

Deriving sum of squares: How much to cheat?

In discrete math (or other courses) we teach AND DERIVE the formula for 1+2+3+...+n. We then look at the sum 12+22+...+n2. Here there are some options. State...

From Computational Complexity

Baseball violates the rules of mathematics!!

(Looking for a roomate for STOC. Check out this site..) Baseball Season started this week. I want to point out that Baseball violates mathematics in two ways...

From Computational Complexity

But seriously now folks- what do you make of barrier results?

In my April Fools Day Post I said the following: Here are problems that I believe can be solved with current techniques. That was indeed true- since they were...

From Computational Complexity

Lets Prove Something instead of proving that we can't prove something

We complexity theorists seem more concerned with proving that we can't prove things than with actually proving things!!!! There have been two workshop on Barriers...

From Computational Complexity

SIGACT Awards

ACM announced the following awards recently. Note that some of the awards are named after theorists and some awards went to theorists. Any comments on theirhere...

From Computational Complexity

Book Review Column AND request for reviews

A while back I posted a list of books that I need reviews for my column in SIGACT NEWS. This was legitimate--- I really did want reviewers--- but it was also an...

From Computational Complexity

Turning down a Fields Medal is eccentric, turning down the Millennium Prize is INSANE!

NEWS on Poincare Conjecture: Recall that Perelman was given the Fields Medal in 2006 for proving the Poincare Conjecture. He declined the award. Recent news...

From Computational Complexity

Stoc Travel Support/WELCOME BACK LANCE!

(REMINDER AND UPDATE: If you are a a grad student you can apply for travel support for STOC 2010. See here for details. One update on that: since registration and...

From Computational Complexity

A prospective Theory Blogger wants your input (Guest Post)

(Guest Post by M.T. Hajiaghayi) Title: Successful blogs Now that I'm joining Univ. of Maryland, and there are at several famous bloggers there, I may consider...

From Computational Complexity

Repost on Turing and Wasserman- lets talk about...

One of the commenters on the post on the recent Turing Award and the Waterman award pointed out that the context I gave lead to a discussion that was NOT aboutCan...

From Computational Complexity

Central Website for FOCS as a whole (guest post)

(Guest Post by Paul Beame) There is now a central website for the FOCS conference as a whole here!! In addition to links to the most recent and upcoming...

From Computational Complexity

Theorems that you simply don't believe

There are some theorems that are surprising. I've already blogged on that (I can't seem to find the link). However, there are some theorems that some people simply...

From Computational Complexity

Turing Award and Waterman Award and the variety of our field

As Lance tweeted: The Turing Award for 2009 was given recently to Chuck Thacker LINK. See here. He developed the first modern PC. The Alan T. Waterman award...

From Computational Complexity

HW policies: PROS and CONS

The last blog entry had lots of good comments about different HW policies. I enumerate them and say PROS and CONS Hard Deadline. PRO- uniform, no favoritism,...

From Computational Complexity

A HW policy- MORAL due date.

This semester I am using the following HW policy. HW is due on Tuesday. However, your dog died! Hence you get an extension to Thursday. That is, for all people...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account