acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

Sparse problems in NP thought to not be in P

(This post is similar to this old post. I am posting this anyway since when I first posted I made fundamental mistake. I fixed it the point I was trying to make...

From Computational Complexity

Can you ever be denied Full Prof? Can you ever really fail a PhD defense.?

Is it possible for someone to be denied Full Prof? Yes, but it is rare. Is it possible for someone to fail a PhD defense? Yes, but it is rare. These questions...

From Computational Complexity

Conflicts of Interest

a conflict-of-interest? Some thoughts. Thought One PROF: I can't vote on Professor X's Full Prof case since I have a conflict. CHAIRMAN: (There areThought...

From Computational Complexity

Jobs- who ended up where? You tell us!

Within CS theory who ended up at what jobs? Neither Lance nor I knows this. But YOU do--- collectively! So, I ask you, the readers, to leave comments about who...

From Computational Complexity

Is this solution cheating?

Consider the following problem: A hole is drilled through the center of a sphere. The cylinder-with-caps is removed. The length of the removed cylinder (itHere...

From Computational Complexity

The P vs NP quiz Show. NP! NP! NP!

Some random thoughts about quiz shows. THOUGHT ONE: There could be a quiz show based on P and NP. We all think that FINDING an answer is harder than VERIFYING...

From Computational Complexity

The Lefthanded Latino Lesbians in Algebraic Topology Workshop

There was a Women in Theory Workshop at Princeton From June 19-23. ***SORELLE***, who was there, has some intelligent and interesting things to say about it...

From Computational Complexity

Talking about your work with a layperson

How to best describe what we do to the layperson? It depends on what you mean by layperson. I was in Austin Texas visiting my nephew Jason. I was also giving...

From Computational Complexity

Foundational ... or simply a curiosity (Guest Post by Vijay Vazarani)

(Guest Post by Vijay Vazirani) Foundational ... or Simply a Curiosity? Conventional wisdom has it that whereas linear programs have rational solutions,...

From Computational Complexity

CCC 2010

( Reminder:Deadline for submitting to special issue of Theory of Computing in honor of Rajeev Motwani is July 30. See here. ) CCC 2010! Ran Raz gave an...

From Computational Complexity

Alternative Careers for Logicians

(Will post on Complexity next week. I am waiting until the invited talks have their slides online so that I can point to them.) Lets say you just got a PhDacademic...

From Computational Complexity

Another post on Martin Gardner

(I will post about CCC 2010 later in the week.) Several people have posted on the death of Martin Gardner: Complexity Blog (Lance) Shtetl Optimized (Scott)...

From Computational Complexity

Whats your Game Mr. Bond- The sequel!

(I will post about CCC 2010 later in the week.) The word Game is used in many different contexts within math and computer science. I list out all that a group...

From Computational Complexity

24: Really Bad Game Theory, technology, and science

The TV show 24 aired its last episode on May 24. The show used computers and technology ALOT, more than on most shows. Was it realistic? What it interesting? ...

From Computational Complexity

Teaching for the first time: SUBRUK's story

(Guest Post by Subrahmanyam Kalyanasundaram) My First-time Teaching Experience. Background: This spring semester, here at Georgia Tech, I got the opportunity...

From Computational Complexity

What should be in an automata course: Two views based on recent experience

(Joint Post with Subrahmanyam Kalyanasundaram) In this post, I speculated on what I might put into my automata theory course. That prompted Subrahmanyam Kalyanasundaram...

From Computational Complexity

When to go Low Tech

Recently someone asked me to subreferee a paper for a conference. She emailed me a pdf file but when I printed it out it was unreadable- the spacing was all off...

From Computational Complexity

Knowledge is Power!

In my last post I gave and asked for examples of people who didn't know things that they really ought to know. A commenter named Josh said posted the following:...

From Computational Complexity

What did he know and when did he know it?

Sometimes you learn a theorem in your academic career far later than you should have. Here are some examples. I didn't know the classic upper bounds on the higher...

From Computational Complexity

COLT and CCC no longer take papers in ...

The list of COLT papers are posted here. Carl Smith claimed that COLT was made possible because of THREE strands of learning theory coming together to form a...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account