Hurah!!I've got some excellent news:
I was co-awarded the
2012 Presburger Award, to be shared with Venkat Guruswami ,the young superstar of error correcting codes.
In short, the Presburger Award is the European "young-scientist award" in Theory.
It is given anually by the European Association for Theoretical Computer Science (EATCS)
to a scientist under 35 "for outstanding contributions in
Theoretical Computer Sciene as documented by a series of published papers."
Not surprisingly, I got the award for my work on data-structure lower bounds.The citation has a lot of nice things to say. Go read it :)
Sunday, May 6, 2012
Presburger Award
Posted by Mihai at 8:43 PM 21 comments
Sunday, April 15, 2012
Happy Easter
Happy Easter!
...to all my readers cellebrating today in the Eastern Orthodox tradition.
According to persistent rumours:
Χριστός ἀνέστη
Christos a înviat!
Posted by Mihai at 10:11 AM 0 comments
Thursday, April 5, 2012
Happpy recovery from the FOCS deadline:with a funny picture :)
Happpy recovery from the FOCS deadline everyone:)
Posted by Mihai at 1:01 PM 8 comments
Sunday, November 6, 2011
New York Theory Day
The Fall 2011 New York Theory Day is happening this Friday, November 11th, at NYU (Courant), and features yours truly as a speaker.
I hope to see many of you there!
Posted by Mihai at 11:05 PM 1 comments
Monday, September 19, 2011
Follow-up: Sampling a discrete distribution
This is a follow-up to my last post, on a puzzle about "Sampling a discrete distribution" (see my comment there for the solution I originally thought of).
Posted by Mihai at 4:03 PM 5 comments
Friday, September 16, 2011
Sampling a discrete distribution
The following cute question came up at lunch today (all credit goes to Aaron Archer).
Posted by Mihai at 1:55 PM 11 comments
Thursday, July 28, 2011
International Olympiad, Day 2
- Player 1 moves on the nodes of the graph, starting at the designated start node, and aiming to reach a target node. In each turn, she can traverse any edge out of her current node [except the blocked edge / see below], incurring a cost equal to the weight of the edge.
- Player 2 can block one edge at every turn. When an edge is blocked, Player 1 cannot traverse it in the next turn. An edge can be blocked multiple times, and any past edge is "unblocked" when a new edge is blocked.
Posted by Mihai at 10:42 AM 10 comments