WebDiarios de Motocicleta

The STOC accepted papers, with some pointers to online versions, can be found here . I had two papers: Towards Polynomial Lower Bounds for D...

Today, we will prove bounds for the basic cuckoo hashing. We are going to place our n keys into two arrays A[1..b] and B[1..b], where b=2n...

Last time we showed that chaining and linear probing enjoy O(1) expected running times per operation. However, this guarantee is fairly weak...

To understand the state of the art in hash tables, you must understand the holy trinity of the area: chaining, linear probing, and cuckoo ha...

This post is a fairly basic review of common probability notions. Things will get more interesting in future posts. Somebody who wants to do...

This is the time when many young people are fretting about their applications, be they for undergrad admission, PhD admission, or academic j...

As you may have noticed, this blog has been on a bit of a hiatus. On the one hand, my expectations for politics-by-blog have decreased to a ...