Sign for Notice Everyday    注册| 登陆| 友情链接| English|

Our Sponsors


    CSR 2011 - 6th International Computer Science Symposium in Russia

    View: 1875

    Website http://logic.pdmi.ras.ru/csr2011/ | Want to Edit it Edit Freely

    Category computer science

    Deadline: December 06, 2010 | Date: June 14, 2011-June 18, 2011

    Venue/Country: St. Petersburg, Russia

    Updated: 2010-09-15 16:13:13 (GMT+9)

    Call For Papers - CFP

    CSR 2011 intends to reflect the broad scope of international cooperation in

    computer science. It is the sixth conference in a series of regular events

    started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007

    in Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010),

    CSR 2009 in Novosibirsk (see LNCS 5675), and CSR 2010 in Kazan (see

    LNCS 6072).

    IMPORTANT DATES

    Deadline for submissions: December 6, 2010

    Notification of acceptance: February 6, 2011

    Conference dates: June 14-18, 2011

    As has become tradition, there will be YANDEX AWARDs

    for the best paper and for the best student paper!

    TOPICS

    include, but are not limited to:

    * algorithms and data structures

    * combinatorial optimization

    * constraint solving

    * computational complexity

    * cryptography

    * combinatorics in computer science

    * formal languages and automata

    * computational models and concepts

    * algorithms for concurrent and distributed systems, networks

    * proof theory and applications of logic to computer science

    * model checking

    * automated reasoning

    * deductive methods

    OPENING LECTURE

    Dima Grigoriev (Institut des Mathematiques de Lille, France)

    INVITED SPEAKERS

    Manindra Agrawal (Indian Institute of Technology Kanpur, India)

    Jarkko Kari (University of Turku, Finland)

    Alexander Shen (LIF Marseille, France)

    Madhu Sudan (MIT & Microsoft Research, USA)

    The full list of invited speakers TBA.

    PROGRAM COMMITTEE

    Nikolai K. Vereshchagin (Moscow State University, Russia; Chair)

    Farid Ablayev (Kazan State University, Russia)

    Maxim Babenko (Moscow State University, Russia)

    Olivier Carton (Universite Paris Diderot, France)

    Bruno Durand (Universite de Provence, Marseille)

    Anna Frid (Sobolev Institute of Mathematics, Russia)

    Valentine Kabanets (Simon Fraser University, Canada)

    Juhani Karhumaki (University of Turku, Finland)

    Michal Koucky (Institute of Mathematics, Czech Republic)

    Meena Mahajan (Institute of Mathematical Sciences, India)

    Yuri Matiyasevich (Steklov Institute of Mathematics at St. Petersburg, Russia)

    Pierre McKenzie (Universite de Montreal, Canada)

    Ilya Mironov (Microsoft Research, USA)

    Ilan Newman (Haifa University)

    Alexander Razborov (University of Chicago, USA and

    Steklov Mathematical Institute, Russia)

    Miklos Santha (Universite Paris-Sud, France)

    Nitin Saxena (Hausdorff Center for Mathematics, Germany)

    Valentin Shehtman (Institute for the Information Transmission Problems, Russia)

    Alexander Sherstov (Microsoft Research, New England)

    Thomas Thierauf (Aalen University, Germany)

    Oleg Verbitsky (Institute for Applied Problems of

    Mechanics and Mathematics, Ukraine)

    Mikhail Volkov (Ural State University, Russia)

    Igor Walukiewicz (Universite de Bordeaux, France)

    ORGANIZERS

    Steklov Institute of Mathematics at St. Petersburg of

    the Russian Academy of Sciences and

    Academic University of the Russian Academy of Sciences

    CONFERENCE CHAIR

    Alexander S. Kulikov (Steklov Institute of Mathematics at

    St. Petersburg, Russia)

    SUBMISSIONS

    Authors are invited to submit an extended abstract or a full paper of at most

    12 pages, not including references, in the LNCS format (LaTeX, as pdf; final

    version with source); instructions are here:

    http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0

    Proofs and other material omitted due to space constraints are to be put into

    a clearly marked appendix to be read at discretion of the referees. Papers

    must present original (and not previously published) research. Simultaneous

    submission to journals or to other conferences with published proceedings is

    not allowed. The proceedings of the symposium will be published in Springer's

    LNCS series.

    Submissions should be uploaded to the EasyChair Conference system:

    http://www.easychair.org/conferences/?conf=csr2011

    SATELLITE WORKSHOPS

    A workshop on post-quantum cryptography, which is a satellite

    workshop of CSR 2011, will be held in cooperation with PDMI on

    June 12-13, 2011. The workshop will focus on new ideas in cryptography,

    in particular in public key cryptography, that could lead to cryptographic

    schemes resistant against attacks by quantum computers. Topics of interest

    include (but are not restricted to): authentication, key establishment,

    secret sharing, multiparty computation, hash functions. Workshop

    co-chairs are Dima Grigoriev and Vladimir Shpilrain;

    contact email: postquantumatlogic.pdmi.ras.ru

    FURTHER INFORMATION AND CONTACTS

    Web: http://logic.pdmi.ras.ru/csr2011/

    Email: csr2011atlogic.pdmi.ras.ru


    Keywords: Accepted papers list. Acceptance Rate. EI Compendex. Engineering Index. ISTP index. ISI index. Impact Factor.
    Disclaimer: ourGlocal is an open academical resource system, which anyone can edit or update. Usually, journal information updated by us, journal managers or others. So the information is old or wrong now. Specially, impact factor is changing every year. Even it was correct when updated, it may have been changed now. So please go to Thomson Reuters to confirm latest value about Journal impact factor.