JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  September 2010

CPHC-CONF September 2010

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

6th International Computer Science Symposium in Russia (CSR 2011): Call for Papers

From:

Alexander S. Kulikov <[log in to unmask]>

Reply-To:

Alexander S. Kulikov <[log in to unmask]>

Date:

Sat, 11 Sep 2010 16:16:09 +0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (1 lines)

We apologize for multiple copies.



*******************************************************************************



First Call for Papers



6th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2011)



June 14-18, 2010, St. Petersburg, Russia



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



*******************************************************************************



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: [log in to unmask] 





FURTHER INFORMATION AND CONTACTS



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

Email:  [log in to unmask]

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager