is based in the area of Algorithms and Complexity, and my thesis was
based around problems using distances between combinatorial objects.
issues related to communication efficiency and error correction;
data compression and pattern matching;
sketch and streaming algorithms; geometric problems such as nearest neighbors
algorithms, and so on.
You can find my
and research here, along with
various other diversions.
Distributed monitoring of evolving data. See this short
survey for details and definitions.
Verification of outsourced computations. Look at these slides
for some examples.
If you are interested in any of these topics, or other problems in the
area of mining and analyzing large amounts of data, send email to the
Note that I do not have support or projects for interns -- questions about
"internships" may not receive a response.
You get to meet all the top people if you do computer science... and it
pays the bills GRC Last updated May 2017 -- 270677