I work at foursquare on the big data team as a software engineer. I get to play with Hadoop, Hive and other fun distributed systems.
Previously, I worked on Hadoop infrastructure at Adconion Media Group. I joined Adconion when Joost was acquired by Adconion in 2009.
I live in New Jersey with my wife, Julie, and my dog, Stella. A few days each week, I do the daily commute from New Jersey to Manhattan to work out of the foursquare office in SoHo.
Before Joost, I was a PhD candidate in the Rutgers Computer Science Department. I’ve worked on a number of interesting problems in applied graph theory, including parallel algorithms for shortest path problems and external memory algorithms for visualizing massive graphs.
I attended Lafayette College where I received a BS in Computer Science. While at Lafayette, I was an avid Ultimate Frisbee player, a hobby which I try to maintain.
Originally, I’m from Mechanicsburg, Pennsylvania where my parents still live.
Hey Joe,
I was looking at your undergrad thesis code for the Thorup implementation. I’m working on a project which approximates a minimum partitioning of a bitmap image and uses only vertices shared by multiple partitions in all-pairs path-finding. Could I use some of you’re code, modified to fit my project?
See my website for current source tarballs and example output.
Thanks,
Jake
Hi Jake,
Please feel free to use the code from the Thorup implementation. That code is in the public domain — although I don’t think I ever explicitely mentioned that. And thanks for reminding me about the code — I recently updated my website and I think I abandoned the pages containing it. I’ll make sure to put them back up.
Joe