The Nobel Prizes will be announced this week and I predict that no one will win the Nobel Prize in computer science for the 105th consecutive year. Computer...
We had a high pitch tone coming from somewhere in our family room but we couldn't find the source. I shut down the power in case the sound was coming from the...
In the second biggest sports story in Chicago (after the White Sox rout of Boston), the Chicago Bulls basketball team traded Eddy Curry to the New York Knicks...
A conversation with a graduate student today. Student: Why doesn't FOCS have a best paper award this year? Me: They often don't announce the winners until the...
My first computer was a TRS-80, my second an Apple IIe. In college I mostly programmed in IBM 370 assembly code. But in graduate school (first at Berkeley and...
A colleague is refereeing a paper in a non-computer science area that shows a certain computational problem is NP-complete. The proof uses a simple reduction...
Piotr Indyk, himself a 2003 Packard Fellow, writes On the recent blog topic of awards : you might be interested to know that Venkat Guruswami just received a...
September Edition Usually we think of the class NP as either languages accepted in polynomial-time by a nondeterministic Turing machine or languages with ...
As you can see from the timestamp of this post, I came into work quite early this morning. I had to drive and needed an early start (about 6 AM) to beat ...
Fonts are the last thing I want to worry about when I write a research paper. Unfortunately fonts have often become the last thing I need to worry about when I...
The University of Chicago denying tenure to an assistant professor is rarely a breaking news story. Yet political scientist Daniel Drezner's case received...
How do you measure your impact as a computer scientist? You can try measures like the Citeseer rank or the h-index , but the only scientifically valid test...
In a new paper , Daskalakis, Goldberg and Papadimitriou show that finding Nash Equilibrium in matrix games with four or more players is complete for the search...
I am spending most of this week at the University of Nebraska for a talk and a workshop . What does Nebraska have to do with Notre Dame, where I visited last...
Another guest post by Bill Gasarch Combinatorics is a branch of Computer Science First episode, Second Season of NUMB3RS I could have a post on how stupid this...
Thanks to Rocco for bringing us the news from FOCS, particularly a comprehensive summary of the business meeting. I am glad to have watched my White Sox in the...
Yesterday my fifth-grade daughter, doing her math homework, asked Is there a faster way to find greatest common factors other than with factor trees ? I live...
The recent FOCS conference had two best paper award winners, the Khot-Vishnoi paper I had mentioned in my post on unique games and Correcting Errors Beyond the...
An assistant professor asks How do I get on program committees and editorial boards? PC chairs and editors-in-chief usually have several excellent candidates...
When you cannot achieve the optimum solution of a problem, how do you measure the performance of an algorithm? If you knew the distribution of instances, you...
About a month ago I had the phone in my office removed. The number was one digit off from both maternity and a nurse's station at the U of C hospitals and if...
A guest post by Rakesh Vohra. Fortnow's post on competitive ratio's has prompted a number to speculate on the `right' number of people who should engage in ...
Welcome to ComplexityCast, the first of a very occasional podcast, an audio version of this weblog. First up, Bill Gasarch and I talk about the P versus NP...
This notice came into my inbox last week. ChicTech, an outreach program of the University of Illinois Department of Computer Science, extends an open...
An excellent Chronicle article on negotiating your job offer. I fully agree with the article that you lose out considerably by not negotiating and that you...
October Edition We end the list of favorite theorems from 1965-74 with two seminal papers by Cook and Reckhow. Stephen Cook and Robert Reckhow, Time-bounded ...
Alice (not the real name) has a STOC submission with Bob and wanted to put the paper on a public archive. Bob insists that the paper not go public until the...
The acceptance rates at conferences for theoretical computer scientists tend to run higher than acceptance rates at conferences in other areas of computer...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
