Near-Optimal Sparse Recovery in the L_1 Norm
With Piotr Indyk.
In the proceedings of FOCS 2008 (49th Annual IEEE Symposium on Foundations of Computer Science). © IEEE
[PDF | slides]

Practical Near-Optimal Sparse Recovery in the L_1 Norm
With Radu Berinde and Piotr Indyk.
In Allerton 2008.
[PDF]

Constructing Efficient Dictionaries in Close to Sorting Time
In ICALP 2008 (35th International Colloquium on Automata, Languages and Programming), LNCS 5125, pp. 84-95. © Springer.
[PDF of longer version | slides]

Linear Probing with Constant Independence
With Anna Pagh and Rasmus Pagh.
SIAM Journal on Computing (SICOMP), 39(3). © SIAM
Special issue devoted to STOC 2007 (39th ACM Symposium on Theory of Computing).
[journal version | conference version ]

Making Deterministic Signatures Quickly
ACM Transactions on Algorithms, 5(3), July 2009. © ACM
Special issue devoted to SODA 2007 (18th ACM-SIAM Symposium on Discrete Algorithms).
Best student paper award at SODA.
[PDF | slides] This is the author's version of the work.

Deterministic load balancing and dictionaries in the parallel disk model
With Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Pătraşcu, and Peter Tiedemann.
In the proceedings of SPAA 2006 (18th Annual ACM Symposium on Parallel Algorithms and Architectures), pp. 299-307. © ACM.
[PDF | slides]