Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
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...
From Computational Complexity
Special Issue of TOC in honor of Rajeev Motwani
(Guest post by Samir Khuller, Sudipto Guha, Laci Babai) Special Issue of the journal Theory of Computing in honor of Rajeev Motwani (1962 - 2009) Submit...
From Computational Complexity
Can The Hill Cipher ever be used?
Alice and Bob want to sent a message so that even if Eve intercepts it, she cannot tell what it is. We will allow Alice and Bob a short private meeting to exchange...
From Computational Complexity
Knuth Prize for 2009: David Johnson
Dave Johnson Won the KNUTH PRIZE for 2009: click here I can't add much to the article linked to except to say that it is well deserved. The Wikipedia entry...
From Computational Complexity
CCC 2010 papers posted (I know- Old News)
As Lance tweeted, the papers for CCC 2010 are posted here. The Guest Speakers look AWESOME!: Knot, Raz, Regev. Also Banquet speaker Hartmanis AWESOME! Based...
From Computational Complexity
Is Math too hard?
Are humans good at Math? In the movie Oh God Book II God (played by George Burns) says that Math was a mistake, I made it too hard!. While I am reluctant to...
From Computational Complexity
Doing it OLD SCHOOL!
If you browse the Univ of MD Schedule Web pages for the last few years I would: Ask you why you were doing that. Seems like an odd use of your time. Point out...
From Computational Complexity
What is in MY automata theory course/What should be
In the last post I pondered what was more important: Automata Theory or Crypto. This raises the question of what should be in a course in automata theory. Rather...
From Computational Complexity
What is more importantt: Automata Theory or Crypto?
The way the requirements are set up at Univ of MD at College Park, without getting into details, has set up a competition between Crypto and Automata Theory That...
From Computational Complexity
A problem about Graph Partitions (guest post)
(Guest post from Richard Taylor who requests information on a problem.) The following graph partition problem arises in connection with studies I am doing on...
From Computational Complexity
Kurt Mehlhorn to receive EATCS award
Kurt Mehlhorn will receive EATCS award! Read about it here. He has had a LONG and PRODUCTIVE career with many EXCELLENT papers. While he is mostly known for data...
From Computational Complexity
e to the pi vs pi to the e
(ANSWER to Trivia Questions from Last Post: The last president who became president NOT by being VP and having the prez die, but then did not run again, was Rutherford...
From Computational Complexity
Prediction on Presidents Day
Its PRESIDENT"S DAY so I have two predictions: One about the election of 2012 and one about P vs NP. ON P VS NP: I have one prediction about P vs NP. It isON...
From Computational Complexity
FOCS 2010 CALL FOR PAPES is out!
(Univ of MD at College Park had Monday, Tuesday, Wed, Thursday all off. I've spend most of that time shoveling snow, so I am tired. Hence I am glad to have a SHORT...
From Computational Complexity
What is an Elementary Proof?
What is an Elementary Proof? Different things in different contexts. An Elementary Proof is one that does not use Complex Analysis. Basic Calculus is fine. This...
From Computational Complexity