WebDiarios de Motocicleta
Informatics Weekly, written by Mihai Pătraşcu.
Saturday, May 2, 2009
The non-Gödel papers
›
As you probably know, I think theory is in a deep crisis: our obsession to turn into philosophy (prividing unappreciated service to discipli...
13 comments:
Sunday, April 19, 2009
Christos a înviat!
›
Happy Easter! Christos a înviat!
1 comment:
Tuesday, April 14, 2009
Theory and Practice
›
Via David Eppstein, I find out about the Workshop on Theory and Multicores . A memorable citation from the call: [...] Indeed, the programs ...
23 comments:
Wednesday, April 8, 2009
Puzzle: Short-hop permutations
›
Count the number of permutations of size n , such that |π( i ) - π( i +1)| ≤ k , for all i . That is, the hop between any two consecutive va...
4 comments:
CC4: One-Way Communication and a Puzzle
›
As we will discuss in the next post, for some application it suffices to get lower bounds on the one-way communication complexity -- that is...
5 comments:
Monday, April 6, 2009
Puzzle: Cycle Containing Two Nodes
›
The following simple puzzle was circulating among Romanian olympiad participants around 1998. It was supposed to be a quick way to tell apar...
16 comments:
Friday, April 3, 2009
CC3: the good, the bad, the ugly
›
This is the 3rd post in the thread on communication complexity, following Episodes 1 and 2 . This post is also available in PDF . In today...
6 comments:
‹
›
Home
View web version