Our Sponsors
Website http://logic.pdmi.ras.ru/csr2014/ |
Edit Freely
Category computer science
Deadline: December 09, 2013 | Date: June 06, 2014-June 11, 2014
Venue/Country: Moscow, Russia
Updated: 2013-10-30 22:09:51 (GMT+9)
Program Committee Chair:Jean-Eric Pin (CNRS and U. Paris-Diderot)Program Committee:Eric Allender (Rutgers)Andris Ambainis (U. of Latvia)Christel Baier (TU Dresden)Petra Berenbrink (Simon Fraser U.)Mikolaj Bojanczyk (U. of Warsaw)Andrei Bulatov (Simon Fraser U.)Victor Dalmau (U. Pompeu Fabra)Manfred Droste (U. of Leipzig)Zoltan Esik (U. of Szeged)Fedor Fomin (U. of Bergen)Edward A. Hirsch (Steklov Inst./St.Petersburg)Gregory Kucherov (CNRS and U. Marne-la-Vallee)Michal Kunc (Masaryk U.)Leonid Libkin (U. of Edinburgh)Konstantin Makarychev (Microsoft Research)Kurt Mehlhorn (Max-Planck Inst.)Georg Moser (U. of Innsbruck)Alexander Okhotin (U. of Turku)Giovanni Pighizzini (U. of Milano)Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)Michel Rigo (U. of Liege)Nicole Schweikardt (U. of Frankfurt)Jacobo Toran (U. of Ulm)Mikhail Volkov (Ural Federal U.)Carsten Witt (TU Denmark)Distinguished opening lecture: Shafi Goldwasser (MIT)Invited Speakers include:Mark Braverman (Princeton)Volker Diekert (Stuttgart)Martin Grohe (RWTH Aachen)Benjamin Rossman (National Institute of Informatics, Tokyo)Alexei Semenov (Moscow)Igor Walukiewicz (Bordeaux)Important Dates: Submission: December 9, 2013Notification: February 12, 2014Topics: include, but are not limited to:algorithms and data structuresalgorithms for concurrent and distributed systems, networkscomputational complexityproof complexityKolmogorov complexitycombinatorial optimizationconstraint solvingcryptographycombinatorics in computer scienceautomata theory and formal languagescomputational models and conceptsdatabase theoryapplications of logic to computer scienceproof theorymodel checkingautomated reasoningdeductive methodsSubmission:Authors are invited to submit original (and not previously published) research. Submissions consist of two parts: the main paper and an appendix(which might be empty). The main paper must be at most 14 pages in length,including references. All proofs omitted from the main paper due to spaceconstraints should be given in the appendix or made accessible through areliable link to a freely available electronic preprint. The papers must be submitted in English, in the LNCS format (LaTeX, as pdf; final versionwith source) with page numbering turned on using the pagestyle{plain} command; instructions are here:http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Simultaneous submission to journals or to other conferences with publishedproceedings is not allowed. The proceedings of the symposium will be published in Springer's LNCS series. Accepted papers MUST be presentedat the symposium.Submissions should be uploaded to the EasyChair Conference system:http://www.easychair.org/conferences/?conf=csr2014
Yandex Awardsfor the best paper and for the best student paper will be given by the PC.Conference co-Chairs:Nikolay Vereshchagin (Moscow)Edward A. Hirsch (St.Petersburg)Sergei O. Kuznetsov (Moscow)Organized by Moscow Center for Continuous Mathematical EducationNational Research University Higher School of EconomicsSteklov Institute of Mathematics at St.Petersburg of Russian Academy of SciencesSponsored by YandexNational Research University Higher School of EconomicsRussian Foundation for Basic ResearchFurther information and contacts:Web: http://logic.pdmi.ras.ru/csr2014
Email: csr2014 "at" googlegroups.comKeywords: 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.