Monday, December 17, 2012

[DMANET] CSEDays 2013: student school on algorithms and complexity

Computer Science E-days (CSEDays)
Algorithms and Complexity
Ekaterinburg, Russia, June 29 -- July 01, 2013


Computer Science days in Ekaterinburg (CSEdays) is a series of schools organized
by the Ural Federal University, the biggest Russian university outside Moscow.
The first school took place in 2010. Working languages of the school are
English and Russian.

The main objective of the CSEdays is to expose the students in
computer science and
related disciplines to the research topics usually not covered within
the regular
university curricula. Previous editions of the school were focused on various
computer science and software engineering topics such as software reliability,
information security and cryptography, multi-agent systems, computer networks,
and graph theory & applications. The school is addressed to advanced graduate
and PhD students in mathematics, computer science, and software engineering,
as well as young researchers and software developers from industry.

The 6th school will be held in Ekaterinburg, Russia on June 29 -- July 01, 2013.
The topic of the school is "Algorithms and Complexity". The program will
consist of 4 short lecture courses as well as student presentations and
poster sessions. Students are encouraged to submit not only published or
completed research, but also a short summary of work in progress or even a
concise review of a problem area. The primary goal of submitting a paper,
as we see it, is getting feedback from experts in complexity theory as well
as school lecturers and participants.

A submission should include a two page long extended abstract (formatted
in LaTeX, see the template below) plus an arbitrarily long appendix. Such
an appendix may include a full paper (published, submitted, or just
written) and/or some extra material to accompany the abstract: proofs,
tables, graphs, formal description of algorithms, etc. All submissions
will be reviewed by experts and the reviews will be sent to the authors.
The authors of accepted submissions are supposed to give a short talk or
to present a poster at the school. Extended abstracts of accepted
submissions will also be published in the internal proceedings of the

The school will be held right after the 8th International Computer Science
Symposium in Russia (CSR 2013, June 25--29):
Any participant of the school may arrive earlier and attend the talks of
the CSR 2013 without paying the conference registration fee.


Konstantin Makarychev (Microsoft Research, US)
Semidefinite programming and approximation algorithms

Alexander Shen (Montpellier Laboratory of Informatics, Robotics,
and Microelectronics and Institute for Information Transmission Problems, RU)
Kolmogorov complexity

Mario Szegedy (Rutgers University, US)
Lovász Local Lemma

Ryan Williams (Stanford University, US)
Connections Between Algorithms and Lower Bounds


Participation in the school is free of charge and includes school
materials, coffee breaks,
and social events. Organizers will provide a limited number of
accommodation grants for up
to three nights (when distributing the grants, the students who
proposed a talk at the
school will receive higher priority). The school will admit up to 60
participants selected
by the program committee among all applicants. The registration form
will be open
in the end of January.


Application deadline: April 10, 2013
Notification of acceptance: May 10, 2013
CSR 2013 conference: June 25--29, 2013
School: June 29 -- July 1, 2013


Ekaterinburg is a large city in the heart of Russia, 1600 km (a 2 hour
flight) east from
Moscow. It is the capital city as well as the main financial,
cultural, and scientific
centre of the Ural region. Ekaterinburg is accessible by direct
regular flights of a
number of international airlines including Lufthansa, Aeroflot,
Finnair, Czech Airlines,
Turkish Airlines, and FlyDubai. Ural Federal University is the largest
Russian university
outside Moscow.


Further info will appear on the school webpage:
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.