Radu Berinde

According to our database, Radu Berinde authored at least 5 papers between 2008 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Space-optimal heavy hitters with strong error bounds.

Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Sequential Sparse Matching Pursuit.

Radu Berinde, Piotr Indyk

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

An approximate string matching approach for handling incorrectly typed urls.

Mihai Stroe, Radu Berinde, Cosmin Negruseri, Dan Popovici

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

Practical near-optimal sparse recovery in the L1 norm.

Radu Berinde, Piotr Indyk, Milan Ruzic

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

Combining geometry and combinatorics: A unified approach to sparse signal recovery.

Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss

Proceedings of the 46th Annual Allerton Conference on Communication, 2008