<p>Computer scientist, working on theoretical questions that are motivated by practical problems.  My thesis was on <a href="http://ora.ox.ac.uk/objects/uuid:5d641fff-4d95-43b2-9ff8-73395d782ad8" rel="nofollow">tractable classes of constraint satisfaction problems</a>, and I have also worked on <a href="http://dl.acm.org/citation.cfm?doid=2576988.2556524" rel="nofollow">containment of conjunctive database queries</a>,  the <a href="http://arxiv.org/abs/1204.3860" rel="nofollow">macroscope model of communication complexity</a>, <a href="http://eccc.hpi-web.de/report/2012/183/" rel="nofollow">lower bounds for streaming</a>, and <a href="http://arxiv.org/abs/0904.4512" rel="nofollow">bounds on parallelism</a>.</p>

András Salamon