AK is looking for a summer intern in our R&D group. If any of our blog posts have interested you, then you’ll fit right in!
- building and tuning high-performance data structures,
- streaming algorithms,
- interesting data visualizations, and
- how to translate academic research into business value.
It’s OK if you’ve never seen the stuff we write about on the blog before! We didn’t either until we started researching them!
I can’t emphasize this enough: we don’t expect you to know how to do the things above yet. We simply expect you to have a passion for learning about them and the diligence to work through what (at the time) seem like impossible problems. Work experience is nice, but not necessary. As long as you can write clean code and can work hard, you’re well-qualified for this job.
If you’re interested, please send a brief note about why you’re interested, along with a CV and/or GitHub username to timon at aggregateknowledge dot com. For extra credit, please submit one (or more!) of the following:
- An implementation of HLL, Count-Min Sketch, K-Min Values, or Distinct Sampling in a language of your choice.
- An extension to Colin’s blog post about a good hash function that adds CityHash and SipHash to the shoot-out.
- An explanation of the tradeoffs between using a hash map and Count-Min Sketch for counting item frequency.
(I feel like I shouldn’t have to say this, but yes, these are all answered somewhere on the internet. Don’t plagiarize. What we want is for you to go learn from them and try your own hand at implementing/experimenting. Also, don’t freak out, these are extra credit!)