[1]: http://valis.cs.uiuc.edu/~sariel/blog/wp-images/smilies/icon_wink.gif
Wednesday, July 27, 2005
by: Rafi
Sunday, June 19, 2005
by: Anonymous
URL: http://valis.cs.uiuc.edu/~sariel/blog/index.php/archives/2005/06/14/the-secret-garden/#comment-96
Wednesday, April 6, 2005
[Vanity of Vanities, all is Vanity] Comment: "Frustration of a subreferee"
Author : (IP: 68.66.83.130 , ca-studio-bsr1t-130.vnnyca.adelphia.net)
Comment:
One of the stranger things I've noticed about theoretical CS (which astonishes my friends in the physical sciences) is that it is often easier to get a paper published in a top-notch theory journal than accepted at a second-rate theory conference. Would you agree that the soundest advice you could give to the authors of the rejected paper is, "consider my comments and then submit it to DCG, IJCGA, or Algorithmica"?
You can see all comments on this post here:
To delete this comment:
http://valis.cs.uiuc.edu/~sariel/blog/wp-admin/post.php?action=confirmdeletecomment&p=192&comment=66
Tuesday, March 1, 2005
Quote
At the mongrel dogs who teach
Fearing not that I'd become my enemy
In the instant that I preach
My pathway led by confusion boats
Mutiny from stern to bow.
Ah, but I was so much older then,
I'm younger than that now.
- My back pages, by Bob Dylan.
URL: http://valis.cs.uiuc.edu/~sariel/blog/index.php/archives/2005/03/02/quote/
Tuesday, September 7, 2004
Data structures and algorithms.
Those books still have several topics which are very well covered compared to other sources.
[1]: http://www.mpi-sb.mpg.de/~mehlhorn/
[2]: http://www.mpi-sb.mpg.de/~mehlhorn/DatAlgbooks.html
URL: http://valis.cs.uiuc.edu/~sariel/blog/2004/09/07#mehlhorn