Sublinear Algorithms 2011

May 22-27
University Residential Center
Bertinoro (Forlì-Cesena), Italy

The meeting is devoted to algorithms that are extremely efficient, in that the amount of resources they use is sublinear in the input size. This includes sublinear time (e.g. property testing), sublinear space (e.g. sketching/streaming algorithms) and sublinear measurements (e.g. sparse recovery/compressive sensing). The talks will cover an interdisciplinary mix of topics, from theoretical computer science, mathematics to digital signal processing.