I apologize for the short notice, but my occasional co-author Rasmus Pagh is looking for postdocs for a big data project he recently had funded, with an application deadline on April 14th.
For more information, you can see this page, which starts with:
Scalable Similarity Search (SSS) project led by Professor Rasmus Pagh is
seeking 3 post-docs with a strong background in algorithms theory,
combinatorics, or statistics. The project is funded by the European
Research Council (ERC), runs in the years 2014-19, and will include a
total of 3 PhD and 3 post-doc positions. The aim of the project is to
improve theory and practice of algorithms for high-dimensional
similarity search on big data, and to extend similarity search
algorithms to work in settings where data is distributed (using a
communication complexity perspective) or uncertain (using a statistical
perspective). A post-doc position may include a long-term visit to a
project partner (at Berkeley, Harvard, MIT, Stanford, or Tsinghua) if
all parties find the visit beneficial.
Or you can see this nice video Rasmus recently put together.
And yes, I'm self-interested in this matter, in that as someone who works with Rasmus, the potential "long-term visit" to Harvard described above would involve me if it worked out. Also, Copenhagen is a wonderful place.