[FOM] CiE Newsletter No.47, May 18, 2011

Olivier Bournez bournez at lix.polytechnique.fr
Wed May 18 15:56:42 EDT 2011

CiE Newsletter No.47, May  18, 2011:

Please send any items you would like included in 
next letter to Olivier Bournez DEADLINE: June 10th 2011.

Computation in Context", Sofia, Bulgaria, 27 June - 2 July:

For the latest news on CiE 2011 in Sofia, go to:

See in particular items
    1) CiE 2011 in Sofia - Call for Participation
    10) Important dates for CiE Elections and CiE 2011 in Sofia



     1) CiE 2011 in Sofia - Call for Participation
     2) Doctoral Symposium at FCT, Oslo (Norway), 26 Aug 2011
     3) PCC'11 in Ghent
     4) New deadline CfP WORKSHOP 'Quantum 
Physics meets TARK', Groningen, NL, 15 July
     5) QCRYPT 2011: Submission Server Open
     7) Workshop on Theoretical Computer Science 
(Calude's 60th Birthday), Auckland (New Zealand), 21-24 Feb 2012
     8) International conference "Algebra and mathematical logic"
     9) Final Call for Papers - Developments in Computational Models 2011
     10) Important dates for CiE Elections and CiE 2011 in Sofia
     11) Workshop on Reachability Problems 2011 
(Extended Deadline: 23 May 2011)
     12) FSTTCS 2011 : Call for papers
     13) MCM 2011: Mathematics and Computation in 
Music, Paris (France), 15-17 June 2011
     14) TQC 2011: Call for Participation (Madrid, Spain, May 24-26, 2011)


