WebDiarios de Motocicleta

Informatics Weekly, written by Mihai Pătraşcu.

Saturday, January 31, 2009

Morse meets Hamming

›
A while ago (2003), I proposed the following problem in the Romanian national olympiad: You are given an alphabet of n letters, and the fre...
5 comments:
Tuesday, January 20, 2009

Talk at Berkeley

›
A long long time ago, when we took our first computers course, we learned that computers represent things in bits, not in base 10, since bit...
5 comments:
Wednesday, December 10, 2008

Succincter

›
'Tis the season to be doing succinct data structures. [P]  My FOCS'08 paper  demonstrated how to use recursion to achieve better red...
4 comments:
Monday, December 1, 2008

B.A.M. 2

›
The Berkeley Algorithmists ' Meeting will continue on Tuesday at 3:30pm . Scheduling. There have been enough calls to change the time ...
2 comments:
Saturday, November 29, 2008

Changes in TCS

›
At the first BAM , I got an idea of how little complexity theory has changed in three decades: after I described Morgenstern's lower bou...
7 comments:
Sunday, November 23, 2008

Berkeley Algorithmists' Meetings

›
I am starting a new reading group at Berkeley. (Actually, I prefer the term "discussion group," since I was never too passionate a...
2 comments:
Thursday, November 20, 2008

Three Days in San Francisco

›
I started the week with a Misfits concert, those 31-year-old punk classics that have influenced all-time favorites like Slayer and Metallic...
‹
›
Home
View web version
Powered by Blogger.