I am interested in theoretical computer science and in particular in the design and analysis of efficient algorithms (how well does a computer solve your problem?). I recently got interested in algorithmic game theory (the Internet as an anarchic computer), especially in algorithmic mechanism design (will the Internet implement your protocol?).
My current research interests also include approximation algorithms (get an optimal solution in a reasonable amount of time), online algorithms (decide what to do without knowing future requests), algorithmic questions arising in wireless networks (what happens without a fixed network?).
I have been also working on a bunch of other topics including parallel computations (do more computers solve a problem faster than a single one?), automatic graph drawing (make computers display structured information in a pleasent way), fast algorithms for IP lookup (algorithms that speed up traffic forwarding in the Internet), computational complexity applied to knowledge representation (computational hardness turns into succinct ways for representing knowledge reasoning).