Monday, January 17, 2011

Some Questions

On my mind:
  • Should ACM/SIGACT/EATCS do a Gödel Prize for Applied Algorithms (theoretical algorithms research that has demonstrable impact on practice), notwithstanding the difficulties in defining and quantifying that?
  • Who are some of the finalists for the Simons Institute for Theory of Computing?
  • Is there an emergence of network coding in practice?
Any answers will be appreciated.



Anonymous Anonymous said...

Don't we have a Kanellakis prize for applied algorithms with impact?

8:51 AM  
Anonymous Anonymous said...

In fact, don't we already have the Turing award for all of Computer Science, so why do we need any more?

11:22 AM  
Anonymous Anonymous said...

* Turing is across all areas of CS, specialized awards like Godel Prize have a place.

* I thought Kanellakis award was not a acm+sigact act, but now that I check the details (apologies), it is more than acm+sigact and includes sigmod+sigda... Sounds good to me.

-- Metoo

4:30 PM  
Anonymous Anonymous said...

One should wish for fewer prizes, not more. It would be great to have no prizes whatsoever...

2:27 PM  
Anonymous Anonymous said...

Yes, fewer or no prizes is good (at some point, I argued all theory researchers in research labs should get the same bonus, no differentiation/discrimination). But in the past few months while writing letters for some folks, I discovered awards/prizes as a (lazy man's) proxy.

-- Metoo

6:15 AM  
Anonymous Anonymous said...

no response to the last question

but how was the proposal of Rutgers for the Simons Institute for Theory of Computing?

3:42 PM  
Anonymous Anonymous said...

Rutgers was part of a proposal that was not invited for the second round.

-- Metoo

5:12 PM  

Post a Comment

<< Home