1) CiE 2011 in Sofia - Call for Participation

    CiE 2011: Computability in Europe: Models of Computation in Context

                Sofia, Bulgaria, 27 June 2011 - 2 July 2011

                           CALL FOR PARTICIPATION

                  Informal Presentation Deadline: 15 May 2011
                   Early Registration Deadline: 29 May 2011

  TUTORIALS: Jack Lutz (Ames IA, U.S.A.), Geoffrey Pullum (Edinburgh, U.K.)

  PLENARY TALKS: Scott Aaronson (Cambridge MA, U.S.A.), Christel Baier
  (Dresden, Germany), Michiel van Lambalgen (Amsterdam, The
  Netherlands), Antonio Montalban (Chicago IL, U.S.A.), Alexandra
  Shlapentokh (Greenville NC, U.S.A.), Theodore Slaman (Berkeley CA,
  U.S.A.), Janet Thornton (Cambridge, U.K.), Alasdair Urquhart (Toronto
  ON, Canada).


  * Computability in Analysis, Algebra, and Geometry (Organizers:
  Alexandra Shlapentokh, Dieter Spreen) : Ulrich Berger (Swansea), Vasco
  Brattka (Cape Town): Valentina Harizanov (Washington, DC), Russel
  Miller (New York, NY).

  * Classical Computability Theory (Organizers: Doug Cenzer, Bjorn
  Kjos-Hanssen): Mingzhong Cai (Cornell), Rachel Epstein (Harvard),
  Charles Harris (Leeds), Guohua Wu (NTU, Singapore)

  * Natural Computing (Organizers: Erzsébet Csuhaj-Varju, Ion Petre):
  Natalio Krasnogor (University of Nottingham), Martin Kutrib
  (University of Giessen), Victor Mitrana (University of Bucharest),
  Agustin Riscos-Nunez (University of Seville)

  * Relations between the physical world and formal models of
  computability (Organizers: Viv Kendon, Sonja Smets): Pablo Arrighi
  (University of Grenoble), Caslav Brukner (University of Vienna),
  Joe Fitzsimons (University of Singapore), Prakash Panangaden (McGill

  * Theory of transfinite computations (Organizers: Peter Koepke, C.T.
  Chong): Philip Welch (University of Bristol), Sy D.
  Friedman (University of Vienna), Wei Wang (Sun Yat-sen University),
  Merlin Carl (Rheinische Friedrich-Wilhelms-Universitat Bonn)

  * Computational Linguistics (Organizers: Tejaswini Deoskar, Tinko
  Tinchev): Klaus U. Schulz (Ludwig-Maximilians-Universitat Munchen)&
  Stoyan Mihov (Bulgarian Academy of Sciences), Ian Pratt-Hartmann
  (University of Manchester).

  CiE serves as an interdisciplinary forum for research in all aspects
  of computability and foundations of computer science, as well as the
  interplay of these theoretical areas with practical issues in computer
  science and with other disciplines such as biology, mathematics,
  philosophy, or physics.

  Women in Computability Workshop, 30 June 2011 :

  In 2011, we continue the programme "Women in Computability" supported by the
  journal "Annals of Pure and Applied Logic" (Elsevier).


  Alexandra Shlapentokh
  Valentina Harizanov

  The Women in Computability workshop aims to bring together women in
  Computing and Mathematical research to present and exchange their academic
  and scientific experience with young researchers. The meeting will offer
  the CIE scientific community the opportunity to encourage young students,
  especially young female researchers, to have active careers in the
  mathematical and computational sciences.

  Mentorship Programme

  The mentorship programme allows junior female researchers to meet senior
  women in their field, discuss career issues with them and get their
  support. Junior female researchers who wish to participate in this
  programme will be assigned a mentor for the duration of the conference
  with whom they will meet several times, including a dinner invitation with
  other junior researchers and the mentors.

  All questions about the conference could be send at
  cie2011 at fmi.uni-sofia.bg

  ASSOCIATION COMPUTABILITY IN EUROPE      http://www.computability.org.uk
  CiE Conference Series                         http://www.illc.uva.nl/CiE
  CiE 2011 in Sofia, Bulgaria              http://cie2011.fmi.uni-sofia.bg
  CiE 2012: Turing Centenary Conference              http://www.cie2012.eu
  CiE Membership Application Form            http://www.cs.swan.ac.uk/acie
  ALAN TURING YEAR                           http://www.turingcentenary.eu


2) Doctoral Symposium at FCT, Oslo (Norway), 26 Aug 2011

                         Call for Abstracts

                         Doctoral Symposium

                          affiliated with
  the 18th International Symposium on Fundamentals of Computation Theory

                            Oslo, NORWAY
                          August 26, 2011

  Description of the Event
  The aim of the Doctoral Symposium @ FCT'11 is to provide a platform
  for PhD students and young researchers who recently completed their
  doctoral studies, to present new results related to the foundations of
  computing theory and receive feedback on their research. Excellent
  master students working in theoretical fields of CS are also
  encouraged to contribute. Moreover, the DS wants to offer students the
  opportunity to attend talks in the main conference and to interact
  with established researchers in their fields. It is warmly encouraged
  that FCT participants attend the DS also.

  A non-exhaustive list of topics of interest is available at the FCT

  The acceptance of the presentations is based on a two page abstract
  (incl. references). The accepted abstracts will be available at the
  workshop and published together in a technical report by the
  University of Oslo. It is allowed (and encouraged) to send results
  that have been published at other conferences or journals or that are
  work in progress. Acceptance is conditioned on one of the student
  authors holding a 15-25 min (exact time slot to be decided later)
  presentation in the doctoral symposium.

  Student reductions of participation fees and scholarships are planned;
  see the registration page for updates.

  Important Dates
  Submission Deadline: Sunday, 12. June 2011
  Author Notification: Sunday, 26. June 2011
  Camera ready abstract: Friday 1. July 2011
  DS day: Friday 26. August 2011
  FCT days: 22 - 25. August 2011

  Authors are encouraged to submit a 2 page extended abstract prepared
  according to Springer's guidelines for the LNCS series, preferably
  using LaTeX with the llncs document class. Please do not modify font
  size, spacing, margins, etc of the llncs document class. The abstracts
  should be authored by young researchers (i.e., PhD students, excellent
  master students, or researchers that defended their PhD in 2010). If a
  senior researcher (like supervisor) must be listed as author, her/his
  contribution to the present abstract should be minimal and should be
  backed by a letter sent by her/him via e-mail to the organizers of the
  doctoral symposium stating this fact.

  Please submit your paper as a PDF file using the EasyChair system at
  the link below (the page will be opened for submissions on 1st June):


  Submission Guidelines
  Do NOT use runningheaders (i.e., your documentclass declaration could
  look like this: \documentclass[10pt]{llncs}).

  The submitted abstracts are encouraged to follow an outline like:

    1. Problem Description and Motivation: Describe the research
  problem you are addressing and motivate why this is relevant for FCT
    2. Brief Overview of Related Work: Briefly argument that this
  problem and your work has not been done by others before. Possibly
  discuss the gaps in the current related research literature.
    3. Proposed Solution: Give a high-level overview of your proposed
  solution to the problem identified in part 1. Describe any hypotheses
  that you have formulated. Describe the research method you are using
  or plan to use.

  Program Committee
  Sergiu Bursuc (U. of Birmingham, UK)
  Andrea Corradini (U. of Pisa, Italy)
  Clemens Grabmayer (Utrecht University, Netherlands)
  Magne Haveraaen (U. of Bergen, Norway)
  Martin Leucker (T.U. Munchen, Germany)
  Andrzej Lingas (Lund University, Sweden)
  Daniel Lokshtanov (U. of California, USA)
  Cristian Prisacariu (U. of Oslo, Norway)
  Gerardo Schneider (U. of Gothenburg, Sweden)
  Alexandra Silva (CWI, The Netherlands)
  Tomoyuki Suzuki (U. of Leicester, UK)
  Edsko de Vries (Trinity College, Ireland)

  For further advertising one may use this .txt CFP, downloadable at
  or the .pdf posters
  http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A4.pdf  (A4 format)
  http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A3.pdf  (A3 format)


3) (From Reinhard Kahle) PCC'11 in Ghent


  PCC 2011
  10th Proof, Computation and Complexity 6-7 June 2011 Ghent University,

  Aim and scope
  The aim of PCC is to stimulate research in proof theory, computation,
  and complexity, focusing on issues which combine logical and
  computational aspects. Topics may include applications of formal
  inference systems in computer science, as well as new developments in
  proof theory motivated by computer science demands.
  Specific areas of interest are (non-exhaustively listed) foundations for
  specification and programming languages, logical methods in
  specification and program development including program extraction from
  proofs, type theory, new developments in structural proof theory, and
  implicit computational complexity.

  PCC is intended to be a lively forum for presenting and discussing
  recent work. Participants who want to contribute a talk are asked to
  submit an abstract (by sending an e-mail to pelupessy at cage.ugent.be).

  The workshop is held in "Priorzaal, Het Pand", Onderbergen 1, 9000 Gent.
  This venue is an former Dominican monastery in the middle of the old
  city of Ghent.

  - Michiel De Smet, Ghent
  - Reinhard Kahle, Lisbon
  - Florian Pelupessy, Ghent
  - Andreas Weiermann, Ghent

  Registration and fees

  The workshop fee is 25 euro, payable in cash at the beginning of the
  workshop. This fee includes all coffee breaks and a business lunch on
  the first day. If you would like to register please send an e-mail to
  pelupessy at cage.ugent.be

  Past events
  - 2010 in Bern
  - 2009 in Nancy
  - 2008 in Oslo
  - 2007 in Swansea, colocated with the British Mathematical Colloquium 2007,
  - 2006 in Ilmenau,
  - 2005 in Lisbon, as affiliated Workshop to ICALP '05,
  - 2004 in Dresden, in conjunction with the Summer School on Proof Theory
  and Automated Theorem Proving,
  - 2003 in Dresden, in conjunction with the Summer School on Proof
  Theory, Computation, and Complexity, and
  - 2002 in Tübingen.


