This is probably not interesting to anyone, but I remember the first (and only) time I published a paper, based on Mr. Farach-Colton's and Mr. Bender's (specifically this paper [0]) work, and after presenting it someone in the audience asked a few questions for which I was unprepared for.
After I finished my presentation I walked to the patio and got to meet the guy that asked me those questions. Turns out that he was Martin Farach-Colton!
Got to chat with him and even went to eat something and he turned out to be a really nice guy, laid back, not cocky at all. I mean, here there was a guy that had done some great research on algorithms and other areas and that I happen to admire a lot, just chatting with me, telling me about this Tokutek project he was starting (at the time the website was just an "under construction" page), and in general being an interesting person to talk to.
If anyone is remotely interested in a different way of obtaining the Least Common Ancestor between two nodes in a tree, definitely check this paper out. When I managed to understand why it works, it rekindled my love for algorithm design.
This is probably not interesting to anyone, but I remember the first (and only) time I published a paper, based on Mr. Farach-Colton's and Mr. Bender's (specifically this paper [0]) work, and after presenting it someone in the audience asked a few questions for which I was unprepared for.
After I finished my presentation I walked to the patio and got to meet the guy that asked me those questions. Turns out that he was Martin Farach-Colton!
Got to chat with him and even went to eat something and he turned out to be a really nice guy, laid back, not cocky at all. I mean, here there was a guy that had done some great research on algorithms and other areas and that I happen to admire a lot, just chatting with me, telling me about this Tokutek project he was starting (at the time the website was just an "under construction" page), and in general being an interesting person to talk to.
If anyone is remotely interested in a different way of obtaining the Least Common Ancestor between two nodes in a tree, definitely check this paper out. When I managed to understand why it works, it rekindled my love for algorithm design.
[0] The LCA Problem Revisited - https://dl.acm.org/citation.cfm?id=690192