acm-header
Sign In

Communications of the ACM

Blogroll


Refine your search:
dateMore Than a Year Ago
authorLance Fortnow
bg-corner

From Computational Complexity

Changing STOC

At the recently completed STOC and the previous FOCS, much of the discussion revolved around reforming the conferences. You read the discussion and comments onarXiv...

From Computational Complexity

FCRC Complexity

On Wednesday at FCRC, the Complexity, STOC and EC (Economics and Computation) conferences all have sessions, a smorgasbord of talks, but tough decisions on what...

From Computational Complexity

STOC Business Meeting

This week I'm at the Federated Computing Research Conference in Portland, a collection of many mostly ACM conferences. Last night was the STOC business meeting....

From Computational Complexity

A Metric Group Product

A guest post by Dylan McKay, recently graduated from Georgia Tech and soon to be PhD student at Stanford. Here a cute puzzle motivated by a pair of undergrads...

From Computational Complexity

Award Season

László Babai will receive the 2015 Knuth Prize and Daniel Spielman and Shang-Hua Teng will receive the 2015 Gödel Prize. ACM issued a press release for both...

From Computational Complexity

John Nash (1928-2015)

John Nash and his wife Alicia died in a taxi accident, returning from the airport after he received the Abel prize in Norway. The public knew John Nash as the "Beautiful...

From Computational Complexity

Theory Jobs 2015

In the fall we list theory jobs, in the spring we see who got them. Like last year, I created a fully editable Google Spreadsheet to crowd source who is going where...

From Computational Complexity

Fiftieth Anniversary of the Publication of the seminal paper on Computational Complexity

Juris Hartmanis and Richard Stearns in a photo dated May 1963. The main theorem from their paper is on the board later improved by Hennie and Stearns. Photo courtesy...

From Computational Complexity

The Virtuous Cycle

Last week we have a celebration of the new CS graduates at Georgia Tech where each graduating student says what their plans are for next year. Other than the few...

From Computational Complexity

Is Logarithmic Space Closed Under Kleene Star?

A Georgia Tech student asked the title question in an introductory theory course. The instructor asked his TA, the TA asked me and I asked the oracle of all things...

From Computational Complexity

Fifty Years of Moore's Law

Gordon Moore formulated his famous law in a paper dated fifty years and five days ago. We all have seen how Moore's law has changed real-world computing, but how...

From Computational Complexity

PH Infinite Under a Random Oracle

Benjamin Rossman, Rocco Servedio and Li-Yang Tan show new circuit lower bounds that imply, among other things, that the polynomial-time hierarchy is infinite relative...

From Computational Complexity

Baseball is More Than Data

As baseball starts its second week, lets reflect a bit on how data analytics has changed the game. Not just the Moneyball phenomenon of ranking players but also...

From Computational Complexity

FCRC 2015

Every four years the Association for Computing Machinery organizes a Federated Computing Research Conference consisting of several co-located conferences and some...

From Computational Complexity

Intuitive Proofs

As I mentioned a few months ago, I briefly joined an undergraduate research seminar my freshman year at Cornell. In that seminar I was asked if a two-dimensional...

From Computational Complexity

News Aplenty

Both the Turing Award and the Abel Prize were announced this morning. MIT databases researcher Michael Stonebraker wins the ACM Turing Award. He developed INGRES...

From Computational Complexity

Feeling Underappreciated

As academics we live and die by our research. While our proofs are either correct or not, the import of our work has a far more subjective feel. One can see where...

From Computational Complexity

Quotes with which I disagree

Often we hear pithy quotes by famous people but some just don't hold water. "Computer science is no more about computers than astronomy is about telescopes." Usually ...

From Computational Complexity

Leonard Nimoy (1931-2015)

Bill and I rarely write joint blog posts but with the loss of a great cultural icon we both had to have our say. Bill: Leonard Nimoy (Spock) died last weekLance...

From Computational Complexity

Selecting the Correct Oracle

After my post last week on the Complexity accepts, a friend of Shuichi Hirahara send Shuichi an email saying that I was interested in his paper. Shuichi contacted...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account