All CFPs on WikiCFP
Present CFP : 2016
CSR is an annual conference that intends to reflect the broad scope of international cooperation in computer science. In 2006-2009 the symposium consisted of two tracks: Theory Track and Applications and Technology Track, and since 2010 it has a single track. The topics covered vary from year to year, but in general try to cover as much of the contemporary computer science as possible.
Deadline for submissions: December 11, 2015
Notification of acceptance: February 11, 2016
As has become tradition, there will be YANDEX AWARDs for the best paper and for the best student paper!
include, but are not limited to:
algorithms and data structures
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
Christos H. Papadimitriou (University of California at Berkeley, USA)
Herbert Edelsbrunner (Institute of Science and Technology, Austria)
Vladimir Kolmogorov (Institute of Science and Technology, Austria)
Orna Kupferman (Hebrew University, Israel)
Virginia Vassilevska Williams (Stanford University, USA)
Steklov Institute of Mathematics at St. Petersburg of the Russian Academy of Sciences
Authors are invited to submit an extended abstract or a full paper of at most 12 pages in English, not including references, in the LNCS format (LaTeX, as pdf; final version with source); instructions are here:
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.
Submission server: https://easychair.org/conferences/?conf=csr2016