4) New deadline CfP WORKSHOP 'Quantum Physics 
meets TARK', Groningen, NL, 15 July


  WORKSHOP : Quantum Physics meets TARK
  Groningen, the Netherlands, Friday 15 July 2011

  Workshop Goal:

  This workshop, taking place in Groningen on 15 July, is a satellite of
  TARK, a bi-annual conference dedicated to ``Theoretical Aspects of
  Rationality and Knowledge", located this year in Groningen (12-14 July).
  The aim of the workshop is to explore the connections between traditional
  TARK topics and Quantum Physics. While TARK traditionally focuses on the
  theoretical aspects of rationality and knowledge, quantum mechanics and
  quantum computation focus on the fundamental link between physical
  reality and informational (knowledge-acquiring)  actions, such as
  observations and measurements. We think one can gain new insights from
  combining methods and concepts coming from these two lines of research.
  On the one hand, we are interested in how techniques from quantum physics
  can help us reason about knowledge or rational decision making. On the
  other hand, we are interested in how the logical and game-theoretical
  techniques traditionally associated with TARK  (coming from epistemic
  logic, belief revision, dynamic logic, temporal logic, probabilistic
  learning, resource-sensitive logics, epistemic game theory,
  decision-theoretic methods etc.) can be used to formalize physical
  theories, reason about their concepts or their applications, and provide
  some principled understanding of their foundations.

  Topics of interest include but are not limited to:

  classical correlations versus quantum correlations;
  classical games versus quantum games;
  classical information flow versus quantum information flow;
  logical methods for quantum computation;
  quantum logic and its relation to logics of knowledge and action;
  the use of quantum methods and concepts in decision theory, game theory
  and logic;
  game-theoretical logical semantics and foundations of quantum mechanics.

  Invited Speakers :

  Samson Abramsky (Oxford University)
  Adam Brandenburger (Stern School of Business, New York)

  Deadline CfP:  New deadline: Friday May 20, 2011.

  Please send your submission in PDF format, not exceeding 10 double-spaced
  pages (4,000 words). The PDF - files have to be uploaded online via the
  workshop's submission website:

  Authors will be notified of acceptance by Monday, May 30.
  Authors of accepted papers will be expected to upload their paper in an
  online workshop proceedings collection that we are currently setting up.
  Further details about the proceedings will be made available on the
  conference website soon.

  MAIN WEBSITE : http://www.ai.rug.nl/conf/quantumTARK/

  Program Committee:
  - Sonja Smets (University of Groningen, Chair)
  - Samson Abramsky (Oxford University)
  - Alexandru Baltag (Oxford University)
  - Adam Brandenburger (Stern School of Business, New York)
  - Jerome Busemeyer (Indiana University)
  - Pierfrancesco La Mura (Leipzig Graduate School of Management )
  - Daniel Lehmann (The Hebrew University of Jerusalem)
  - Alessandra Palmigiano (University of Amsterdam)
  - Prakash Panangaden (McGill University)
  - Alex Wilce (Susquehanna University)

  TARK Local Organizers at the University of Groningen:
  Rineke Verbrugge and Sonja Smets (chairs),
  Virginie Fiutek, Sujata Ghosh, Barteld Kooi, Ben Meijering,  Bryan Renne,
  Ben Rodenhäuser, Olivier Roy, Allard Tamminga, Bart Verheij.

  Sponsors: The Netherlands Organization for Scientific Research, The VIDI
  Project: 'Reasoning about Quantum Interactions: Logical Modelling and
  Verification of Multi-Agent Quantum Protocols' and the Royal Netherlands
  Academy of Arts and Sciences (KNAW).

  The workshop follows one day after TARK XIII,
  The Thirteenth conference on Theoretical Aspects of Rationality and

  Sonja Smets
  Rosalind Franklin Research Fellow
  University of Groningen
  Faculty of Mathematics and Natural Sciences,
  Artificial Intelligence
  Postbus 407
  9700 AK Groningen
  The Netherlands
  Faculty of Philosophy
  Oude Boteringestraat 52
  9712 GL Groningen
  The Netherlands



5) QCRYPT 2011: Submission Server Open

  Dear Colleague,

  the submission server for contributed talks is now open for

  QCRYPT 2011 - First Annual Conference on Quantum Cryptography
  September 12-16, 2011
  ETH Zurich

  Deadline for Submission of Abstracts: June 1, 2011.

  The conference features both theoretical and experimental advances in
  the field of quantum cryptography.
  For more information, please see www.qcrypt.net

  Best wishes,

  Matthias Christandl.

  Matthias Christandl
  Institute for Theoretical Physics
  ETH Zurich



  ***  T H E   8 T H   P A N H E L L E N I C   L 
O G I C   S Y M P O S I U M  ***
  ***                      J u l y   4  -  8 
,   2 0 1 1                      ***
  ***                      I o a n n i n a,  G r 
e e c e                      ***
www.cs.uoi.gr/~pls8/                          ***



  The Panhellenic Logic Symposium, a biennial scientific event established in
  1997, aims to promote interaction and 
cross-fertilization among different areas
  of logic. Originally conceived as a way of 
bringing together the many logicians
  of Hellenic descent throughout the world, it 
has evolved into an international
  forum for the communication of state-of-the-art advances in logic. The
  symposium is open to researchers worldwide who 
work in logic broadly conceived.
  The Eighth Panhellenic Logic Symposium will be hosted by the Department of
  Computer Science at the University of Ioannina.


  The scientific program of the symposium will consist of one-hour long invited
  talks, three-hour long tutorials, and twenty-five-minute presentations of
  accepted contributed papers.  There will also be special opportunities for
  students to give short talks, and receive comments on work in progress.


  Graduate students are invited to submit short abstracts on work in progress
  but not yet ready for a regular contributed talk. Those accepted will have
  an opportunity to present their subject in a special student session, and to
  receive comments and suggestions from mentors including some of the invited

  Interested students should submit to
  by  May 29, 2011, an abstract of no more than one page in .pdf form.

  If possible, each submitted abstract should be classified in one of the
  following areas (in alphabetical order):

  - Algebraic and Categorical Methods in Logic
  - Computability Theory
  - History and Philosophy of Logic
  - Logic in Computer Science
  - Model Theory
  - Nonclassical and Modal Logics
  - Proof Theory
  - Set Theory


  - Student Abstract Submission Deadline: May 29, 2011
  - Acceptance Notification for Student Abstracts: June 10, 2011
  - Conference Dates: July 4-8, 2011


  - Jeremy Avigad (Carnegie Mellon, USA)
  - Dale Miller (INRIA, France)
  - Simon Thomas (Rutgers, USA)


  - George Barmpalias (University of Amsterdam, Netherlands)
  - Ozlem Beyarslan (Bogazici University, Turkey)
  - Michael Rathjen (University of Leeds, UK)
  - Nicole Schweikardt (Goethe University, Germany)
  - Athanassios Tzouvaras (University of Thessaloniki, Greece)


  - Ayse Berkman (Middle East Technical University)
  - Costas Dimitracopoulos (University of Athens)
  - Kostas Hatzikiriakou (University of Thessaly)
  - Antonis Kakas (University of Cyprus)
  - Panagis Karazeris (University of Patras)
  - Phokion Kolaitis (University of California, Santa Cruz
                     and IBM Research-Almaden)
  - George Koletsos (National Technical University of Athens )
  - Joan Moschovakis (Occidental College (retired), Chair of SC)
  - Christos Nomikos (University of Ioannina)
  - Itay Neeman (University of California, Los Angeles)
  - Thanases Pheidas (University of Crete)
  - Alexandra Soskova (Sofia University)
  - Constantine Tsinakis (Vanderbilt University)
  - Stathis Zachos (National Technical University of Athens )


  - Manolis Gergatsoulis (Ionian University)
  - Spyros Kontogiannis (University of Ioannina)
  - Costas Koutras (University of Peloponnese)
  - Christos Nomikos (University of Ioannina, chair of the OC)
  - Panos Rondogiannis (University of Athens)




  Joan Moschovakis (Chair of the Scientific Committee)

  e-mail:  joan at math.ucla.edu

  Christos Nomikos (Chair of the Organizing Committee)

  address: University of Ioannina
           Department of Computer Science
           P.O. Box 1186
           45110,  Ioannina

  tel:     +30 26510 08815

  fax:     +30 26510 08895

  e-mail:  cnomikos at cs.uoi.gr
           pls8 at zeus.cs.uoi.gr


