CPM 2010, June 21-23, New York: CFParticipation

********************************************************************

  21st Annual Symposium on Combinatorial Pattern Matching

               CPM 2010 - CALL FOR PARTICIPATION

        June, 21-23 2010,  NYU-POLY Brooklyn, New York, USA.

               http://cs.nyu.edu/parida/CPM2010/

       Registration:  http://cs.nyu.edu/parida/CPM2010/registration.html

********************************************************************

INVITED SPEAKERS
***********************

Zvi Galil (Tel Aviv University)
Richard M. Karp (University of California at Berkeley)
Jeffrey S. Vitter (Texas A&M University).

PROGRAM
*************
http://cs.nyu.edu/parida/CPM2010/program.html

********************************************************************

Combinatorial Pattern Matching (CPM) addresses issues of searching and
matching strings and more complicated patterns such as trees, regular
expressions, graphs, point sets, and arrays, in various formats. The
goal is deriving non-trivial combinatorial properties of such structures
and exploiting these properties in order to achieve superior performance
for the corresponding computational problems. On the other hand, an
important goal is analyzing and pinpointing the properties and
conditions under which searches can not be performed efficiently.

********************************************************************

CONTACT: cpm2010@catt.poly.edu