WebDiarios de Motocicleta
Informatics Weekly, written by Mihai Pătraşcu.
Friday, August 31, 2007
Led Zeppelin
›
I have typically not been alarmed by the prospects of oil running out. Europe has shown that railroads can work, so personally I couldn'...
2 comments:
Thursday, August 30, 2007
Love thy predecessor (II): The comparison model
›
As mentioned already, the super-standard way to solve the predecessor problem is by binary search. This has led people to define the compari...
4 comments:
Love thy predecessor (I): In the beginning was the Word
›
Thinking about the predecessor problem is the CS-equivalent of a journey within, when you rediscover the very axioms of your existence. It i...
5 comments:
Wednesday, August 22, 2007
Alan Turing and the nature of the beast
›
Between Scott's my-paper-was-rejected-from-FOCS post and the hot-topics discussion on Michael's blog, I have seen one too many ref...
Tuesday, August 21, 2007
Cute Problem (I)
›
Update: This is a "cute problem" only under the additonal constraint that the degree of the tree T is small (say, lg n ). I got my...
6 comments:
Sunday, August 19, 2007
Informatics Olympiads: The End
›
[updated: more IMO people added ] I was told I should have a list of links to the posts, so here goes: I -- the contest II -- why should I c...
6 comments:
Thursday, August 16, 2007
Informatics Olympiads (IV): Besides the IOI
›
IOI is the crown jewel of the CS competitions, but there are quite a few other competitons one has to know about. Other high-school olympiad...
13 comments:
‹
›
Home
View web version