New: Beyond Cracking the Coding Interview is out for pre-order on Amazon!
Hi!
I am a computer scientist specialized in algorithm design.
I received a PhD as part of the CS Theory group at UCI. I was fortunate to be advised by Professors David Eppstein and Michael Goodrich. Before that, I got a bachelor's degree in CS from UPC in my hometown of Barcelona.
After my PhD, I spent some time in industry as a senior SWE at Google. I worked on Google's internal software-defined WAN, optimizing the allocation of network bandwidth to Google's services.
I'm currently writing Beyond Cracking the Coding Interview, with Gayle Laakmann McDowell, Mike Mroczka, and Aline Lerner. It's now out for pre-order on Amazon!
My passion project is wallwars.net, an online board game.
Research
My research spans
computational geometry,
greedy
algorithms,
graph data structures,
computational
biology, and
recreational mathematics.
My dissertation, New Applications of the Nearest-neighbor
Chain Algorithm
(blog article, defense slides)
studies how to relax
the "greedy choice" in certain greedy algorithms without affecting the final
solution. This idea, paired with an algorithmic technique called nearest-neighbor chain,
allows
us to speed up some greedy algorithms (like the Multi-fragment algorithm
for Euclidean TSP from O(n2) to
O(n log n)).
See Research for more.