Workshop on Coding, Complexity and Sparsity

A workshop on Coding, Complexity and Sparsity will be held at Ann Arbor, August
1--4, 2011. It is organized by Anna Gilbert, S Muthukrishnan, Hung Ngo, Ely
Porat, Atri Rudra, Martin Strauss.

There has been a considerable amount of fruitful interaction between coding and
complexity theories, and a fledgling interaction between sparse representation
and coding theories. We believe that academic research will be far richer
exploring more of the connections between sparse representation and coding
theories, as well as, between sparse representation and complexity theories.
Could there be a general structural complexity theory of sparse representation
problems and could techniques from algorithmic coding theory help sparse
representation problems?

The plan is to get researchers from different areas together in a Dagstuhl-like
setting and explore the question. There will be tutorials, talks and time to
research.

Registration is free and the deadline is July 15th.

We have limited funding to (partially) support the participation of some graduate
students.

For more details on the workshop (including the tutorials, list of invited
speakers and how to apply for participation support), please go to the
workshop webpage:

http://www.math.lsa.umich.edu/conferences/coding/