acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

Microsoft saves the Yahoo NY Researchers

I started working with David Pennock on prediction markets back when we both were at the NEC Research Institute in New Jersey a decade ago. After a major reorganization...

From Computational Complexity

Berkeley Wins the Simons

As reported today in the New York Times, the Simons Foundation has chosen U. C. Berkeley to host the new Simons Institute for the Theory of Computing, a $6,000,000...

From Computational Complexity

Is Moore's Law Good for CS?

Roy Friedman writes a blog post on The Expected End of Moore

From Computational Complexity

CS in the Sunshine State

As many of you've heard the Dean of Engineering at the University of Florida is planning deep cuts to the Computer and Information Science and Engineering Department...

From Computational Complexity

Some Announcements

STOC early registration deadline is Thursday. This year STOC will have both tutorials and workshops and its second poster session. Hope to see you all there. The...

From Computational Complexity

ACM/IEEE Curriculum 2013

[STOC 2012 Early Registration Deadline Thursday] On a roughly ten-year cycle, the ACM and IEEE Computer Society get together to create a list of core topics that...

From Computational Complexity

Unique Golf Winners

In the Masters Golf Tournament held last weekend there were 55 players who had a final score between 10 under par and 9 above. By the pigeonhole principle one would...

From Computational Complexity

We Think Like Our Fields

Have lunch with economists and they'll talk about the decision making processes and equilibriums of everything from politics to sports. Computer scientists worry...

From Computational Complexity

The Value of an Academic Publication

Russell O'Connor's paper was accepted into last years ACM SIGPLAN Workshop on Generic Programming. Russell put the final version of his paper on the ArXiv under...

From Computational Complexity

Sanjeev Arora wins ACM-Infosys Award

Sanjeev Arora will receive the 2011 ACM-Infosys Foundation Award, the highest honor ACM gives to a mid-career scientist. Sanjeev Arora is one of the architects...

From Computational Complexity

David Waltz (1943-2012)

David Waltz, head of the Center for Computational Learning Systems at Columbia, passed away yesterday after a battle with a brain tumor at the age of 68. David...

From Computational Complexity

A Busy Time of The Year

It's spring break week at Northwestern so life is supposed to be quiet. No such luck. Endre Szemer

From Computational Complexity

Heading South

Starting in July, I'll be chair of the School of Computer Science in the College of Computing at Georgia Tech. Annie Ant

From Computational Complexity

Intel Science Talent Search

Last week I went to the Intel Science Talent Search Awards Ceremony in DC, probably the most prestigious math and science competition for American high school students...

From Computational Complexity

March Madness

Once again, America's favorite binary tree, the NCAA Men's National Championship Bracket. The tree seems to get more unbalanced every year. There are four regions...

From Computational Complexity

Scott wins the Waterman

The NSF's most prestigious prize, the Alan T. Waterman award, recognizes an outstanding young scientist (35 or under) in any field of science or engineering. Breaking...

From Computational Complexity

The Internet of the Present

On this blog we rarely get non-spam comments on posts more than a few days old. Sometimes I can bring up a topic I had posted on just a few months ago and no one...

From Computational Complexity

Turing's Titanic Machine!

In the March CACM, Barry Cooper writes We quote Peter J. Denning introducing the ACM Ubiquity Symposium on "What is Computation?" as saying: "Researchers in biology...

From Computational Complexity

Nash and the NSA

By now most of you have heard about Nash's recently released letters to the NSA (press release, letters). Not only did John Nash think about computation and cryptography...

From Computational Complexity

Is 99.8% Secure Secure?

Guest post by Janos Simon A group of researchers (Arjen Lenstra and collaborators  from EPFL Lausanne and James Hughes from Palo Alto) published a study, Ron was...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account