7) Workshop on Theoretical Computer Science 
(Calude's 60th Birthday), Auckland (New Zealand), 21-24 Feb 2012

  International Workshop on Theoretical Computer Science
  Dedicated to Prof. Cristian S. Calude's 60th Birthday

  The Workshop will take place between February 21 and February 24 in 2012 in
  Auckland, New Zealand. A volume titled "Computation, Physics and Beyond",
  based on the WTCS2012, will be published in the LNCS Festschrifts Series of
  Springer. The volume will contain contributions from invited speakers and
  regular papers that present either expository/survey results or original
  research in the following areas (in which Cristian Calude has had
  significant contributions or interests):

     Algorithmic information theory
     Automata and formal languages
     Automata, logic, and applications
     Computing and natural sciences
     Computability and applications
     Philosophy of computation
     Physics and computation
     Tree automata and applications
     Unconventional models of computation


  Contributing authors are invited to submit a pdf file (at most 12 pages in
  length) to one of the editorial members listed below. Accepting
  contributions should be presented in Latex using Springer llncs style. All
  submissions will be reviewed by at least two independent referees.

  Submission deadline: September 1, 2011
  Notification date: October 15, 2011
  Final version due: October 31, 2011

  Organizing committee
  M.J. Dinneen, G. Dobbie, R. Doran, B. Khoussainov and A. Nies.

  Program committee
  B. Cooper, F. Costa, M.J. Dinneen, P. Hertling, B. Khoussainov (chair), F.
  Kroon, Y. Matiyasevich, A. Nies, Gh. Păun, G. Rozenberg, K. Salomaa, L.
  Staiger, A. Shen, F. Stephan and M. Zimand.

  Editorial committee
  M.J. Dinneen, B. Khoussainov and A. Nies


8) International conference "Algebra and mathematical logic"

  International Conference "Algebra and Mathematical Logic",
  dedicated to the 100-th anniversary of V.V. Morozov.
  Kazan, September 25-30, 2011


  Kazan Federal University, Sobolev Institute of Mathematics  (Novosibirsk)
  and Tatarstan Republic Academy of Science organize an International
  conference  dedicated to the 100-th birthday of  Professor V.V. Morozov

  The meeting will be held in Kazan (Russia), September 25-30, 2011.  The
  main topics of the conference include (but are not limited to) Lie
  algebras, group theory, ring theory,  algebraic geometry, universal
  algebras, model theory, mathematical logic, computability theory,
  algebraic and  logical methods in computer science.

  The Program Committee of the conference consists of academician Yu. L.
  Ershov (Chair),  K. Ambos-Spies (Heidelberg, Germany), M.M. Arslanov
  (co-chair, chair of the Organizing Committee). V.A. Artamonov (Moscow),
  S.A. Badaev (Almaaty, Kazahstan), V.V. Bludov (Irkutsk),  L.A.
  Bokut (Novosibirsk),  S.B. Cooper (Leeds, UK),  S.S. Goncharov
  (Novosibirsk), A.A. Gvaramiya (Suhumi), I. Sh. Kalimullin (Kazan), M.I.
  Kuznetsov (Nizhny Novgorod),V.N. Latyshev (Moscow), S. Lempp (Madison,
  USA), V.M. Levchuk (Krasnojarsk), A.A. Makhnev (Ekaterinburg), V.D.
  Mazurov (Novosibirsk), A.V. Mikhalev (Moscow), V.L. Popov (Moscow), B.I.
  Plotkin (Jerusalem, Israel), Yu.M. Rjabuhin (Kishinev, Moldova), S.M.
  Skryabin (Kazan),  A.A. Stepanova (Vladivostok),  I.P. Shestakov (Sao
  Paulo, Brazil),  K.-P. Shum (Hong Kong),  E.B. Vinberg  (Moscow), M.V.
  Volkov (Ekaterinburg), V.E. Voskresenskii (Samara), S.V. Vostokov (St.
  Petersburg), A.V. Yakovlev (St. Petersburg), M.M. Yamaleev, the secretary
  of the conference.

  The invited plenary speakers of  the conference are S.A. Badaev (Almaty,
  Kazakhstan), M.V. Bondarko (St. Petersburg, Russia), V.V. Bludov (Irkutsk,
  Russia), Yu.L. Ershov (Novosibirsk, Russia), W.B. Guo (Hefei, China), S.S.
  Goncharov (Novosibirsk, Russia), N.A. Koreshkov (Kazan, Russia), T.M.
  Kraling (Heidelberg, Germany), S. Lempp (Madison, USA), V.M. Levchuk
  (Krasnojarsk, Russia), A.A. Makhnev (Ekaterinburg, Russia), V.D. Mazurov
  (Novosibirsk, Russia), A.N. Parshin (Moscow, Russia), V.L. Popov (Moscow,
  Russia), V.G. Puzarenko (Novosibirsk, Russia), M.V. Semenova (Novosibirsk,
  Russia), W.J. Shi (Chongqing, China), K.-P. Shum (Hong Kong, China), S.M.
  Skryabin (Kazan, Russia), A.I. Stukachev (Novosibirsk, Russia), E.P.
  Vdovin (Novosibirsk, Russia), E.B. Vinberg (Moscow, Russia), S.V. Vostokov
  (St. Petersburg, Russia), G. Wu (Singapore, Singapore), Y. Zhang
  (Guangzhou, China), I.B. Zhukov (St. Petersburg, Russia)

  The scientific program of the conference includes one-hour invited
  lectures, and contributed talks. Special lectures will be dedicated to the
  life and work of V.V. Morozov. The following sections are planned: Group
  Ring theory and Module theory
  Field theory
  Lie algebras, Representation theory and Invariant theory
  Universal algebra and Model theory
  Computability theory and computer algebra

  Satellite events:
  Workshop "Modern Problems of Albebra and Mathematical Logic" for young
  researchers will be held accompanying the conference (September 22 -
  October 3, http://www.aiml2011.ksu.ru (in Russian only)).

  Travel awards:
  The conference is sponsored by the Association for Symbolic Logic. Student
  members of the ASL can apply for travel funding. The deadline for
  applications is May 25, 2011. More  information can be found at the
  conference webpage   (see Travel awards).

  The official site of the conference is:  http://www.vvmorozov2011.ksu.ru

  The Registration:
  For registration it's enough to fill the registration form and send it to
  the organizers of the conference  by e-mail vvmorozov2011 at ksu.ru.

  The registration fee is 50 Euro for participants outside CIS countries. It
  partially covers expenses of the conference and includes the conference
  proceedings, participant bag, cultural programm, welcome cocktail,
  coffee/tea breaks. The registration fee should be paid in cash (Euro or
  equivalent to USD) on arrival during the registration.

  Abstracts should be sent with the registration form or later. Accepted
  abstracts will be published in the digit and hard versions of proceedings.

  The registration form and the rules for abstracts can be found at the
  conference webpage as well as in the full text of the second information
  letter (see the attached file).

  All your questions you may address to the secretary of the conference -
  Mars Yamaleev,
  by e-mail:  vvmorozov2011 at ksu.ru
  or by phone: (843) 233-70-39, (843) 233-77-14

  Important dates:
    Deadline for registration and submissions of abstracts: July 1, 2011
    Notification to authors: August 1, 2011
    Conference: September 25-30, 2011

  Please spread this information among your colleagues and students.

  The Organizing Committee


9) (From Femke van Raamskdonk) Final Call for 
Papers - Developments in Computational Models 2011

                        Final Call for Papers

                              DCM 2011
                   7th International Workshop on
                Developments in Computational Models

                            July 3, 2011
                        Zurich, Switzerland

      A satellite event of ICALP 2011 - http://icalp11.inf.ethz.ch/

                Extended Deadline for submissions: 30 May, 2011

  DCM 2011 is the seventh in a series of international workshops
  focusing on new computational models. It aims to bring together
  researchers who are currently developing new computational models
  or new features of a traditional one. The goal of DCM is to foster
  interaction, to provide a forum for presenting new ideas and work
  in progress, and to enable newcomers to learn about current
  activities in this area.
  DCM 2011 will be a one-day satellite event of ICALP 2011
  in Zurich, Switzerland.

  Topics of interest include all abstract models of computation
  and their properties, and their applications to the development
  of programming languages and systems:

  - quantum computation, including implementations and
  formal methods in quantum protocols;
  - probabilistic computation and verification in modeling situations;
  - chemical, biological and bio-inspired computation, including
  spatial models, self-assembly, growth models;
  - general concurrent models including the treatment of mobility,
  trust, and security;
  - comparisons of different models of computations;
  - information-theoretic ideas in computing.

  Paper Submission:      May  30, 2011
  Notification:          June 15, 2011
  Workshop               July 03, 2011

  Please submit a paper via the conference
  EasyChair submission page:


  Submissions should be at most 12 pages, in PDF format.
  Please use the EPTCS macro package and follow the
  instructions of EPTCS:


  A submission may contain an appendix, but reading the
  appendix should should not be necessary to assess the
  merits of a submission.

  Accepted contributions will appear in EPTCS
  (Electronic Proceedings in Theoretical Computer Science).

  After the workshop, quality permitting full versions of selected
  papers will be invited for a special issue in an internationally
  leading journal.

  INVITED SPEAKER: Matthias Christandl, Swiss Federal Institute of
  Technology, Switzerland

  Erika Andersson, Heriot-Watt University, UK
  Nachum Dershowitz, Tel Aviv University, Israel
  Eleni Diamanti, CNRS & Telecom ParisTech, France
  Lucas Dixon, Google, USA
  Elham Kashefi, University of Edinburgh, UK (Co-chair)
  Delia Kesner, CNRS & Universite Paris Diderot, France
  Helene Kirchner, INRIA, France
  Heinz Koeppl, ETH Zurich, Switzerland
  Jean Krivine, CNRS & Universite Paris Diderot, France (Co-chair)
  Michael Mislove, Tulane University, USA
  Mio Murao, University of Tokyo, Japan
  Vincent van Oostrom, Utrecht University, The Netherlands
  Femke van Raamsdonk, VU University Amsterdam, The Netherlands (Co-chair)
  Paul Ruet, CNRS & Institut de Mathematiques de Luminy, France
  Aaron Stump, University of Iowa, USA

  Further information:  Elham Kashefi <ekashefi at inf.ed.ac.uk>
                       Jean Krivine <jkrivine at pps.jussieu.fr>
                       Femke van Raamsdonk <femke at cs.vu.nl>


