Dear friends and colleagues, We would like to encourage you to submit suitable papers to the journal Computational Complexity (cc). We believe that cc should...
An interesting NSF press release describes the importance of the layout of offices to the productivity of a research group: Clustering items like refrigerator,...
Dear friends and colleagues, We would like to encourage you to submit suitable papers to the journal Computational Complexity (cc). We believe that cc should...
Editor's Note: I don't plan to be an announcement server but this theory day deserves some extra publicity. Despite the self-aggrandizing it looks like quite...
An interesting NSF press release describes the importance of the layout of offices to the productivity of a research group: Clustering items like refrigerator,...
Editor's Note: I don't plan to be an announcement server but this theory day deserves some extra publicity. Despite the self-aggrandizing it looks like quite...
I spent a considerable part of yesterday looking at applications for our Ph.D. program in theoretical computer science. Some of you readers might have an...
"I like everybody in this field" Berkeley professor Christos Papadimitriou said during his acceptance speech of the Knuth Award at the 2002 STOC conference. He...
"I like everybody in this field" Berkeley professor Christos Papadimitriou said during his acceptance speech of the Knuth Award at the 2002 STOC conference. He...
Let's look at some interesting questions about the set of smallest programs. This post relates more to recursion theory than complexity theory. No time bounds...
Michael Nielsen has a post linking to a post linking to a post noting that the editorial board of the Journal of Algorithms (published by Elsevier) resigned en...
Every reader of this weblog should know about the recursive and recursively enumerable (r.e.) sets, languages accepted by Turing machines where for recursive...
The closest thing this weblog has to the academy awards; the list of accepted papers of the upcoming Computational Complexity Conference is up. -- Posted by...
Every reader of this weblog should know about the recursive and recursively enumerable (r.e.) sets, languages accepted by Turing machines where for recursive...
The most requested topic I get is for my advice for graduate students. So I would be remiss not to mention Ian Parberry's excellent guides to giving...
The closest thing this weblog has to the academy awards; the list of accepted papers of the upcoming Computational Complexity Conference is up. -- Posted by...
When I started college in 1981 I brought a typewriter with me. Junior year of college I experimented with a simple text processor system called script--no more...
Time for one of my complexity-related movie recommendations. The 1992 film Sneakers describes the adventures of a professional hacking team led by Robert...
Time for one of my complexity-related movie recommendations. The 1992 film Sneakers describes the adventures of a professional hacking team led by Robert...
Yesterday I got an email addressed from SUNY Stonybrook with a strange attachment. I checked it with a virus checker and then stupidly opened it. Apparently a...
One of our graduate students asked me why, if the NSF has limited grant money, do our program officers actively and sometimes aggressively encourage more grant...
Yesterday I got an email addressed from SUNY Stonybrook with a strange attachment. I checked it with a virus checker and then stupidly opened it. Apparently a...
While visiting Bill Gasarch in Maryland, he chose to show a tape of Fermat's Last Tango , an off-Broadway musical based loosely on Wiles and his experience...
One of our graduate students asked me why, if the NSF has limited grant money, do our program officers actively and sometimes aggressively encourage more grant...
A few interesting items from this week's Newsweek . Chicago Theory Ph.D. Amber Settle and quantum computing expert Andre Berthiaume redefine marriage . Donald...
In the November 1989 issue of American Mathematical Monthly Yoram Sagher presented a note "Counting the Rationals" giving a simple 1-1 mapping from the...
Persi Diaconis once again shatters our belief in generating randomness; this time showing , with Susan Holmes and Richard Montgomery, that flipping coins does...
The first issue of 2004 of SIGACT News is out. The complexity column has part 2 of last issues' article on constraint satisfaction problems. More exciting is...
Persi Diaconis once again shatters our belief in generating randomness; this time showing , with Susan Holmes and Richard Montgomery, that flipping coins does...
This week I'm visiting the University of Calgary and although I have never been here before it seems like a homecoming. They have a strong quantum computing...
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.
