WACC 2008 CALL FOR PAPERS AND PARTICIPATION

We would like to draw your attention to the:


Russian-Indian Workshop on Algebra, Combinatorics and Complexity


          Moscow (Russia), June 6th and 7th, 2008

             A Satellite Workshop to CSR 2008

          http://csseminar.kadm.usu.ru/WACC.htm

Links between algebra, combinatorics and computer science are numerous
and studying them has proved to be productive for these theories. In fact,
theoretical computer science and especially complexity theory provide
one of the most essential sources of problems for modern abstract algebra
and combinatorics while algebraic methods and combinatorial techniques
constitute a major ingredient of the toolbox of modern complexity theory.

A lucky coincidence is that a representative international algebraic conference,
see http://www.math.msu.su/department/algebra/Kurosh/en/index.htm , will be held
in Moscow from May 28th to June 3rd, 2008, that is, shortly before CSR 2008.
This creates a very convenient opportunity to bring together researchers interested
in various aspects of the interaction between algebra, combinatorics and complexity.
Therefore we have proposed to organize on June 6th and 7th, 2008,
a workshop devoted to this interaction.

INVITED SPEAKERS:

- Eric Allender (Rutgers University)

- Boris Plotkin (Hebrew University)

IMPORTANT DATES:

SUBMISSION DEADLINE: March 22nd, 2008

NOTIFICATION OF ACCEPTANCE: April 7th, 2008

FINAL PAPERS: May 5th, 2008

THE PROCEEDINGS in electronic format will be distributed to all
participants of the workshop.

We invite you to send an extended abstract (6-10 pages in 11 pt)
to [log in to unmask] Use the standard LaTeX article class.
Proofs and other material omitted due to space constraints can be put
into a clearly marked appendix to be read at discretion of the referees.

Simultaneous submission to a journal or another conference is allowed.
Submitting to and presenting at the workshop does not preclude subsequent
submission to a conference with published proceedings or journal; the workshop
is intended to be a forum to present ongoing/unfinished work and get feedback.

WORKSHOP FEE:

30 Euros, to be paid together with the CSR 2008 registration fee.
It is also possible to register just for the workshop.

FINANCIAL SUPPORT:

The organizers have submitted a proposal under the DST-RFBR Indian-Russian joint
workshop scheme. If successful, this application will ensure some support to
a limited number of participants from India and Russia. The decision of DST
(Department of Science & Technology of the Government of India) and RFBR
(Russian Foundation for Basic Research) will be announced in April. If you are
a Russian or Indian national working in Russia/India respectively and wish to
apply for financial support, please send a request to  [log in to unmask]
before 31st March 2008.

THE RELATION TO WCCDA 2007:

Speaking formally, the planned workshop has got no predecessors at
the previous CSRs. However, Markus Lohrey (Leipzig University) organized
WCCDA 2007, the Workshop on Computational Complexity and Decidability in
Algebra, at CSR 2007 held in Ekaterinburg, Russia, see
http://csr2007.usu.ru/index.php/CCDA. That workshop devoted to just one
important aspect of algebra-complexity interaction got a very positive feedback
from both its participants and the organizers of the main conference.
The general feeling was that a similar workshop should be organized at
the next CSR as well. We think however that a workshop with a broader scope
is more justified.

THE WORKSHOP ORGANIZERS:

Meena Mahajan (Institute of Mathematical Sciences, Chennai, India)
and
Mikhail Volkov (Ural State University, Ekaterinburg, Russia)