10) Important dates for CiE Elections and CiE 2011 in Sofia

  To all CiE members:

  Important dates for the 2011 CiE Elections and CiE 2011 in Sofia -

  (1) The deadline for submission of Informal Presentations at CiE 2011 is
  Sunday 15th May, 2011. See:


  (2) Early registration for CiE 2011 ends on Sunday 29th May, 2011. To
  register, please go to:


  (3) The deadline for nominations to the Association CiE Board is Monday
  6th June, 2011.

  The President and one other CiE Board member will be elected at the time
  of the CiE AGM on July 1st.

  For current Board membership see:


  Any member of CiE can be nominated for election to the Board. A valid
  nomination from the membership requires a nomination by 10 CiE members.
  Each nomination should state whether it is a nomination for President or a
  nomination to the Board, and should be sent to: s.b.cooper at leeds.ac.uk

  Best wishes

  Barry Cooper
  for Association CiE

  ASSOCIATION COMPUTABILITY IN EUROPE      http://www.computability.org.uk
  CiE Conference Series                         http://www.illc.uva.nl/CiE
  CiE 2011 in Sofia, Bulgaria              http://cie2011.fmi.uni-sofia.bg
  CiE 2012: Turing Centenary Conference              http://www.cie2012.eu
  CiE Membership Application Form            http://www.cs.swan.ac.uk/acie
  ALAN TURING YEAR                           http://www.turingcentenary.eu
  AlanTuringYear on Twitter              http://twitter.com/AlanTuringYear


11) Workshop on Reachability Problems 2011 (Extended Deadline: 23 May 2011)

          5th Workshop on Reachability Problems (RP'11)
                  (September 28-30, 2011, Genova, Italy)

             EXTENDED Deadline for submissions: 23 May, 2011,
                    Springer Verlag LNCS Proceedings


  The 5th Workshop on Reachability Problems will be hosted by
  DISI (Dip. di Informatica e Scienze dell'Informazione),
  Universita' di Genova, Italy.

  The Reachability Workshop is specifically aimed at gathering
  together scholars from diverse disciplines and backgrounds
  interested in reachability problems that appear in
  - Algebraic structures
  - Computational models
  - Hybrid systems
  - Logic
  - Verification

  Invited Speakers:

  - Krishnendu Chatterjee, IST Austria
  - Bruno Courcelle, LABRI, Bordeaux
  - Joost-Pieter Katoen, RWTH, Aachen
  - Jean-Francois Raskin, Univerite' Libre de Bruxelles

  Papers presenting original contributions related to
  reachability problems in different computational
  models and systems are being sought.
  Topics of interest include (but are not limited to):
  Reachability for infinite state systems, rewriting
  systems; Reachability analysis in counter/ timed/
  cellular/ communicating automata; Petri-Nets;
  computational aspects of semigroups, groups and
  rings; Reachability in dynamical and hybrid systems;
  frontiers between decidable and undecidable
  reachability problems; complexity and decidability aspects;
  predictability in iterative maps and new computational paradigms

  Easychair submissions are open:

  Authors are invited to submit a draft of a full paper with
  at most 12 pages (in LaTeX, formatted according to LNCS guidelines)
  via the conference web page.
  Proofs omitted due to space constraints must be put into an
  appendix to be read by the program committee members at their discretion.
  Submissions deviating from these guidelines risk rejection.
  Electronic submissions should be formatted
  in postscript or pdf. Simultaneous submission to other
  conferences or workshops with published proceedings is not allowed.

  Important Dates

  Submission deadline: 10 May, 2011
  Notification: 28 June, 2011
  Final version: 5 July, 2011
  Conference: 28-30 September, 2011


  The Conference Proceedings will be published
  as the volume of the Springer Verlag LNCS
  (Lecture Notes in Computer Science) series and
  distributed at the Conference. We plan also to publish
  selected papers in a special issue of a high quality journal
  following the regular referee procedure.

  Program Commitee:

  Parosh Aziz Abdulla , Uppsala
  Davide Ancona , Genova
  Bernard Boigelot , Liege
  Olivier Bournez, Palaiseau
  Cristian S. Calude , Auckland
  Giorgio Delzanno , Genova
  Stephane Demri , Cachan
  Javier Esparza , München
  Laurent Fribourg , Cachan
  Vesa Halava , Turku
  Juhani Karhumäki, Turku
  Antonin Kucera , Brno
  Alexander Kurz , Leicester
  Jerome Leroux , Bordeaux
  Alexei Lisitsa , Liverpool
  Igor Potapov , Liverpool
  Arnaud Sangnier, Paris
  Hsu-Chun Yen , Taipei
  Gianluigi Zavattaro , Bologna

  Organizing Committee:

  - Giorgio Delzanno, Genova
  - Igor Potapov, Liverpool


  E-mail:delzanno at disi.unige.it,
  potapov at liverpool.ac.uk

12) FSTTCS 2011 : Call for papers


     Foundations of Software Technology and
   Theoretical Computer Science (FSTTCS 2011)

   December 12-14, 2011    IIT Bombay, Mumbai

  The Indian Association for Research in Computing
  Science, announces the 31st  Annual FSTTCS Conference
  in IIT Bombay, Mumbai.  The FSTTCS conference is a forum
  for presenting original results in foundational aspects
  of Computer Science and Software Technology.

  Invited speakers at the 31st FSTTCS include
  * Susanne Albers (Humboldt-Universitat zu Berlin, Germany),
  * Phokion G. Kolaitis (Univ. of California, Santa Cruz, USA),
  * John C. Mitchell (Stanford University, USA),
  * Madhu Sudan (MSR New England and MIT, USA),
  * Moshe Y. Vardi (Rice University, USA), and
  * Umesh V. Vazirani (Univ. of California, Berkeley, USA)

  Authors are invited to submit papers presenting original
  unpublished research in any area of Theoretical Computer
  Science or Foundational aspects of Software Technology.
  Submissions will be electronic, via EasyChair (please see
  Submissions are restricted to 12 pages using the FSTTCS
  style file (please see www.fsttcs.org/fsttcs.cls). Proofs
  omitted due to space constraints must be put into an
  appendix to be read by reviewers at their discretion.
  Concurrent submissions to other conferences/journals/symposia
  are not allowed until accept/reject notification (or until
  submission of the final version, if accepted).  For further
  details about submissions, please visit www.fsttcs.org

  Representative areas include, but are not limited to:
  * Algorithms, including randomized and approximation
   algorithms, distributed algorithms, geometry, online and
   streaming algorithms, fixed-parameter algorithms
  * Automata and Formal Languages
  * Combinatorial Optimization
  * Computational Complexity, including circuits,
   communication, derandomization, PCPs, proof complexity,
   structural complexity
  * Concurrent, timed and hybrid systems
  * Cryptography and security
  * Logic in Computer Science, including finite model theory,
   modal and temporal logics, specification and verification
  * Programming languages, including semantics, types,
   program analysis and correctness

  Accepted papers will be published as the proceedings of the
  conference in the Leibniz International Proceedings in
  Informatics (LIPIcs) series as a free, open, electronic archive
  with access to all. For an accepted paper to be included in
  the proceedings, at least one of the authors must commit to
  presenting the paper at the conference. It is likely that there
  will be a couple of workshops preceding FSTTCS on
  some contemporary areas of research.  Details of workshops will
  be announced on the conference web page (www.fsttcs.org) in
  September 2011.


  Submission server opens: June 1, 2011
  Submission deadline:     July 6, 2011
  Notification to authors: Sept 5, 2011
  Final version due:       Oct  5, 2011
  Conference:           Dec 12-14, 2011


13) MCM 2011: Mathematics and Computation in 
Music, Paris (France), 15-17 June 2011

  IRCAM, Paris, June 15-17

  The 3rd International Conference on Mathematics 
and Computation in Music (MCM 2011) will take 
place on June 15-17, 2011 at IRCAM, the Institute 
for Research and Coordination of Acoustics and 
Music in Paris, France. MCM 2011 will be 
integrated into IRCAM?s most important artistic 
event of the season, the Agora Music Festival, 
which is running from June 8 to 18, 2011. As in 
the case of the first two conferences (which took 
place in 2007 in Berlin and in 2009 at Yale 
University), the third Mathematics and 
Computation in Music Conference aims to provide a 
multi-disciplinary platform dedicated to the 
communication and exchange of ideas amongst 
researchers involved in mathematics, computer 
science, music theory, composition, musicology, 
or other related disciplines. The Keynote 
speakers will be the renowned composer and 
conductor Pierre Boulez, founder and honorary 
director of IRCAM, Fields medalist Alain Connes, 
philosopher Alain Badiou and computer-scientist 
Stephen Wolfram. The conference will be 
accompanied by a series of conference-related 
artistic events (concerts, exhibitions, 
workshops, ?) organized in collaboration with 
some of the most important cultural and 
educational centers of France, such as the Centre Pompidou and Universcience.

  MCM2011 is organized under the aegis of the 
SMCM (Society for Mathematics and Computation in 
Music), SMF (French Mathematical Society), in 
partnership with the Centre Pompidou and the 
Palais de la découverte (a Universcience venue), 
in collaboration with CiE (Computability in 
Europe), ESMA (European Society for Mathematics 
and Arts) and with the support of the French 
Ministry of Culture and Communication, the CNRS 
(French National Center for Scientific Research), 
UPMC, AFIM (French Association for Computer 
Music) and the SFAM (French Society of Music Analysis).

  The detailed program of the conference is available at:

  Online MCM 2011 Registration (special price through May 15):

  We look forward to seeing you in Paris!

  MCM 2011 Organization Committee

  Carlos Agon, Ircam/CNRS
  Emmanuel Amiot, CPGE, Perpignan
  Moreno Andreatta, Ircam/CNRS
  Gérard Assayag, Ircam/CNRS
  Sylvie Benoit, Ircam/CNRS
  Jean Bresson, Ircam/CNRS

  mcm2011-contact at ircam.fr

  Moreno Andreatta
  Music Representation Team
  1, place I. Stravinsky
  F-75004 Paris
  email: Moreno.Andreatta at ircam.fr
  Tél: +33 (0)1 44781649
  Fax: +33 (0)1 44 78 15 40
  Vice-President of the Society of Mathematics and Computation in Music:
  Director of Springer CMS Series


14) TQC 2011: Call for Participation (Madrid, Spain, May 24-26, 2011)


  The 6th Conference on Theory of Quantum Computation,
            Communication, and Cryptography
                  ---- TQC 2011 ----

           Universidad Complutense de Madrid
     Prof. Botella Lecture Room, Faculty of Medicine
          Ciudad Universitaria - Madrid, Spain
                   24 - 26 May 2011

  <> Invited Speakers:

       * Hector Bombin (Perimeter Institute)
       * Hans Briegel (Innsbruck)
       * Nicolas Gisin (Geneva)
       * Mio Murao (Tokyo)
       * Tobias Osborne (Hannover)
       * Umesh Vazirani (Berkeley)

  <> Accepted Talks:

       * Approximating the Turaev-Viro invariant of mapping tori is
         complete for one clean qubit (Gorjan Alagic and Stephen Jordan)
       * Telescopic relative entropy (Koenraad Audenaert)
       * Large violation of Bell inequalities using both particle and wave
         measurements (Daniel Cavalcanti, Nicolas Brunner, Paul
         Skrzypczyk, Alejo Salles and Valerio Scarani)
       * The locking-decoding frontier for generic dynamics (Frederic
         Dupuis, Jan Florjanczyk, Patrick Hayden and Debbie Leung)
       * Unconditionally-secure and reusable public-key authentication
         (Lawrence Ioannou and Michele Mosca)
       * Long distance quantum key distribution with continuous variables
         (Anthony Leverrier and Philippe Grangier)
       * Local unitary group stabilizers and entanglement for
         multiqubit symmetric states (David Lyons, Scott Walck and Curt
       * Quantum discord in quantum information theory - from strong sub-
         additivity to the Mother protocol (Vaibhav Madhok and Animesh
       * A generalization of Noether's theorem and the information-
         theoretic approach to the study of symmetric dynamics
         (Iman Marvian and Robert Spekkens)
       * Secure device-independent quantum key distribution with causally
         independent measurement devices (Lluis Masanes, Stefano
         Pironio and Antonio Acin)
       * Self-testing graph states (Matthew Mckague)
       * Multi-query quantum sums (David Meyer and James Pommersheim)
       * Which graph states are useful for quantum information processing?
         (Mehdi Mhalla, Mio Murao, Simon Perdrix, Masato Someya and Peter
          S. Turner)
       * Span-program-based quantum algorithm for evaluating unbalanced
         formulas (Ben Reichardt)
       * Mistrustful quantum cryptography in a device-independent setting
         (Jonathan Silman, Andre Chailloux, Nati Aharon, Iordanis
          Kerenidis, Stefano Pironio and Serge Massar)
       * Towards a tight finite key analysis for BB84 (Marco Tomamichel,
         Charles Ci Wen Lim, Renato Renner and Nicolas Gisin)
       * Bitwise quantum min-entropy sampling and new lower bounds for
         random access codes (Juerg Wullschleger)

  <> Accepted Posters:


  <> Program Committee:

       Mohammad Amin (D-Wave)
       Dave Bacon (Washington; Co-chair)
       Dagmar Bruss (Duesseldorf)
       Andrew Childs (IQC)
       Richard Cleve (IQC)
       Steve Flammia (Caltech)
       Markus Grassl (CQT Singapore)
       Peter Hoyer (Calgary)
       Kazuo Iwama (Kyoto)
       Elham Kashefi (Edinburgh)
       Debbie Leung (IQC)
       Hoi-Kwong Lo (Toronto)
       Chiara Macchiavello (Pavia)
       Vicente Martin-Ayuso (UPM)
       Miguel Martin-Delgado (UCM)
       Dmitri Maslov (IQC/NSF)
       Michele Mosca (IQC)
       Kae Nemoto (NII Tokyo)
       Martin Roetteler (NEC Princeton; Chair)
       Miklos Santha (Paris/CQT Singapore)
       Pranab Sen (Tata Institute)
       Simone Severini (London)
       Jean-Pierre Tillich (INRIA)
       Andreas Winter (Bristol/CQT Singapore)

  <> Contact:

      quitemad.gestion at gmail.com

More information about the FOM mailing list