[FOM] CiE Newsletter No.65, January 11th 2013.

Olivier Bournez martin at eipye.com
Fri Jan 11 13:07:18 EST 2013


CiE Newsletter No.65, January 11th 2013.


Very happy new year 2013 to all !!!


Please send any items you would like included in 
next letter to Olivier Bournez (bournez at lix.polytechnique.fr)
DEADLINE: February 10th 2013.

___________________________________________________________________________


** COMPUTABILITY - The Journal of the Association 
CiE. Now accepting submissions.
http://www.computability.de/journal/

** CIE 2013 http://cie2013.disco.unimib.it/
Computability in Europe 2013: The Nature of 
Computation. Milano. 1st-5th July 2013.
See also item 11 and attached pdf.

___________________________________________________________________________

CONTENTS

         •       1) NORDIC LOGIC SPRING '2013
         •       2) CSL 2013 Torino, September 2-5 2013
         •       3) [STACS 2013] Call for Participation
         •       4) TAMC 2013 The 10th Annual 
Conference on Theory and Applications of Models of Computation
         •       5) MCU 2013: Machines, 
Computations and Universality, Zuerich (Switzerland), 9-12 Sep 2013
         •       6) WoLLIC 2013: Logic, Language, 
Information and Computation, Darmstadt (Germany), 20-23 Aug 2013
         •       7) ICALP 2013: 2nd Call for Papers
         •       8) DCFS 2013: First Call of Papers
         •       9) Ackermann Award 2013 - Call for Nominations
         •       10) UCNC 2013: 2nd call for papers
         •       11) CiE 2013 Call For Papers
         •       12) TLCA 2013 Last Call for Papers
         •       13) Permanent Academic Positions 
(Computational Logic/Functional Programming) in Dundee Deadline 23 January


___________________________________________________________________________

1) NORDIC LOGIC SPRING '2013
NORDIC LOGIC SPRING '2013

Nordic Spring School in Logic, http://scandinavianlogic.org/school
May 27-31, 2013, Sophus Lie Conference Center, Nordfjordeid, Norway

The first Nordic Spring School in Logic is 
organized under the auspices of the Scandinavian 
Logic Society and is supported by the Department 
of Mathematics of the University of Oslo.

The Sophus Lie Conference Center 
http://www.mn.uio.no/math/english/about/collaboration/nordfjordeid/ 
is located with a view to one of the famous 
fjords of Norway, in an area particularly 
attractive with its nordic exotic nature and 
bright nights at that time of the year. 
Nordfjordeid can be reached by plane from Oslo, 
Bergen, or Trondheim to Sandane airport, or by 
coach from each of these cities.

COURSE PROGRAMME:
------------------------------
The school programme will comprise the following 
short courses on a variety of important topics in 
mathematical, computational, applied and 
philosophical logic, given by leading experts in their fields:

- Alexandru Baltag and Sonja Smets (University of 
Amsterdam): Dynamic logics for interactive belief revision
- Dag Normann (University of Oslo): The semantics of higher-order algorithms
- Erich Graedel (RWTH Aachen): Logics for dependence and independence
- Joan Bagaria (ICREA, University of Barcelona): Set theory
- Katrin Tent (University of Muenster): Model theory
- Kim Larsen (Aalborg University): Logic and formal verification
- Michael Rathjen (University of Leeds): Proof 
theory: From arithmetic to set theory
- Nina Gierasimczuk (University of Amsterdam) and 
Jakub Szymanik (University of Groningen): Logic, computability and cognition
- Thierry Coquand (University of Gothenburg): 
Type theory and univalent foundations
- Wolfgang Thomas (RWTH Aachen): Logic, automata and games
- Øystein Linnebo (University of Oslo and 
Birkbeck, University of London): Philosophy of 
logic: The problem of absolute generality

The program will be divided into two parallel 
streams, one mainly on mathematical logic and the 
other mainly on computational, applied and 
philosophical logic. The courses will target 
mainly PhD students, but will also be of interest 
for young (and not so young) researchers in logic 
and its applications. Some of the courses will be 
accessible to advanced master students, too. 
Besides the series of courses, the school program 
will also include a half-day excursion to the 
famous glacier Briksdalsbreen, on Wednesday, May 29.

REGISTRATION FOR PARTICIPATION
------------------------------
The registration for the school will commence on 
January 15, 2013. The number of participants will 
be limited, and requests for participations will 
be accepted in the order of registration until the limit is reached.
However, 50 of the available places will be 
reserved for master and PhD students until the early registration deadline.

REGISTRATION DEADLINES:  Early registration: 
MARCH 15, 2013. Late registration: MAY 1, 2013

ACCOMMODATION AND REGISTRATION FEES:
The students accommodation will be provided in 
the conference center, mostly in double rooms. 
These are located in 9 pavilions with 4 double + 
2 single rooms each.  Each pavilion has common 
kitchen and bathroom facilities. The cost of 
accommodation in a double room with full board in 
the center, from (arrival) Sunday, March 26 until 
(latest departure on) Saturday, June 1 is NOK 
3490. There are also alternative possibilities 
for accommodation in hotels or guest houses nearby.

The registration fees, covering the scientific 
programme, conference facilities, refreshments, 
and the excursion, are as follows:
Early Registration:  Student fees: NOK 1500. Regular fees:  NOK 2000
Late Registration: Student fees: NOK 2000. Regular fees:  NOK 2500

Instructions on the registration procedure will 
be posted on the school website: http://scandinavianlogic.org/school

SCHOOL ORGANIZATION
------------------------------
Organizing Committee:

Dag Normann (University of Oslo, Norway): Chair
Elisabeth H. Seland (University of Oslo, Norway): Administrative support
Fredrik Engström (University of Gothenburg, Sweden): Website
Valentin Goranko (Technical University of Denmark)

Scientific Committee:

Benedikt Loewe (Universities of Amsterdam and Hamburg)
Erik Palmgren (University of Stockholm, Sweden)
Juliette Kennedy  (University of Helsinki, Finland)
Marc Bezem (University of Bergen, Norway)
Patrick Blackburn (University of Roskilde, Denmark)
Valentin Goranko (Technical University of Denmark), Chair


CONTACT AND ENQUIRIES
Enquiries on registration and logistics: nord-logic at math.uio.no
Enquiries on the scientific programme: NordicLogic at gmail.com

___________________________________________________________________________

2) CSL 2013 Torino, September 2-5 2013

CSL 2013
Torino, September 2-5 2013

http://csl13.di.unito.it/


PRELIMINARY ANNOUNCEMENT
_______________________________________________________________________________________________

AIM AND SCOPE
Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose research
activities involve logic, as well as for logicians working on
issues significant for computer science.

LOCATION
The 22nd EACSL Annual Conferences on Computer Science Logic will be held
at Museo di Scienze Naturali in Torino from
Monday 2nd through Thursday 5th of September 2013.

LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE)
automated deduction and interactive theorem proving, constructive
mathematics and type theory, equational logic and term rewriting,
automata and games, game semantics, modal and temporal logic, model
checking, decision procedures, logical aspects of computational
complexity, computational proof theory, bounded arithmetic and
propositional proof complexity, logic programming and constraints, lambda
calculus and combinatory logic, domain theory, categorical logic and
topological semantics, database theory, specification, extraction and
transformation of programs, logical aspects of quantum computing,
logical foundations of programming paradigms, verification and program
analysis, linear logic,
higher-order logic, non-monotonic reasoning.
IMPORTANT DATES
Abstract submission: April, 1st 2013
Paper Submission: April, 8th 2013
Paper Notification: June, 10th 2013
Paper final version: July, 1st 2013
Conference: September, 2nd --- 5th 2013

SUBMISSION
Authors are invited to submit papers of not more than 15 pages in LIPIcs
style presenting work not previously published.
Papers are to be submitted through Easychair. Submitted papers must be
in English and must provide sufficient detail to allow the PC to assess
the merits of the paper. Full proofs may appear in a technical appendix
which will be read at the reviewers' discretion. Authors are strongly
encouraged to include a well written introduction which is directed at
all members
of the program committee.
The submission is in two stages. Abstract submissions are due before
April 1st, 2013. Full paper submissions must be done before April 8th,
2013.
Papers must not be submitted concurrently to another conference with
refereed proceedings. The PC chair should be informed of closely related
work submitted to a conference or a journal by March 24th, 2013. Papers
authored or co-authored by members of the Programme Committee are not
allowed.

SATELLITE EVENTS
The 14th International Workshop on Logic and Computational Complexity
(LCC'13) will be held on 6th of September 2013 as a satellite event of
CSL'13.
An international summer school on ?Linear logic and related topics? will
be held from 28th through 31st of August 2013 as a satellite event of
CSL'13.
Further details will appear on this page as soon as possible.
PROGRAM COMMITTEE
Zena Ariola (University of Oregon)
Arnon Avron (Tel-Aviv University)
Roberto Bagnara (University of Parma, and BUGSENG srl)
Christel Baier (Technical University of Dresden)
Marc Bezem (University of Bergen)
Paola Bruscoli (University of Bath, Computer Science Department)
Agata Ciabattoni (TU Wien)
Thierry Coquand (Chalmers University)
Ugo Dal Lago (Università di Bologna)
Valeria De Paiva (Nuance Communications)
Reinhard Kahle (CENTRIA and DM, UNL, Portugal)
Stephan Kreutzer (Technical University Berlin)
Olivier Laurent (CNRS - ENS Lyon)
Carsten Lutz (Universität Bremen)
Jean-Yves Marion (Université de Lorraine, LORIA)
Damian Niwinski (Warsaw University)
Frank Pfenning (Carnegie Mellon University)
Elaine Pimentel (UFMG)
Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS))
Simona Ronchi Della Rocca CHAIR (Università di Torino)
Jan Rutten (CWI)
Helmut Schwichtenberg (LMU Munich)
Phil Scott (Dept. of Math & Stats, U. Ottawa)
Peter Selinger (Dalhousie University)
Makoto Tatsuta (National Institute of Informatics)
Tachio Terauchi (Nagoya University)

ORGANIZING COMMITTEE
Erika De Benedetti (Dipartimento di Informatica, Torino)
Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica
(DISIT), Alessandria)
Mauro Piccolo (Dipartimento di Informatica, Torino)
Luca Padovani (Dipartimento di Informatica, Torino)
Luca Paolini (Dipartimento di Informatica, Torino)
Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino)
Luca Roversi (Dipartimento di Informatica, Torino)
Angelo Troina (Dipartimento di Informatica, Torino)



___________________________________________________________________________

3) [STACS 2013] Call for Participation
************************************************************************

STACS 2013 CALL FOR PARTICIPATION

30th International Symposium on Theoretical Aspects of Computer Science

February 27-March 2, 2013, Kiel, Germany

http://www.stacs2013.uni-kiel.de

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

The 30th International Symposium on Theoretical 
Computer Science (STACS) will be held from 
February 27 to March 2, 2013 (Wednesday through 
Saturday), on the premises of the Christian-Albrechts-Universität zu Kiel.

SCIENTIFIC PROGRAM
******************
The program, which is available at

   http://www.stacs2013/uni-kiel.de/ ,

is composed of 54 contributed and three invited talks as well as a tutorial.

INVITED TALKS AND TUTORIAL
**************************
- Kousha Etessami, University of Edinburgh
   The complexity of analyzing infinite-state 
Markov chains, Markov decision processes, and stochastic games
- Kurt Mehlhorn, MPI Saarbrücken and Saarland University
   Physarum can compute shortest paths
- Stéphan Thomassé, Ecole Normale Supérieure de Lyon
   Graph Coloring, Communication Complexity and the Stubborn Problem
- Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial)
   Algorithmic Graph Structure Theory

REGISTRATION
************
Registration is through the conference website,

   http://www.stacs2013.uni-kiel.de/ .

INFORMATION
***********
For detailed information on STACS 2013, visit the conference website,

   http://www.stacs2013.uni-kiel.de/ .

IMPORTANT DATES
***************
Early registration deadline: Jan 14, 2013
Regular registration:        Jan 15 - Feb 14, 2013
Late registration:           Feb 15 - Mar 2, 2013
Symposium:                   Feb 27 - Mar 2, 2013

CONTACT INFORMATION
*******************
info at stacs2013.uni-kiel.de
___________________________________________________________________________

4) TAMC 2013 The 10th Annual Conference on Theory 
and Applications of Models of Computation
===========================================================================
SECOND CALL FOR PAPERS:

                              TAMC 2013

        The 10th Annual Conference on Theory and Applications of
                        Models of Computation

                  Hong Kong, China, 20-22 May 2013

                   http://www.cs.hku.hk/tamc2013/

===========================================================================

The 10th Annual Conference on Theory and Application of Models of
Computation (TAMC 2013 http://www.cs.hku.hk/tamc2013/) will be held in
Hong Kong, China, from May 20 to May 22, 2013. TAMC aims at bringing
together a wide range of researchers with interests in computational
theory and applications.

Hong Kong is situated on China's south coast and is famous for its
skyline. Hong Kong was a colony of the British Empire until 1997 when it
was returned to China. It now thrives under the principle of "one country,
two systems", enjoying a high degree of authority and independent
judiciary. Hong Kong is often described as "East meets West" and is one of
the world's leading international financial centers.

Come and visit Asia's vibrant world city
(www.discoverhongkong.com/eng/index.jsp) and join the conference at the
University of Hong Kong (according to 2012 QS World University Rankings
HKU ranked 23rd in the world and 1st in Asia).

The main themes of the conference are computability, complexity, and
algorithms. Typical but not exclusive topics of interest include:

algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
computability theory
computational biology, and biological computing
computational complexity
computational game theory
computational logic
computational geometry
continuous and real computation
cryptography
data structures
design and analysis of algorithms
distributed algorithms
fixed parameter tractability
graph algorithms
information and communication complexity
learning theory
natural computation
network algorithms, networks in nature and society
online algorithms
optimization
parallel algorithms
privacy and security
property testing
proof complexity
quantum computing
randomness, pseudo-randomness
randomized algorithms
streaming algorithms

IMPORTANT DATES -
Submission deadline     :       11:59 pm EST January 11, 2013
Notification of authors :       February 22, 2013
Final versions deadline :       March 8, 2013

Submission page:
https://www.easychair.org/conferences/?conf=tamc2013.

Conference Chair:
Francis Chin (The University of Hong Kong)

Program Chair:
Lap Chi Lau (The Chinese University of Hong Kong)
Luca Trevisan (Stanford University)

Program Committee:
Andrej Bogdanov (The Chinese University of Hong Kong)
Hubert Chan (University of Hong Kong)
Ho-Lin Chen (National Taiwan University)
Jianer Chen (Texas A&M University)
Ning Chen (Nanyang Technological University)
Wei Chen (Microsoft Research Asia)
Xi Chen (Columbia University)
Francis Chin (The University of Hong Kong, Chair)
Marek Chrobak (UC Riverside)
Nicola Galesi (Universita di Roma La Sapienza)
Naveen Garg (IIT Dehli)
Navin Goyal (Microsoft Research India)
Nick Harvey (University of British Columbia)
Rahul Jain (National University of Singapore)
David Jao (University of Waterloo)
Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
Jochen Konemann (University of Waterloo)
Amit Kumar (IIT Delhi)
Lap Chi Lau (The Chinese University of Hong Kong, Co-chair)
Jian Li (Tsinghua University)
Rachel Lin (MIT and The Chinese University of Hong Kong)
Pinyan Lu (Microsoft Research Asia)
Mohammad Mahdian (Google Research)
Seffi Naor (Technion University)
Krzysztof Onak (IBM Research)
Periklis Papakonstantinou (Tsinghua University)
Seth Pettie (University of Michigan)
Atri Rudra (University at Buffalo, The State University of New York)
Alexander Russell (University of Connecticut)
Piotr Sankowski (University of Warsaw)
Rahul Santhanam (University of Edinburgh)
Anastasios Sidiropoulos (UIUC)
Mohit Singh (Microsoft Research Redmond)
Man Cho Anthony So (The Chinese University of Hong Kong)
John Steinberger (Tsinghua University)
Luca Trevisan (Stanford University, Co-chair)
Laszlo Vegh (London School of Economics)
David Woodruff (IBM Research)
Ke Yi (Hong Kong University of Science and Technology)
Qin Zhang (IBM Research and Indiana University)

Submission instructions:
* Authors should submit an extended abstract (not a full paper), online
at:  https://www.easychair.org/conferences/?conf=tamc2013

* The submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear comparison with
related work.

* The length of the extended abstract should not exceed ten (10)
letter-sized pages (not including bibliography and appendices.)

* Submitted papers must describe work not previously published. They must
not be submitted simultaneously to another conference with refereed
proceedings.

* Research that is already submitted to a journal may be submitted to
TAMC13, provided that (a) the PC chair is notified in advance that this is
the case, and (b) it is not scheduled for journal publication before the
conference.

Proceedings:
The TAMC proceedings will be published in the Lecture Notes in Computer
Science Series by Springer (http://www.springer.com/lncs).
Authors of accepted papers are expected to present their work at the
conference.

Special issues of the leading journals 'Theoretical Computer Science' and
'Mathematical Structures in Computer Science', devoted to a selected set
of accepted papers of the conference, are planned.

Steering Committee:
Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
S. Barry Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)

Local Organising Committee:
Hubert Chan, H.F. Ting, Zhang Yong

===========================================================================
Contact: tamc at cs.hku.hk
===========================================================================

___________________________________________________________________________

5) MCU 2013: Machines, Computations and 
Universality, Zuerich (Switzerland), 9-12 Sep 2013
Machines, Computations and Universality (MCU) 2013, the 6th conference
in the MCU series, will be hosted at the University of Zurich on
September 9-12, 2013.

http://mcu2013.ini.uzh.ch/


SCOPE

MCU explores computation in the setting of various discrete models
(Turing machines, register machines, cellular automata, tile assembly
systems, rewriting systems, neural models etc.) and analog and hybrid
models (BSS machines, infinite time cellular automata, real machines,
quantum computing etc.). There is particular (but not exclusive)
emphasis given towards the following:


1. the search for frontiers between decidability and undecidability in
the various models. (For example, what is the smallest number of pairs
of words for which the Post correspondence problem is undecidable, or
what is the largest state-symbol product for which the halting problem
is decidable for Turing machines.)


2. the search for the simplest universal models (such as small universal
Turing machines, universal rewriting systems with few rules, universal
cellular automata with small neighborhoods and a small number of states,
etc.)

3. the computational complexity of predicting the evolution of
computations in the various models. (For example, is it possible to
predict an arbitrary number of time steps for a model more efficiently
than explicit step by step simulation of the model.)

4. universality and undecidability in continuous models of computation.


IMPORTANT DATES

Submission: March 31, 2013
Notification: May 17, 2013
Final Version: June 14, 2013
Conference: September 9-12, 2013


PROGRAM COMMITTEE

Andrew Adamatzky        (University of the West of England, UK)
Matthew Cook            (University of Zurich and ETH Zurich) (co-chair)
Erzsébet Csuhaj-Varjú   (Eötvös Loránd University, Budapest, Hungary)
Jérôme Durand-Lose      (University of Orléans, France)
Rudolf Freund           (University of Vienna, Austria)
Gabriel Istrate         (Institute e-Austria, Timisoara, Romania)
Jarkko Kari             (University of Turku, Finland)
Lila Kari               (University of Western Ontario, London, Canada)
Kamala Krithivasan      (Indian Institute of Technology, Chennai, India)
Maurice Margenstern     (University of Lorraine, France)
Turlough Neary          (University of Zurich and ETH Zurich) (co-chair)
Matthew Pattitz         (University of Arkansas, Fayetteville, USA)
Igor Potapov            (University of Liverpool, UK)
Klaus Sutner            (Carnegie Mellon University, Pittsburgh, USA)
Sergey Verlan           (University of Paris Est, France)
Damien Woods            (California Institute of Technology, USA)


INVITED SPEAKERS

Liesbeth De Mol     (Ghent University, Belgium)
Jarkko Kari         (University of Turku, Finland)
Kenichi Morita      (Hiroshima University, Japan)
Erik Winfree        (California Institute of Technology, USA)
Damien Woods        (California Institute of Technology, USA)


PAPER PREPARATION AND SUBMISSION

Authors are invited to submit extended abstracts of no more than 12
pages via the EasyChair system at
https://www.easychair.org/conferences/?conf=mcu2013. Submissions should
contain original research that has not previously been published.
Concurrent submissions to other conferences/journals is not permitted.
Supplementary material that exceeds the 12 page limit will be considered
at the committee?s discretion. Submissions must be in the form of a PDF
prepared using the EPTCS style file (available at
http://style.eptcs.org/). The title page should include the title of the
paper, the names, affiliations and email addresses of each of the
authors, and an abstract of no more than 300 words.


CONFERENCE PROCEEDINGS

The proceedings will be published in Electronic Proceedings in
Theoretical Computer Science (EPTCS) and will be available at the
conference, and freely available online. For more information see the
EPTCS website at http://about.eptcs.org/.

Following, the conference, authors of selected papers will be invited to
submit an extended version of their work to a special issue of an
international journal.
___________________________________________________________________________

6) WoLLIC 2013: Logic, Language, Information and 
Computation, Darmstadt (Germany), 20-23 Aug 2013
*WoLLIC 2013 *

*20**th** Workshop on Logic, Language, Information and Computation *

*August 20**th** to 23**rd**, 2013*

*Technische Universität Darmstadt
Darmstadt, Germany*


*Scientific Sponsorship*
*Interest Group in Pure and Applied Logics
(**IGPL*
*)*
*The Association for Logic, Language and Information
(**FoLLI*
*)*
*Association for Symbolic Logic (**ASL* *)*
*European Association for Theoretical Computer Science
(**EATCS*
*)*
*European Association for Computer Science Logic
(**EACSL*
*)*
*Sociedade Brasileira de Computação (**SBC* *)*
*Sociedade Brasileira de Lógica (**SBL* *)*

*Organisation*

*Fachbereich Mathematik*
*, **Technische Universität Darmstadt*
*, Germany
**Centro de Informática* *, **Universidade Federal
de Pernambuco* *, Brazil *


*Call for Papers*

WoLLIC  is an annual international forum on
inter-disciplinary research involving formal logic, computing and
programming theory, and natural language and reasoning. Each meeting
includes invited talks and tutorials as well as contributed papers. The
twentieth WoLLIC will be held at the Technische Universität Darmstadt,
Germany, from August 20th to 23rd, 2013. It is sponsored by the Association
for Symbolic Logic  (ASL), the Interest Group in
Pure and Applied Logics  (IGPL), the The
Association for Logic, Language and Information
  (FoLLI),
theEuropean Association for Theoretical Computer
Science (EATCS),
the European Association for Computer Science Logic
  (EACSL),
the Sociedade Brasileira de Computação  (SBC), and
the Sociedade Brasileira de Lógica  (SBL).


*Paper submission*
Contributions are invited on all pertinent subjects, with particular
interest in cross-disciplinary topics. Typical but not exclusive areas of
interest are: foundations of computing and programming; novel computation
models and paradigms; broad notions of proof and belief; formal methods in
software and hardware development; logical approach to natural language and
reasoning; logics of programs, actions and resources; foundational aspects
of information organization, search, flow, sharing, and protection.
Proposed contributions should be in English, and consist of a scholarly
exposition accessible to the non-specialist, including motivation,
background, and comparison with related works. They must not exceed 10
pages (in font 10 or higher), with up to 5 additional pages for references
and technical appendices. The paper's main results must not be published or
submitted for publication in refereed venues, including journals and other
scientific meetings. It is expected that each accepted paper be presented
at the meeting by one of its authors. Papers must be submitted
electronically at the WoLLIC 2012 EasyChair website. (Please go to
http://wollic.org/wollic2013/instructions.html
for
instructions.) A title and single-paragraph abstract should be submitted by
March 25th, and the full paper by March 29th (firm date). Notifications are
expected by May 3rd, and final papers for the proceedings will be due by
May 15th (firm date).

*Proceedings*
The proceedings of WoLLIC 2013, including both invited and contributed
papers, will be published in advance of the meeting as a volume in
Springer's LNCS  series. In addition,
abstracts will be published in the Conference Report section of the *Logic
Journal of the IGPL*, and selected contributions will be published as a
special post-conference WoLLIC 2013 issue of a scientific journal (to be
confirmed).

*Invited Speakers*

   - *Natasha Alechina*  (University of
   Nottingham)
   - *Steve Awodey*  (Carnegie
   Mellon University)
   - *Mikolaj Bojanczyk*  (Warsaw
   University)
   - *Wim Martens*
(Universität
   Bayreuth)
   - *Catuscia Palamidessi*  (INRIA
   Saclay and LIX)
   - *Thomas Schwentick*
(TU
   Dortmund)


*Student Grants*
ASL sponsorship of WoLLIC 2013 will permit ASL student members to apply for
a modest travel grant (deadline: May 1st, 2013). See
http://www.aslonline.org/studenttravelawards.html for details.

*Important Dates*

   - *March 25th, 2013*: Paper title and abstract deadline* *
   - *March 29th, 2013*: Full paper deadline
   - May 3rd, 2013: Author notification
   - May 15th, 2013: Final version deadline (firm)


*Programme Committee*

   - Albert Atserias  (UPC Barcelona)
   - Alexandru Baltag
(Univ
   Amsterdam)
   - Stephanie Delaune  (ENS, CNRS)
   - Amy Felty  (Univ Ottawa)
   - Santiago Figueira  (Univ Buenos
   Aires)
   - Amelie Gheerbrant  (Univ
   Edinburgh)
   - Radha Jagadeesan  (DePaul Univ)
   - Delia Kesner  (Univ
   Paris-Diderot)
   - Benoit Larose
(Concordia
   Univ)
   - Leonid Libkin  (Univ Edinburgh
   - CHAIR)
   - Fenrong Liu  (Tsinghua Univ)
   - Jerzy Marcinkowski  (Wroclaw Univ)
   - Peter O'Hearn  (UCL)
   - Joël Ouaknine  (Oxford Univ)
   - Gerald Penn  (Univ Toronto)
   - Gabriele Puppis  (CNRS/LaBRI -
   Univ Bordeaux)
   - R. Ramanujam  (The Institute of
   Mathematical Sciences)
   - Peter Selinger  (Dalhousie Univ)
   - Szymon Torunczyk  (Warsaw Univ)
   - Anna Zamansky  (TU Wien)


*Steering Committee*

   - Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid
   Hodges, Daniel Leivant, Angus Macintyre, Grigori Mints, Luke Ong, Hiroakira
   Ono, Ruy de Queiroz.


*Organising Committee*

   - Ulrich Kohlenbach  (Tech U Darmstadt)
   (Local chair)
   - Anjolina G. de Oliveira  (U Fed
   Pernambuco)
   - Martin Otto  (Tech U
   Darmstadt)
   - Ruy de Queiroz  (U Fed Pernambuco)
   (co-chair)
   - Thomas Streicher  (Tech
   U Darmstadt)
   - Martin Ziegler  (Tech
   U Darmstadt)


*Further information*
Contact one of the Co-Chairs of the Organising Committee.

*Web page*
http://wollic.org/wollic2013/
___________________________________________________________________________

7) ICALP 2013: 2nd Call for Papers
(From Agnis Skuskovniks)

==============================
ICALP 2013: 2nd Call for Papers
==============================

The 40th International Colloquium on Automata, 
Languages and Programming (ICALP),
the main conference and annual meeting of the 
European Association for Theoretical Computer Science (EATCS),
will take place from the 8th to the 12th of July 2013 in Riga, Latvia.

The main conference will be preceded by a series of workshops,
taking place on Sunday, July 7th, 2013 (i.e., one day before ICALP).


Topics
======

Papers presenting original research on all 
aspects of theoretical computer science are sought.
Typical but not exclusive topics of interest are:

** Track A: Algorithms, Complexity and Games

* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Parameterized Algorithms and Complexity
* Randomness in Computation
* Quantum Computing

** Track B: Logic, Semantics, Automata and Theory of Programming

* Algebraic and Categorical Models
* Automata Theory, Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles of Programming Languages
* Logics, Formal Methods and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement and Verification
* Type Systems and Theory, Typed Calculi

** Track C: Foundations of Networked Computation: 
Models, Algorithms and Information Management

* Cloud Computing, Overlay Networks, P2P Systems
* Cryptography, Privacy, Security, Spam
* Distributed and Parallel Computing
* E-commerce, Auctions, Trust and Reputation
* Game Theory, Incentives, Selfishness
* Internet Algorithms
* Mobile and Complex Networks
* Natural and Physical Algorithms
* Network Information Management
* Sensor, Mesh, and Ad Hoc Networks
* Social Networks, Viral Marketing
* Specification, Semantics, Synchronization
* Web Mining, Searching, Ranking and Analysis
* Wireless and Optical Communication

Important Dates
===============

*** Submission Deadline: Feb 15, 2013
*** Author Notification: Apr 12, 2013
*** Final Manuscript Due: April 28, 2013
*** The conference: July 8-12, 2013


Paper Submissions
=================

Authors are invited to submit an extended 
abstract of no more than 12 pages in LNCS style presenting original research
on the theory of Computer Science. Submissions 
should indicate to which track (A, B, or C) the paper is submitted.
No prior publication or simultaneous submission 
to other publication outlets (either a conference or a journal) is allowed.
The proceedings will be published in the Lecture 
Notes in Computer Science Series by Springer-Verlag.

It is strongly recommended that submissions 
adhere to the specified format and length.
Submissions that are clearly too long may be 
rejected immediately. Material other than the abstract,
references and the first 12 pages may be 
considered as supplementary and will be read at the committee's discretion.


Best Paper Awards
=================

As in previous editions of ICALP, there will be 
best paper and best student paper awards for each track of the conference.
In order to be eligible for a best student paper 
award, a paper should be authored only by students and should be
marked as such upon submission.


Submission server
=================

Submissions should be contributed using the EasyChair system
(http://www.easychair.org/conferences/?conf=icalp13)

Submissions are due on February 15, 2013, 23:59 CET.


Invited Speakers
================

* Susanne Albers, Humboldt University
* Orna Kupferman, Hebrew University
* Paul Spirakis, University of Patras
* Daniel Marx, Hungarian Academy of Sciences
* Peter Widmayer, ETH Zürich


Conference Chair
================

R?si?? Freivalds, University of Latvia


Contact: icalp2013 at gmail.com
=============================

___________________________________________________________________________

8) DCFS 2013: First Call of Papers
Dear colleagues,

Enclosed you can find the Call for Papers for 
DCFS 2013, Descriptional Complexity of Formal Systems Workshop.
We hope that many of you will submit papers and will attend the workshop.

With best wishes,

Helmut Jürgensen  (University of London, Ontario)
Rogério Reis      (University of Porto)

PS.: We apologize for multiple posting.


--------------------

First Call for Papers -- DCFS 2013

15th International Workshop on Descriptional Complexity of Formal Systems

London, Ontario, Canada

July 22-25, 2013

http://www.csd.uwo.ca/dcfs2013

-------------------

DCFS 2013 will be held in London, Ontario, Canada, on July 22-25, 2013.
It will be preceded by CIAA in Halifax, Canada, 16-19 July.

Detailed information will be available at

   http://www.csd.uwo.ca/dcfs2013

The DCFS email address is: dcfs2013 at csd.uwo.ca


Paper submissions are invited which fit into the 
general theme of the workshop.
In particular, we look for submissions in the following general areas -- this
list is not meant to be exclusive:

   - Automata, grammars, languages and other formal systems; various modes
     of operations and complexity measures.

   - Succinctness of description of objects, state-explosion-like phenomena.

   - Circuit complexity of Boolean functions and related measures.

   - Size complexity of formal systems.

   - Structural complexity of formal systems.

   - Trade-offs between computational models and mode of operation.

   - Applications of formal systems -- for instance in software and
     hardware testing, in dialogue systems,
     in systems modeling or in modeling natural 
languages-- and their complexity
     constraints.

   - Co-operating formal systems.

   - Size or structural complexity of formal systems for modeling
     natural languages.

   - Complexity aspects related to the combinatorics of words.

   - Descriptional complexity in resource-bounded or structure-bounded
     environments.

   - Structural complexity as related to descriptional complexity.

   - Frontiers between decidability and undecidability.

   - Universality and reversibility.

   - Nature-motivated (bio-inspired) architectures and unconventional models
     of computing.

   - Kolmogorov-Chaitin complexity, algorithmic information.

If in doubt, please feel free to ask for advice 
at the email address given above.

We invite original contributions to the field, 
but also look for exploratory expositions and
demonstrations of implementations.
The exact format of the workshop is still being 
discussed. Greater detail will be provided
both on the web site and the second call.


Submissions

Papers presenting original contributions 
concerning the topics of the conference are being
sought. Authors are invited to submit papers of no more than 12 pages
in LNCS-style LaTeX2e (available at
http://www.springer.de/comp/lncs/authors.html). Papers must be in
English and provide sufficient details to allow the program committee
to assess their merits.  Proofs omitted due to space constraints must
be put into an appendix to be read by the program committee members at
their discretion. Simultaneous submission to other conferences or
workshops with published proceedings is not allowed.

Papers will be submitted electronically in PDF, using the EasyChair system. Use
the following link for submission:

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

The proceedings will be published in the Springer Lecture Notes in
Computer Science (LNCS) series and will be available at the
workshop. As in previous years, a special journal issue with full
versions of selected papers will be devoted to DCFS 2013.


Important Dates:

Submission Deadline: March 20, 2013
Notification of accepted papers: April 25, 2013
Final Version: May 8, 2013
Conference dates: July 22-25, 2013


Invited Speakers

Cezar Câmpeanu (University of Prince Edward Island, Charlotteteown, Canada)
Frank Drewes (Umeå Universitet, Sweden)
Pierre McKenzie (Université de Montréal, Canada)
Klaus Sutner (Carnegie Mellon University, Pittsburgh, US)


Program Committee

Viliam Geffert, Univerzita Pavol Jozefa ?afárika, Ko?ice, Slovakia
Galina Jirásková, Slovak Academy of Sciences, Ko?ice, Slovakia
Helmut Jürgensen, University of Western Ontario, London, Canada (Co-Chair)
Christos Kapoutsis, Université Paris Diderot, France
Lila Kari, University of Western Ontario, London, Canada
Stavros Konstantinidis, St. Mary's University, Halifax, Canada
Dexter Kozen, Cornell University, Ithaca, USA
Martin Kutrib, Universität Gießen, Germany
Andreas Malcher, Universität Gießen, Germany
Ian McQuillan, University of Saskatchewan, Saskatoon, Canada
Victor Mitrana, Universitatea Bucure?ti, Romania
Nelma Moreira, Universidade do Porto, Portugal
Beatrice Palano, Università degli Studi di Milano, Italy
Giovanni Pighizzini, Università degli Studi di Milano, Italy
Rogério Reis, Universidade do Porto, Portugal (Co-Chair)
Jaques Sakarovitch, CNRS/ENST, Paris, France
Kai Salomaa, Queen's University, Kingston, Canada
Jeffrey Shallit, University of Waterloo, Canada
Bianca Truthe, Otto-von-Guericke-Universität, Magdeburg, Germany


Steering Committee

Erzsébet Csuhaj-Varjú (Budapest, Hungary)
Jürgen Dassow (Magdeburg, Germany)
Helmut Jürgensen (London, ON, Canada)
Hing Leung (Las Cruces, New Mexico)
Giovanni Pighizzini (Milano, Italy) (Chair)
Detlef Wotschke (Frankfurt, Germany)


Organizing Committee

Helmut Jürgensen, University of Western Ontario
To be announced




___________________________________________________________________________

9) Ackermann Award 2013 - Call for Nominations
ACKERMANN AWARD 2013 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN
COMPUTER SCIENCE
  CALL FOR NOMINATIONS

Eligible for the 2013 Ackermann Award are PhD dissertations in topics
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution between
1.1.2011 and 31.12.2012. The deadline for submission is 15 April 2013.
Submission details follow below.
Nominations can be submitted from 1 January 2013 on and should be sent
to the chair of the Jury, Anuj Dawar, by e-mail: anuj.dawar at cl.cam.ac.uk

The Award
The 2013 Ackermann award will be presented to the recipient(s) at the
annual conference of the EACSL (CSL'13), 2-5 September 2013, in Torino
(Italy). The award consists of

     * a diploma,
     * an invitation to present the thesis at the CSL conference,
     * the publication of the laudatio in the CSL proceedings,
     * travel support to attend the conference.

The jury is entitled to give more (or less) than one award per year.
Jury
The jury consists of:

     * Thierry Coquand (Chalmers University of Gothenburg);
     * Anuj Dawar (University of Cambridge), the president of EACSL;
     * Thomas A. Henzinger (IST Austria);
     * Daniel Leivant (Indiana University, Bloomington);
     * Damian Niwinski (University of Warsaw);
     * Luke Ong (University of Oxford), LICS representative;
     * Simona Ronchi Della Rocca (University of Torino), the
vice-president of EACSL;
     * Wolfgang Thomas (RWTH, Aachen).

How to submit
The candidate or his/her supervisor has to submit

    1. the thesis (ps or pdf file);
    2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file);
    3. a supporting letter by the PhD advisor and two supporting letters
by other senior faculty or researchers in equivalent positions (in
English); supporting letters can also be sent directly to Anuj Dawar
(anuj.dawar at cl.cam.ac.uk);
    4. a short CV of the candidate;
    5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period
(scanned as pdf-file or faxed).

The submission should preferably be sent by e-mail as attachments to
professor Anuj Dawar:
anuj.dawar at cl.cam.ac.uk
With the following subject line and text:

     * Subject: Ackermann Award Submission
     * Text: Name of candidate, list of attachments

Submission can be sent via several e-mail messages. If this is the case,
please indicate it in the text. Letters of support and documents can
also be faxed to:
Prof. Anuj Dawar
Ackermann Award
+44 1223 334678

The Jury has the right to declare submissions to be out of scope or not
to meet the requirements.


___________________________________________________________________________

10) UCNC 2013: 2nd call for papers
___________________________________________________________________

                  12th International Conference on
         UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION

                              UCNC 2013

                 previously Unconventional Computation

                            1-5 July 2013
                            Milano, Italy
         Co-located with Computability in Europe (CiE 2013)

                   http://ucnc2013.disco.unimib.it
                      ucnc2013 at disco.unimib.it

Important dates

* Submission deadline: 2 February 2013
* Notification to authors: 25 March 2013
* Final version: 1 May 2013
* Conference: 1-5 July 2013

UCNC 2013 is organised by Dipartimento di Informatica,
Sistemistica e Comunicazione (Department of Computer Science,
Systems and Communication) of Università degli Studi di
Milano-Bicocca.

Topics

The topics of the conference include all areas of unconventional
computation and natural computation, including (but not limited
to) quantum, cellular, molecular, neural, DNA, membrane, and
evolutionary computing; cellular automata; computation based on
chaos and dynamical systems; massive parallel computation;
collective intelligence; computation based on physical principles
such as relativistic, optical, spatial, collision-based
computing; amorphous computing; physarum computing;
hypercomputation. Both theoretical and experimental papers are
welcome.

Submissions

Authors are invited to submit original papers (at most 12 pages
in LNCS format) using EasyChair.org, at

    https://www.easychair.org/conferences/?conf=ucnc2013

Papers must be submitted in Portable Document Format (PDF). The
revised version of the manuscripts, to appear in a LNCS volume by
Springer, must be prepared in LaTeX according to the LNCS format
(see http://www.springer.com/computer/lncs/ lncs+authors).

The papers must not have been submitted simultaneously to other
conferences with published proceedings. All accepted papers must
be presented at the conference.

The proceedings will be available at the conference venue.

Authors of accepted papers will be invited to submit an extended
and improved version of their contribution to a special issue of
an international journal.

Invited speakers

* Enrico Formenti (Université Nice Sophia Antipolis, France)
* John V. Tucker (Swansea University, UK)
* Xin Yao (University of Birmingham, UK)

Joint UCNC/CiE 2013 invited speakers

* Gilles Brassard (Université de Montréal, Canada)
* Grzegorz Rozenberg (Universiteit Leiden, Netherlands and
    University of Colorado Boulder, USA)
* Endre Szemerédi (Hungarian Academy of Sciences, Hungary and
    Rutgers University, USA)

Program committee

* Andrew Adamatzky (University of the West of England, UK)
* Selim G. Akl (Queen's University, Canada)
* Olivier Bournez (École Politechnique, France)
* Cristian S. Calude (University of Auckland, New Zealand)
* José Félix Costa (Techinical University of Lisbon, Portugal)
* Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Hungary)
* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
    Italy)
* Michael J. Dinneen (University of Auckland, New Zealand)
* Marco Dorigo (Université Libre de Bruxelles, Belgium)
* Jérôme Durand-Lose (Université d'Orléans, France)
* Masami Hagiya (University of Tokyo, Japan)
* Oscar H. Ibarra (University of California, Santa Barbara, USA)
* Jarkko Kari (University of Turku, Finland)
* Lila Kari (University of Western Ontario, Canada)
* Viv Kendon (University of Leeds, UK)
* Giancarlo Mauri (chair, Università degli Studi di
    Milano-Bicocca, Italy)
* Mario J. Pérez-Jiménez (Universidad de Sevilla, Spain)
* Kai Salomaa (Queen's University, Canada)
* Hava Siegelmann (University of Massachusetts Amherst, USA)
* Susan Stepney (University of York, UK)
* Hiroshi Umeo (Osaka Electro-Communication University, Japan)
* Leonardo Vanneschi (Universidade Nova de Lisboa, Portugal)
* Damien Woods (California Institute of Technology, USA)

Organising committee

* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
    Italy)
* Luca Manzoni (Università degli Studi di Milano-Bicocca, Italy)
* Giancarlo Mauri (chair, Università degli Studi di
    Milano-Bicocca, Italy)
* Antonio E. Porreca (Università degli Studi di Milano-Bicocca,
    Italy)

Satellite workshops

* Wivace 2013 (Workshop Italiano di Vita Artificiale e
    Computazione Evolutiva 2013 -- Italian Workshop on Artificial
    Life and Evolutionary Computation 2013)
    http://wivace2013.disco.unimib.it

The UCNC 2013 conference will be co-located with Computability in
Europe 2013 (CiE 2013, http://cie2013.disco.unimib.it).

The two conferences will take place at the U6 building of
Università degli Studi di Milano-Bicocca, Piazza dell'Ateneo
Nuovo 1, Milano.

The previous editions of the conference took place at Auckland,
New Zealand (UMC 1998); Brussels, Belgium (UMC 2000); Kobe, Japan
(UMC 2002); Seville, Spain (UC 2005); York, UK (UC 2006);
Kingston, Canada (UC 2007); Vienna, Austria (UC 2008); Ponta
Delgada, Portugal (UC 2009); Tokyo, Japan (UC 2010); Turku,
Finland (UC 2011); Orleans, France (UCNC 2012).

___________________________________________________________________________

11) CiE 2013 Call For Papers
************************************************************************
         9th International Conference on COMPUTABILITY IN EUROPE

                   CiE 2013: The Nature of Computation
                               Milan, Italy
                            July  1 - 5, 2013

                     http://cie2013.disco.unimib.it

co-located with Unconventional Computation and Natural Computation 2013

                      http://ucnc2013.disco.unimib.it

IMPORTANT DATES

Submission Deadline for LNCS:                   20 January 2013
Notification of authors:                        4 March 2013
Deadline for final revisions:                   1 April 2013

CiE 2013 is the ninth conference organised by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world. Previous meetings have taken place in Amsterdam (2005),
Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
Dalgada (2010), Sofia (2011) and Cambridge (2012).

TOPICS

CiE 2013 conference topics include, but not exclusively:

* Admissible sets
* Algorithms
* Analog computation
* Artificial intelligence
* Automata theory
* Bioinformatics
* Classical computability and degree structures
* Cognitive science and modelling
* Complexity classes
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational biology
* Computational creativity
* Computational learning and complexity
* Computational linguistics
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* DNA computing
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* Emerging and Non-standard Models of Computation
* Finite model theory
* Formal aspects of program analysis
* Formal methods
* Foundations of computer science
* Games
* Generalized recursion theory
* History of computation
* Hybrid systems
* Higher type computability
* Hypercomputational models
* Infinite time Turing machines
* Kolmogorov complexity
* Lambda and combinatory calculi
* L-systems and membrane computation
* Machine learning
* Mathematical models of emergence
* Molecular computation
* Morphogenesis and developmental biology
* Multi-agent systems
* Natural Computation
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebras and concurrent systems
* Programming language semantics
* Proof mining and applications
* Proof theory and computability
* Proof complexity
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Semantics and logic of computation
* Swarm intelligence and self-organisation
* Type systems and type theory
* Uncertain Reasoning
* Weak systems of arithmetic and applications

We particularly welcome submissions in emergent areas, such as
bioinformatics and natural computation, where they have a basic
connection with computability.


SUBMISSIONS

Authors of accepted papers are expected to present their work at the
conference. Each presentation will be 25 minutes long, including the
time for the eventual discussion. Submitted papers must describe work
not previously published, and they must neither be accepted nor under
review at a journal or at another conference with refereed proceedings.
Authors are required to submit their manuscripts electronically in PDF
using the LNCS style. Authors using LaTeX can download the needed macros
at Springer-Verlag site. Papers should not exceed 10 pages; full proofs
may appear in a clearly marked technical appendix which will be read at
the reviewers’ discretion.
The submission process is managed by EasyChair and is available at
https://www.easychair.org/conferences/?conf=cie2013.

The proceedings will be available at the conference venue.
The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

AWARDS & GRANTS

Springer-Verlag has graciously funded two awards that will be given
during the CiE 2013 Conference.

Best student paper

This prize will be awarded for the best student paper presented at CiE
2013, as judged by the Program Committee. A prize of 500 Euros will be
given to the author(s) of the best student-authored paper (or split
between more than one paper if there is a tie). In order to be
considered, a paper has to be submitted in the category 'Regular paper
(eligible for best student paper award)' on EasyChair.
Papers are eligible if all of its authors are full-time students at the
time of submission.


Best paper on Natural Computing

The prize consists of the four volumes of the Handbook of Natural
Computing (see http://cie2013.disco.unimib.it/awards/). This prize will
be awarded to the best paper on Natural Computing presented at CiE 2013,
as judged by the Program Committee. A paper is eligible if its main
topic falls within the scope of Natural Computing, roughly defined as
the set of fields studied in the above handbook. The Program Committee
is the only judge of the relevance of a paper within the Natural
Computing scope. The authors of a paper eligible for the award must
indicate this in the submission notes.

Grants

The ASL, EATCS and Elsevier have decided to sponsor students. In
particular Elsevier under the Women in Computability program offers
funds for junior female researchers to attend CiE 2013. The applications
for ASL and Elsevier funds must be sent before April 1, 2013.
Preference will be given to researchers who present a paper (contributed
paper or informal talk), see http://cie2013.disco.unimib.it/awards/ for
details.

INVITED SPEAKERS

Ulle Endriss (University of Amsterdam)
Lance Fortnow (Georgia Institute of Technology)
Anna Karlin (University of Washington)
Bernard Moret (Ecole Polytechnique Fédérale de Lausanne)
Mariya Soskova (Sofia University)
Endre Szemerédi (Hungarian Academy of Sciences, 
Rutgers University) joint CIE/UCNC 2013 speaker

TUTORIAL SPEAKERS (joint with UCNC 2013)

Gilles Brassard (Université de Montréal)
Grzegorz Rozenberg (Leiden Institute of Advanced 
Computer Science and University of Colorado at Boulder)

SPECIAL SESSIONS on

Algorithmic Randomness
          organizers: Mathieu Hoyrup, Andre Nies
Data Streams and Compression
          organizers: Paolo Ferragina, Andrew McGregor
Computational Complexity in the Continuous World
          organizers: Akitoshi Kawamura, Robert Rettinger
Computational Molecular Biology
          organizers: Alessandra Carbone, Jens Stoye
Computation in Nature
          organizers: Mark Daley, Natasha Jonoska
History of Computation
          organizers: Gerard Alberts, Liesbeth De Mol

PROGRAM COMMITTEE:

* Gerard Alberts (Amsterdam)          * Luís Antunes (Porto)
* Arnold Beckmann (Swansea)           * Laurent Bienvenu (Paris)
* Paola Bonizzoni (Milan, co-chair)   * Vasco 
Brattka (Munich and Cape Town, co-chair)
* Cameron Buckner (Houston TX)        * Bruno Codenotti (Pisa)
* Stephen Cook (Toronto ON)           * Barry Cooper (Leeds)
* Ann Copestake (Cambridge)           * Erzsébet Csuhaj-Varjú (Budapest)
* Anuj Dawar (Cambridge)              * Gianluca Della Vedova (Milan)
* Liesbeth De Mol (Gent)              * Jérôme Durand-Lose (Orléans)
* Viv Kendon (Leeds)                  * Bjørn Kjos-Hanssen (Honolulu, HI)
* Antonina Kolokolova (St. John’s NF) * Benedikt Löwe (Amsterdam)
* Giancarlo Mauri (Milan)             * Rolf Niedermeier (Berlin)
* Geoffrey Pullum (Edinburgh)         * Nicole Schweikardt (Frankfurt)
* Sonja Smets (Amsterdam)             * Susan Stepney (York)
* S. P. Suresh (Chennai)              * Peter van Emde Boas (Amsterdam)


Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it
Website: http://cie2013.disco.unimib.it
************************************************************************



___________________________________________________________________________

12) TLCA 2013 Last Call for Papers
================================================================
TLCA 2013 Last Call for Papers

11th International Conference on
Typed Lambda Calculi and Applications
Eindhoven, 23-28 June 2013
co-located with RTA 2013 as part of RDP 2013

TLCA 2013 webpage: http://www.kurims.kyoto-u.ac.jp/tlca2013/
RDP 2013 webpage: http://www.win.tue.nl/rdp2013/

*** Title and abstract due  25 January 2013 ***
*** Deadline for submission  1 February 2013 ***

================================================================

The 11th International Conference on Typed Lambda Calculi
and Applications (TLCA 2013) is a forum for original
research in the theory and applications of typed lambda
calculus, broadly construed.
Suggested, but not exclusive, list of topics for submission are:

* Proof-theory: natural deduction, sequent calculi, cut elimination
   and normalization, propositions as types, linear logic and proof
   nets, type-theoretic aspects of computational complexity
* Semantics: denotational semantics, game semantics, realisability,
   domain theory, categorical models
* Types: subtypes, dependent types, polymorphism, intersection types
   and related approaches, type inference and type checking, types in
   program analysis and verification, types in proof assistants
* Programming: foundational aspects of functional programming,
   object-oriented programming and other programming paradigms,
   flow analysis of higher-type computation, program equivalence,
   program transformation and optimization

INVITED SPEAKERS

* Simon Peyton-Jones (Microsoft Cambridge, UK) Joint invited speaker for
RTA+TLCA 2013
* Hugo Herbelin (INRIA, France) invited speaker for TLCA 2013
* Damiano Mazza (Universite Paris-Nord, France) invited speaker for TLCA
2013


IMPORTANT DATES

* Paper Registration (titles & short abstracts): 25 January 2013
* Full Paper Submission: 1 February 2013
* Author Notification: 22 March 2013
* Camera-Ready Paper for the Proceedings: 12 April 2013


SUBMISSION GUIDELINES

We solicit submissions of research papers, which must:
* be in English and not exceed 15 pages (including figures and
   bibliography). Additional material intended for the reviewers
   but not for publication in the final version - for example
   details of proofs - may be placed in a clearly marked appendix
   that is not included in the page limit. Reviewers will be told
   that they may choose to ignore the appendix.
* present original research which is unpublished and not submitted
   elsewhere (conferences, journals, books, etc.)
* use the Springer-Verlag LNCS style.
* be submitted electronically in PDF via the EasyChair TLCA 2013
   Submission Webpage
   https://www.easychair.org/conferences/?conf=tlca2013  .

Submissions deviating from these instructions may be rejected
without review. A condition of submission is that, if accepted,
one of the authors must attend the conference to give the
presentation. The proceedings will be published as a volume
in the ARCoSS subline series of Springer-Verlag Lecture Notes in
Computer Science. Final papers will be in the format specified by
Springer-Verlag. Any questions regarding the submission guidelines
should be directed to the Programme Committee Chair
(Masahito Hasegawa ) prior to
submitting.


COLOCATED EVENTS

TLCA 2013 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2013), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2013) and several related events. Details on
workshops affiliated with RDP 2013 will be available at the web
site in due course.


CONFERENCE CHAIR

Herman Geuvers (Radboud University Nijmegen, Netherlands)


PROGRAMME COMMITTEE CHAIR

Masahito Hasegawa (Kyoto University, Japan)


PROGRAMME COMMITTEE

Andreas Abel (LMU Munchen, Germany)
Patrick Baillot (CNRS and ENS Lyon, France)
Nick Benton (Microsoft Cambridge, UK)
Lars Birkedal (IT University of Copenhagen, Denmark)
Herman Geuvers (Radboud University Nijmegen, Netherlands)
Masahito Hasegawa (Kyoto University, Japan) (PC chair)
Naoki Kobayashi (University of Tokyo, Japan)
Paul-Andre Mellies (CNRS and Universite Paris Diderot, France)
Thomas Streicher (TU Darmstadt, Germany)
Lorenzo Tortora de Falco (Universita Roma Tre, Italy)
Stephanie Weirich (University of Pennsylvania, US)


TLCA STEERING COMMITTEE

Samson Abramsky (University of Oxford, UK)
Henk Barendregt (Radboud University Nijmegen, Netherlands)
Pierre-Louis Curien (CNRS and Universite Paris Diderot, France)
Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy)
Martin Hofmann (LMU Munchen, Germany)
Luke Ong (University of Oxford, UK)
Simona Ronchi Della Rocca (Universita di Torino, Italy)
Pawel Urzyczyn (University of Warsaw, Poland)


TLCA HONORARY ADVISOR

Roger Hindley (Swansea University)


TLCA PUBLICITY CHAIR

Luca Paolini (Universita di Torino, Italy)
___________________________________________________________________________

13) Permanent Academic Positions (Computational 
Logic/Functional Programming) in Dundee Deadline 23 January
            ******     Dundee Fellowships   ******
          http://www.dundee.ac.uk/dundeefellows/

University of Dundee announces several permanent positions, with a
5-year starting period of a Research Fellowship.
One of the named priority areas is Computational Logic/ Functional
Programming / Verification.

  For more details, see below or email me:
Katya Komendantskaya


                       School of Computing
                       University of Dundee
                         Dundee Fellowship
                        Permanent position

              Closing Date for applications: Wednesday 23 January 2013.

University of Dundee  is advertising a series of permanent academic jobs
across the College of Arts & Science and Engineering, named Dundee Fellows.
The aim is to bring in a series of excellent academics onto permanent contracts
(subject to the completion of 3 year probation) into any research area
within the
College.  These staff will be labelled as Dundee Fellows during their
first 5 years,
over which time they will receive enhanced staff development and a
research focus
to their duties, while automatically moving to a regular academic
contract (lecturer,
senior lecturer, reader or professor) at the end of these 5 years.
These will be independent researchers (and not postdocs under supervision).
Their teaching load will start low, and will gradually increase over
the first 5 years,
to phase them into teaching.

As the University of Dundee moves towards its 25 year vision of becoming
Scotland?s leading University, we are actively investing in the next generation
of our academic community.  Our Dundee Fellows scheme offers exciting
opportunities to outstanding, high potential, early career researchers of any
age to establish themselves at the University of Dundee and develop towards
making a full and excellent contribution to research, teaching and leadership
in their chosen field.


Full details are available here: http://www.dundee.ac.uk/dundeefellows/


___________________________________________________________________________


CiE Newsletter No.65, January 11th 2013.


Very happy new year 2013 to all !!!


Please send any items you would like included in 
next letter to Olivier Bournez 
(<mailto:bournez at lix.polytechnique.fr>bournez at lix.polytechnique.fr)
DEADLINE: February 10th 2013.

___________________________________________________________________________


** COMPUTABILITY - The Journal of the Association 
CiE. Now accepting submissions.
<http://www.computability.de/journal/>http://www.computability.de/journal/

** CIE 2013 <http://cie2013.disco.unimib.it/>http://cie2013.disco.unimib.it/
Computability in Europe 2013: The Nature of 
Computation. Milano. 1st-5th July 2013.
See also item 11 and attached pdf.

___________________________________________________________________________

CONTENTS

•1) NORDIC LOGIC SPRING '2013
•2) CSL 2013 Torino, September 2-5 2013
•3) [STACS 2013] Call for Participation
•4) TAMC 2013 The 10th Annual Conference on 
Theory and Applications of Models of Computation
•5) MCU 2013: Machines, Computations and 
Universality, Zuerich (Switzerland), 9-12 Sep 2013
•6) WoLLIC 2013: Logic, Language, Information and 
Computation, Darmstadt (Germany), 20-23 Aug 2013
•7) ICALP 2013: 2nd Call for Papers
•8) DCFS 2013: First Call of Papers
•9) Ackermann Award 2013 - Call for Nominations
•10) UCNC 2013: 2nd call for papers
•11) CiE 2013 Call For Papers
•12) TLCA 2013 Last Call for Papers
•13) Permanent Academic Positions (Computational 
Logic/Functional Programming) in Dundee Deadline 23 January


___________________________________________________________________________

1) NORDIC LOGIC SPRING '2013
NORDIC LOGIC SPRING '2013

Nordic Spring School in Logic, 
<http://scandinavianlogic.org/school>http://scandinavianlogic.org/school
May 27-31, 2013, Sophus Lie Conference Center, Nordfjordeid, Norway

The first Nordic Spring School in Logic is 
organized under the auspices of the Scandinavian 
Logic Society and is supported by the Department 
of Mathematics of the University of Oslo.

The Sophus Lie Conference Center 
<http://www.mn.uio.no/math/english/about/collaboration/nordfjordeid/>http://www.mn.uio.no/math/english/about/collaboration/nordfjordeid/ 
is located with a view to one of the famous 
fjords of Norway, in an area particularly 
attractive with its nordic exotic nature and 
bright nights at that time of the year. 
Nordfjordeid can be reached by plane from Oslo, 
Bergen, or Trondheim to Sandane airport, or by 
coach from each of these cities.

COURSE PROGRAMME:
------------------------------
The school programme will comprise the following 
short courses on a variety of important topics in 
mathematical, computational, applied and 
philosophical logic, given by leading experts in their fields:

- Alexandru Baltag and Sonja Smets (University of 
Amsterdam): Dynamic logics for interactive belief revision
- Dag Normann (University of Oslo): The semantics of higher-order algorithms
- Erich Graedel (RWTH Aachen): Logics for dependence and independence
- Joan Bagaria (ICREA, University of Barcelona): Set theory
- Katrin Tent (University of Muenster): Model theory
- Kim Larsen (Aalborg University): Logic and formal verification
- Michael Rathjen (University of Leeds): Proof 
theory: From arithmetic to set theory
- Nina Gierasimczuk (University of Amsterdam) and 
Jakub Szymanik (University of Groningen): Logic, computability and cognition
- Thierry Coquand (University of Gothenburg): 
Type theory and univalent foundations
- Wolfgang Thomas (RWTH Aachen): Logic, automata and games
- Øystein Linnebo (University of Oslo and 
Birkbeck, University of London): Philosophy of 
logic: The problem of absolute generality

The program will be divided into two parallel 
streams, one mainly on mathematical logic and the 
other mainly on computational, applied and 
philosophical logic. The courses will target 
mainly PhD students, but will also be of interest 
for young (and not so young) researchers in logic 
and its applications. Some of the courses will be 
accessible to advanced master students, too. 
Besides the series of courses, the school program 
will also include a half-day excursion to the 
famous glacier Briksdalsbreen, on Wednesday, May 29.

REGISTRATION FOR PARTICIPATION
------------------------------
The registration for the school will commence on 
January 15, 2013. The number of participants will 
be limited, and requests for participations will 
be accepted in the order of registration until the limit is reached.
However, 50 of the available places will be 
reserved for master and PhD students until the early registration deadline.

REGISTRATION DEADLINES:  Early registration: 
MARCH 15, 2013. Late registration: MAY 1, 2013

ACCOMMODATION AND REGISTRATION FEES:
The students accommodation will be provided in 
the conference center, mostly in double rooms. 
These are located in 9 pavilions with 4 double + 
2 single rooms each.  Each pavilion has common 
kitchen and bathroom facilities. The cost of 
accommodation in a double room with full board in 
the center, from (arrival) Sunday, March 26 until 
(latest departure on) Saturday, June 1 is NOK 
3490. There are also alternative possibilities 
for accommodation in hotels or guest houses nearby.

The registration fees, covering the scientific 
programme, conference facilities, refreshments, 
and the excursion, are as follows:
Early Registration:  Student fees: NOK 1500. Regular fees:  NOK 2000
Late Registration: Student fees: NOK 2000. Regular fees:  NOK 2500

Instructions on the registration procedure will 
be posted on the school website: 
<http://scandinavianlogic.org/school>http://scandinavianlogic.org/school

SCHOOL ORGANIZATION
------------------------------
Organizing Committee:

Dag Normann (University of Oslo, Norway): Chair
Elisabeth H. Seland (University of Oslo, Norway): Administrative support
Fredrik Engström (University of Gothenburg, Sweden): Website
Valentin Goranko (Technical University of Denmark)

Scientific Committee:

Benedikt Loewe (Universities of Amsterdam and Hamburg)
Erik Palmgren (University of Stockholm, Sweden)
Juliette Kennedy  (University of Helsinki, Finland)
Marc Bezem (University of Bergen, Norway)
Patrick Blackburn (University of Roskilde, Denmark)
Valentin Goranko (Technical University of Denmark), Chair


CONTACT AND ENQUIRIES
Enquiries on registration and logistics: 
<mailto:nord-logic at math.uio.no>nord-logic at math.uio.no
Enquiries on the scientific programme: 
<mailto:NordicLogic at gmail.com>NordicLogic at gmail.com

___________________________________________________________________________

2) CSL 2013 Torino, September 2-5 2013

CSL 2013
Torino, September 2-5 2013

<http://csl13.di.unito.it/>http://csl13.di.unito.it/


PRELIMINARY ANNOUNCEMENT
_______________________________________________________________________________________________

AIM AND SCOPE
Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose research
activities involve logic, as well as for logicians working on
issues significant for computer science.

LOCATION
The 22nd EACSL Annual Conferences on Computer Science Logic will be held
at Museo di Scienze Naturali in Torino from
Monday 2nd through Thursday 5th of September 2013.

LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE)
automated deduction and interactive theorem proving, constructive
mathematics and type theory, equational logic and term rewriting,
automata and games, game semantics, modal and temporal logic, model
checking, decision procedures, logical aspects of computational
complexity, computational proof theory, bounded arithmetic and
propositional proof complexity, logic programming and constraints, lambda
calculus and combinatory logic, domain theory, categorical logic and
topological semantics, database theory, specification, extraction and
transformation of programs, logical aspects of quantum computing,
logical foundations of programming paradigms, verification and program
analysis, linear logic,
higher-order logic, non-monotonic reasoning.
IMPORTANT DATES
Abstract submission: April, 1st 2013
Paper Submission: April, 8th 2013
Paper Notification: June, 10th 2013
Paper final version: July, 1st 2013
Conference: September, 2nd --- 5th 2013

SUBMISSION
Authors are invited to submit papers of not more than 15 pages in LIPIcs
style presenting work not previously published.
Papers are to be submitted through Easychair. Submitted papers must be
in English and must provide sufficient detail to allow the PC to assess
the merits of the paper. Full proofs may appear in a technical appendix
which will be read at the reviewers' discretion. Authors are strongly
encouraged to include a well written introduction which is directed at
all members
of the program committee.
The submission is in two stages. Abstract submissions are due before
April 1st, 2013. Full paper submissions must be done before April 8th,
2013.
Papers must not be submitted concurrently to another conference with
refereed proceedings. The PC chair should be informed of closely related
work submitted to a conference or a journal by March 24th, 2013. Papers
authored or co-authored by members of the Programme Committee are not
allowed.

SATELLITE EVENTS
The 14th International Workshop on Logic and Computational Complexity
(LCC'13) will be held on 6th of September 2013 as a satellite event of
CSL'13.
An international summer school on ?Linear logic and related topics? will
be held from 28th through 31st of August 2013 as a satellite event of
CSL'13.
Further details will appear on this page as soon as possible.
PROGRAM COMMITTEE
Zena Ariola (University of Oregon)
Arnon Avron (Tel-Aviv University)
Roberto Bagnara (University of Parma, and BUGSENG srl)
Christel Baier (Technical University of Dresden)
Marc Bezem (University of Bergen)
Paola Bruscoli (University of Bath, Computer Science Department)
Agata Ciabattoni (TU Wien)
Thierry Coquand (Chalmers University)
Ugo Dal Lago (Università di Bologna)
Valeria De Paiva (Nuance Communications)
Reinhard Kahle (CENTRIA and DM, UNL, Portugal)
Stephan Kreutzer (Technical University Berlin)
Olivier Laurent (CNRS - ENS Lyon)
Carsten Lutz (Universität Bremen)
Jean-Yves Marion (Université de Lorraine, LORIA)
Damian Niwinski (Warsaw University)
Frank Pfenning (Carnegie Mellon University)
Elaine Pimentel (UFMG)
Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS))
Simona Ronchi Della Rocca CHAIR (Università di Torino)
Jan Rutten (CWI)
Helmut Schwichtenberg (LMU Munich)
Phil Scott (Dept. of Math & Stats, U. Ottawa)
Peter Selinger (Dalhousie University)
Makoto Tatsuta (National Institute of Informatics)
Tachio Terauchi (Nagoya University)

ORGANIZING COMMITTEE
Erika De Benedetti (Dipartimento di Informatica, Torino)
Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica
(DISIT), Alessandria)
Mauro Piccolo (Dipartimento di Informatica, Torino)
Luca Padovani (Dipartimento di Informatica, Torino)
Luca Paolini (Dipartimento di Informatica, Torino)
Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino)
Luca Roversi (Dipartimento di Informatica, Torino)
Angelo Troina (Dipartimento di Informatica, Torino)



___________________________________________________________________________

3) [STACS 2013] Call for Participation
************************************************************************

STACS 2013 CALL FOR PARTICIPATION

30th International Symposium on Theoretical Aspects of Computer Science

February 27-March 2, 2013, Kiel, Germany

<http://www.stacs2013.uni-kiel.de>http://www.stacs2013.uni-kiel.de

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

The 30th International Symposium on Theoretical 
Computer Science (STACS) will be held from 
February 27 to March 2, 2013 (Wednesday through 
Saturday), on the premises of the Christian-Albrechts-Universität zu Kiel.

SCIENTIFIC PROGRAM
******************
The program, which is available at

   <http://www.stacs2013/uni-kiel.de/>http://www.stacs2013/uni-kiel.de/ ,

is composed of 54 contributed and three invited talks as well as a tutorial.

INVITED TALKS AND TUTORIAL
**************************
- Kousha Etessami, University of Edinburgh
   The complexity of analyzing infinite-state 
Markov chains, Markov decision processes, and stochastic games
- Kurt Mehlhorn, MPI Saarbrücken and Saarland University
   Physarum can compute shortest paths
- Stéphan Thomassé, Ecole Normale Supérieure de Lyon
   Graph Coloring, Communication Complexity and the Stubborn Problem
- Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial)
   Algorithmic Graph Structure Theory

REGISTRATION
************
Registration is through the conference website,

   <http://www.stacs2013.uni-kiel.de/>http://www.stacs2013.uni-kiel.de/ .

INFORMATION
***********
For detailed information on STACS 2013, visit the conference website,

   <http://www.stacs2013.uni-kiel.de/>http://www.stacs2013.uni-kiel.de/ .

IMPORTANT DATES
***************
Early registration deadline: Jan 14, 2013
Regular registration:       Jan 15 - Feb 14, 2013
Late registration:   Feb 15 - Mar 2, 2013
Symposium:               Feb 27 - Mar 2, 2013

CONTACT INFORMATION
*******************
<mailto:info at stacs2013.uni-kiel.de>info at stacs2013.uni-kiel.de
___________________________________________________________________________

4) TAMC 2013 The 10th Annual Conference on Theory 
and Applications of Models of Computation
===========================================================================
SECOND CALL FOR PAPERS:

                       TAMC 2013

       The 10th Annual Conference on Theory and Applications of
                   Models of Computation

              Hong Kong, China, 20-22 May 2013

               <http://www.cs.hku.hk/tamc2013/>http://www.cs.hku.hk/tamc2013/

===========================================================================

The 10th Annual Conference on Theory and Application of Models of
Computation (TAMC 2013 
<http://www.cs.hku.hk/tamc2013/>http://www.cs.hku.hk/tamc2013/) will be held in
Hong Kong, China, from May 20 to May 22, 2013. TAMC aims at bringing
together a wide range of researchers with interests in computational
theory and applications.

Hong Kong is situated on China's south coast and is famous for its
skyline. Hong Kong was a colony of the British Empire until 1997 when it
was returned to China. It now thrives under the principle of "one country,
two systems", enjoying a high degree of authority and independent
judiciary. Hong Kong is often described as "East meets West" and is one of
the world's leading international financial centers.

Come and visit Asia's vibrant world city
(<http://www.discoverhongkong.com/eng/index.jsp>www.discoverhongkong.com/eng/index.jsp) 
and join the conference at the
University of Hong Kong (according to 2012 QS World University Rankings
HKU ranked 23rd in the world and 1st in Asia).

The main themes of the conference are computability, complexity, and
algorithms. Typical but not exclusive topics of interest include:

algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
computability theory
computational biology, and biological computing
computational complexity
computational game theory
computational logic
computational geometry
continuous and real computation
cryptography
data structures
design and analysis of algorithms
distributed algorithms
fixed parameter tractability
graph algorithms
information and communication complexity
learning theory
natural computation
network algorithms, networks in nature and society
online algorithms
optimization
parallel algorithms
privacy and security
property testing
proof complexity
quantum computing
randomness, pseudo-randomness
randomized algorithms
streaming algorithms

IMPORTANT DATES -
Submission deadline:11:59 pm EST January 11, 2013
Notification of authors:February 22, 2013
Final versions deadline:March 8, 2013

Submission page:
<https://www.easychair.org/conferences/?conf=tamc2013>https://www.easychair.org/conferences/?conf=tamc2013.

Conference Chair:
Francis Chin (The University of Hong Kong)

Program Chair:
Lap Chi Lau (The Chinese University of Hong Kong)
Luca Trevisan (Stanford University)

Program Committee:
Andrej Bogdanov (The Chinese University of Hong Kong)
Hubert Chan (University of Hong Kong)
Ho-Lin Chen (National Taiwan University)
Jianer Chen (Texas A&M University)
Ning Chen (Nanyang Technological University)
Wei Chen (Microsoft Research Asia)
Xi Chen (Columbia University)
Francis Chin (The University of Hong Kong, Chair)
Marek Chrobak (UC Riverside)
Nicola Galesi (Universita di Roma La Sapienza)
Naveen Garg (IIT Dehli)
Navin Goyal (Microsoft Research India)
Nick Harvey (University of British Columbia)
Rahul Jain (National University of Singapore)
David Jao (University of Waterloo)
Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
Jochen Konemann (University of Waterloo)
Amit Kumar (IIT Delhi)
Lap Chi Lau (The Chinese University of Hong Kong, Co-chair)
Jian Li (Tsinghua University)
Rachel Lin (MIT and The Chinese University of Hong Kong)
Pinyan Lu (Microsoft Research Asia)
Mohammad Mahdian (Google Research)
Seffi Naor (Technion University)
Krzysztof Onak (IBM Research)
Periklis Papakonstantinou (Tsinghua University)
Seth Pettie (University of Michigan)
Atri Rudra (University at Buffalo, The State University of New York)
Alexander Russell (University of Connecticut)
Piotr Sankowski (University of Warsaw)
Rahul Santhanam (University of Edinburgh)
Anastasios Sidiropoulos (UIUC)
Mohit Singh (Microsoft Research Redmond)
Man Cho Anthony So (The Chinese University of Hong Kong)
John Steinberger (Tsinghua University)
Luca Trevisan (Stanford University, Co-chair)
Laszlo Vegh (London School of Economics)
David Woodruff (IBM Research)
Ke Yi (Hong Kong University of Science and Technology)
Qin Zhang (IBM Research and Indiana University)

Submission instructions:
* Authors should submit an extended abstract (not a full paper), online
at: 
<https://www.easychair.org/conferences/?conf=tamc2013>https://www.easychair.org/conferences/?conf=tamc2013

* The submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear comparison with
related work.

* The length of the extended abstract should not exceed ten (10)
letter-sized pages (not including bibliography and appendices.)

* Submitted papers must describe work not previously published. They must
not be submitted simultaneously to another conference with refereed
proceedings.

* Research that is already submitted to a journal may be submitted to
TAMC13, provided that (a) the PC chair is notified in advance that this is
the case, and (b) it is not scheduled for journal publication before the
conference.

Proceedings:
The TAMC proceedings will be published in the Lecture Notes in Computer
Science Series by Springer 
(<http://www.springer.com/lncs>http://www.springer.com/lncs).
Authors of accepted papers are expected to present their work at the
conference.

Special issues of the leading journals 'Theoretical Computer Science' and
'Mathematical Structures in Computer Science', devoted to a selected set
of accepted papers of the conference, are planned.

Steering Committee:
Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
S. Barry Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)

Local Organising Committee:
Hubert Chan, H.F. Ting, Zhang Yong

===========================================================================
Contact: <mailto:tamc at cs.hku.hk>tamc at cs.hku.hk
===========================================================================

___________________________________________________________________________

5) MCU 2013: Machines, Computations and 
Universality, Zuerich (Switzerland), 9-12 Sep 2013
Machines, Computations and Universality (MCU) 2013, the 6th conference
in the MCU series, will be hosted at the University of Zurich on
September 9-12, 2013.

<http://mcu2013.ini.uzh.ch/>http://mcu2013.ini.uzh.ch/


SCOPE

MCU explores computation in the setting of various discrete models
(Turing machines, register machines, cellular automata, tile assembly
systems, rewriting systems, neural models etc.) and analog and hybrid
models (BSS machines, infinite time cellular automata, real machines,
quantum computing etc.). There is particular (but not exclusive)
emphasis given towards the following:


1. the search for frontiers between decidability and undecidability in
the various models. (For example, what is the smallest number of pairs
of words for which the Post correspondence problem is undecidable, or
what is the largest state-symbol product for which the halting problem
is decidable for Turing machines.)


2. the search for the simplest universal models (such as small universal
Turing machines, universal rewriting systems with few rules, universal
cellular automata with small neighborhoods and a small number of states,
etc.)

3. the computational complexity of predicting the evolution of
computations in the various models. (For example, is it possible to
predict an arbitrary number of time steps for a model more efficiently
than explicit step by step simulation of the model.)

4. universality and undecidability in continuous models of computation.


IMPORTANT DATES

Submission: March 31, 2013
Notification: May 17, 2013
Final Version: June 14, 2013
Conference: September 9-12, 2013


PROGRAM COMMITTEE

Andrew Adamatzky      (University of the West of England, UK)
Matthew Cook         (University of Zurich and ETH Zurich) (co-chair)
Erzsébet Csuhaj-Varjú   (Eötvös Loránd University, Budapest, Hungary)
Jérôme Durand-Lose     (University of Orléans, France)
Rudolf Freund         (University of Vienna, Austria)
Gabriel Istrate      (Institute e-Austria, Timisoara, Romania)
Jarkko Kari         (University of Turku, Finland)
Lila Kari            (University of Western Ontario, London, Canada)
Kamala Krithivasan     (Indian Institute of Technology, Chennai, India)
Maurice Margenstern   (University of Lorraine, France)
Turlough Neary        (University of Zurich and ETH Zurich) (co-chair)
Matthew Pattitz      (University of Arkansas, Fayetteville, USA)
Igor Potapov         (University of Liverpool, UK)
Klaus Sutner         (Carnegie Mellon University, Pittsburgh, USA)
Sergey Verlan         (University of Paris Est, France)
Damien Woods         (California Institute of Technology, USA)


INVITED SPEAKERS

Liesbeth De Mol   (Ghent University, Belgium)
Jarkko Kari      (University of Turku, Finland)
Kenichi Morita     (Hiroshima University, Japan)
Erik Winfree      (California Institute of Technology, USA)
Damien Woods      (California Institute of Technology, USA)


PAPER PREPARATION AND SUBMISSION

Authors are invited to submit extended abstracts of no more than 12
pages via the EasyChair system at
<https://www.easychair.org/conferences/?conf=mcu2013>https://www.easychair.org/conferences/?conf=mcu2013. 
Submissions should
contain original research that has not previously been published.
Concurrent submissions to other conferences/journals is not permitted.
Supplementary material that exceeds the 12 page limit will be considered
at the committee?s discretion. Submissions must be in the form of a PDF
prepared using the EPTCS style file (available at
<http://style.eptcs.org/>http://style.eptcs.org/). 
The title page should include the title of the
paper, the names, affiliations and email addresses of each of the
authors, and an abstract of no more than 300 words.


CONFERENCE PROCEEDINGS

The proceedings will be published in Electronic Proceedings in
Theoretical Computer Science (EPTCS) and will be available at the
conference, and freely available online. For more information see the
EPTCS website at <http://about.eptcs.org/>http://about.eptcs.org/.

Following, the conference, authors of selected papers will be invited to
submit an extended version of their work to a special issue of an
international journal.
___________________________________________________________________________

6) WoLLIC 2013: Logic, Language, Information and 
Computation, Darmstadt (Germany), 20-23 Aug 2013
*WoLLIC 2013 *

*20**th** Workshop on Logic, Language, Information and Computation *

*August 20**th** to 23**rd**, 2013*

*Technische Universität Darmstadt
Darmstadt, Germany*


*Scientific Sponsorship*
*Interest Group in Pure and Applied Logics
(**IGPL*
*)*
*The Association for Logic, Language and Information
(**FoLLI*
*)*
*Association for Symbolic Logic (**ASL* *)*
*European Association for Theoretical Computer Science
(**EATCS*
*)*
*European Association for Computer Science Logic
(**EACSL*
*)*
*Sociedade Brasileira de Computação (**SBC* *)*
*Sociedade Brasileira de Lógica (**SBL* *)*

*Organisation*

*Fachbereich Mathematik*
*, **Technische Universität Darmstadt*
*, Germany
**Centro de Informática* *, **Universidade Federal
de Pernambuco* *, Brazil *


*Call for Papers*

WoLLIC  is an annual international forum on
inter-disciplinary research involving formal logic, computing and
programming theory, and natural language and reasoning. Each meeting
includes invited talks and tutorials as well as contributed papers. The
twentieth WoLLIC will be held at the Technische Universität Darmstadt,
Germany, from August 20th to 23rd, 2013. It is sponsored by the Association
for Symbolic Logic  (ASL), the Interest Group in
Pure and Applied Logics  (IGPL), the The
Association for Logic, Language and Information
  (FoLLI),
theEuropean Association for Theoretical Computer
Science (EATCS),
the European Association for Computer Science Logic
  (EACSL),
the Sociedade Brasileira de Computação  (SBC), and
the Sociedade Brasileira de Lógica  (SBL).


*Paper submission*
Contributions are invited on all pertinent subjects, with particular
interest in cross-disciplinary topics. Typical but not exclusive areas of
interest are: foundations of computing and programming; novel computation
models and paradigms; broad notions of proof and belief; formal methods in
software and hardware development; logical approach to natural language and
reasoning; logics of programs, actions and resources; foundational aspects
of information organization, search, flow, sharing, and protection.
Proposed contributions should be in English, and consist of a scholarly
exposition accessible to the non-specialist, including motivation,
background, and comparison with related works. They must not exceed 10
pages (in font 10 or higher), with up to 5 additional pages for references
and technical appendices. The paper's main results must not be published or
submitted for publication in refereed venues, including journals and other
scientific meetings. It is expected that each accepted paper be presented
at the meeting by one of its authors. Papers must be submitted
electronically at the WoLLIC 2012 EasyChair website. (Please go to
<http://wollic.org/wollic2013/instructions.html>http://wollic.org/wollic2013/instructions.html
for
instructions.) A title and single-paragraph abstract should be submitted by
March 25th, and the full paper by March 29th (firm date). Notifications are
expected by May 3rd, and final papers for the proceedings will be due by
May 15th (firm date).

*Proceedings*
The proceedings of WoLLIC 2013, including both invited and contributed
papers, will be published in advance of the meeting as a volume in
Springer's LNCS  series. In addition,
abstracts will be published in the Conference Report section of the *Logic
Journal of the IGPL*, and selected contributions will be published as a
special post-conference WoLLIC 2013 issue of a scientific journal (to be
confirmed).

*Invited Speakers*

   - *Natasha Alechina*  (University of
   Nottingham)
   - *Steve Awodey*  (Carnegie
   Mellon University)
   - *Mikolaj Bojanczyk*  (Warsaw
   University)
   - *Wim Martens*
(Universität
   Bayreuth)
   - *Catuscia Palamidessi*  (INRIA
   Saclay and LIX)
   - *Thomas Schwentick*
(TU
   Dortmund)


*Student Grants*
ASL sponsorship of WoLLIC 2013 will permit ASL student members to apply for
a modest travel grant (deadline: May 1st, 2013). See
<http://www.aslonline.org/studenttravelawards.html>http://www.aslonline.org/studenttravelawards.html 
for details.

*Important Dates*

   - *March 25th, 2013*: Paper title and abstract deadline* *
   - *March 29th, 2013*: Full paper deadline
   - May 3rd, 2013: Author notification
   - May 15th, 2013: Final version deadline (firm)


*Programme Committee*

   - Albert Atserias  (UPC Barcelona)
   - Alexandru Baltag
(Univ
   Amsterdam)
   - Stephanie Delaune  (ENS, CNRS)
   - Amy Felty  (Univ Ottawa)
   - Santiago Figueira  (Univ Buenos
   Aires)
   - Amelie Gheerbrant  (Univ
   Edinburgh)
   - Radha Jagadeesan  (DePaul Univ)
   - Delia Kesner  (Univ
   Paris-Diderot)
   - Benoit Larose
(Concordia
   Univ)
   - Leonid Libkin  (Univ Edinburgh
   - CHAIR)
   - Fenrong Liu  (Tsinghua Univ)
   - Jerzy Marcinkowski  (Wroclaw Univ)
   - Peter O'Hearn  (UCL)
   - Joël Ouaknine  (Oxford Univ)
   - Gerald Penn  (Univ Toronto)
   - Gabriele Puppis  (CNRS/LaBRI -
   Univ Bordeaux)
   - R. Ramanujam  (The Institute of
   Mathematical Sciences)
   - Peter Selinger  (Dalhousie Univ)
   - Szymon Torunczyk  (Warsaw Univ)
   - Anna Zamansky  (TU Wien)


*Steering Committee*

   - Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid
   Hodges, Daniel Leivant, Angus Macintyre, Grigori Mints, Luke Ong, Hiroakira
   Ono, Ruy de Queiroz.


*Organising Committee*

   - Ulrich Kohlenbach  (Tech U Darmstadt)
   (Local chair)
   - Anjolina G. de Oliveira  (U Fed
   Pernambuco)
   - Martin Otto  (Tech U
   Darmstadt)
   - Ruy de Queiroz  (U Fed Pernambuco)
   (co-chair)
   - Thomas Streicher  (Tech
   U Darmstadt)
   - Martin Ziegler  (Tech
   U Darmstadt)


*Further information*
Contact one of the Co-Chairs of the Organising Committee.

*Web page*
<http://wollic.org/wollic2013/>http://wollic.org/wollic2013/
___________________________________________________________________________

7) ICALP 2013: 2nd Call for Papers
(From Agnis Skuskovniks)

==============================
ICALP 2013: 2nd Call for Papers
==============================

The 40th International Colloquium on Automata, 
Languages and Programming (ICALP),
the main conference and annual meeting of the 
European Association for Theoretical Computer Science (EATCS),
will take place from the 8th to the 12th of July 2013 in Riga, Latvia.

The main conference will be preceded by a series of workshops,
taking place on Sunday, July 7th, 2013 (i.e., one day before ICALP).


Topics
======

Papers presenting original research on all 
aspects of theoretical computer science are sought.
Typical but not exclusive topics of interest are:

** Track A: Algorithms, Complexity and Games

* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Parameterized Algorithms and Complexity
* Randomness in Computation
* Quantum Computing

** Track B: Logic, Semantics, Automata and Theory of Programming

* Algebraic and Categorical Models
* Automata Theory, Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles of Programming Languages
* Logics, Formal Methods and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement and Verification
* Type Systems and Theory, Typed Calculi

** Track C: Foundations of Networked Computation: 
Models, Algorithms and Information Management

* Cloud Computing, Overlay Networks, P2P Systems
* Cryptography, Privacy, Security, Spam
* Distributed and Parallel Computing
* E-commerce, Auctions, Trust and Reputation
* Game Theory, Incentives, Selfishness
* Internet Algorithms
* Mobile and Complex Networks
* Natural and Physical Algorithms
* Network Information Management
* Sensor, Mesh, and Ad Hoc Networks
* Social Networks, Viral Marketing
* Specification, Semantics, Synchronization
* Web Mining, Searching, Ranking and Analysis
* Wireless and Optical Communication

Important Dates
===============

*** Submission Deadline: Feb 15, 2013
*** Author Notification: Apr 12, 2013
*** Final Manuscript Due: April 28, 2013
*** The conference: July 8-12, 2013


Paper Submissions
=================

Authors are invited to submit an extended 
abstract of no more than 12 pages in LNCS style presenting original research
on the theory of Computer Science. Submissions 
should indicate to which track (A, B, or C) the paper is submitted.
No prior publication or simultaneous submission 
to other publication outlets (either a conference or a journal) is allowed.
The proceedings will be published in the Lecture 
Notes in Computer Science Series by Springer-Verlag.

It is strongly recommended that submissions 
adhere to the specified format and length.
Submissions that are clearly too long may be 
rejected immediately. Material other than the abstract,
references and the first 12 pages may be 
considered as supplementary and will be read at the committee's discretion.


Best Paper Awards
=================

As in previous editions of ICALP, there will be 
best paper and best student paper awards for each track of the conference.
In order to be eligible for a best student paper 
award, a paper should be authored only by students and should be
marked as such upon submission.


Submission server
=================

Submissions should be contributed using the EasyChair system
(<http://www.easychair.org/conferences/?conf=icalp13>http://www.easychair.org/conferences/?conf=icalp13)

Submissions are due on February 15, 2013, 23:59 CET.


Invited Speakers
================

* Susanne Albers, Humboldt University
* Orna Kupferman, Hebrew University
* Paul Spirakis, University of Patras
* Daniel Marx, Hungarian Academy of Sciences
* Peter Widmayer, ETH Zürich


Conference Chair
================

R?si?? Freivalds, University of Latvia


Contact: <mailto:icalp2013 at gmail.com>icalp2013 at gmail.com
=============================

___________________________________________________________________________

8) DCFS 2013: First Call of Papers
Dear colleagues,

Enclosed you can find the Call for Papers for 
DCFS 2013, Descriptional Complexity of Formal Systems Workshop.
We hope that many of you will submit papers and will attend the workshop.

With best wishes,

Helmut Jürgensen  (University of London, Ontario)
Rogério Reis     (University of Porto)

PS.: We apologize for multiple posting.


--------------------

First Call for Papers -- DCFS 2013

15th International Workshop on Descriptional Complexity of Formal Systems

London, Ontario, Canada

July 22-25, 2013

<http://www.csd.uwo.ca/dcfs2013>http://www.csd.uwo.ca/dcfs2013

-------------------

DCFS 2013 will be held in London, Ontario, Canada, on July 22-25, 2013.
It will be preceded by CIAA in Halifax, Canada, 16-19 July.

Detailed information will be available at

   <http://www.csd.uwo.ca/dcfs2013>http://www.csd.uwo.ca/dcfs2013

The DCFS email address is: <mailto:dcfs2013 at csd.uwo.ca>dcfs2013 at csd.uwo.ca


Paper submissions are invited which fit into the 
general theme of the workshop.
In particular, we look for submissions in the following general areas -- this
list is not meant to be exclusive:

   - Automata, grammars, languages and other formal systems; various modes
   of operations and complexity measures.

   - Succinctness of description of objects, state-explosion-like phenomena.

   - Circuit complexity of Boolean functions and related measures.

   - Size complexity of formal systems.

   - Structural complexity of formal systems.

   - Trade-offs between computational models and mode of operation.

   - Applications of formal systems -- for instance in software and
   hardware testing, in dialogue systems,
   in systems modeling or in modeling natural languages-- and their complexity
   constraints.

   - Co-operating formal systems.

   - Size or structural complexity of formal systems for modeling
   natural languages.

   - Complexity aspects related to the combinatorics of words.

   - Descriptional complexity in resource-bounded or structure-bounded
   environments.

   - Structural complexity as related to descriptional complexity.

   - Frontiers between decidability and undecidability.

   - Universality and reversibility.

   - Nature-motivated (bio-inspired) architectures and unconventional models
   of computing.

   - Kolmogorov-Chaitin complexity, algorithmic information.

If in doubt, please feel free to ask for advice 
at the email address given above.

We invite original contributions to the field, 
but also look for exploratory expositions and
demonstrations of implementations.
The exact format of the workshop is still being 
discussed. Greater detail will be provided
both on the web site and the second call.


Submissions

Papers presenting original contributions 
concerning the topics of the conference are being
sought. Authors are invited to submit papers of no more than 12 pages
in LNCS-style LaTeX2e (available at
<http://www.springer.de/comp/lncs/authors.html>http://www.springer.de/comp/lncs/authors.html). 
Papers must be in
English and provide sufficient details to allow the program committee
to assess their merits.  Proofs omitted due to space constraints must
be put into an appendix to be read by the program committee members at
their discretion. Simultaneous submission to other conferences or
workshops with published proceedings is not allowed.

Papers will be submitted electronically in PDF, using the EasyChair system. Use
the following link for submission:

<http://www.easychair.org/conferences/?conf=dcfs2013>http://www.easychair.org/conferences/?conf=dcfs2013

The proceedings will be published in the Springer Lecture Notes in
Computer Science (LNCS) series and will be available at the
workshop. As in previous years, a special journal issue with full
versions of selected papers will be devoted to DCFS 2013.


Important Dates:

Submission Deadline: March 20, 2013
Notification of accepted papers: April 25, 2013
Final Version: May 8, 2013
Conference dates: July 22-25, 2013


Invited Speakers

Cezar Câmpeanu (University of Prince Edward Island, Charlotteteown, Canada)
Frank Drewes (Umeå Universitet, Sweden)
Pierre McKenzie (Université de Montréal, Canada)
Klaus Sutner (Carnegie Mellon University, Pittsburgh, US)


Program Committee

Viliam Geffert, Univerzita Pavol Jozefa ?afárika, Ko?ice, Slovakia
Galina Jirásková, Slovak Academy of Sciences, Ko?ice, Slovakia
Helmut Jürgensen, University of Western Ontario, London, Canada (Co-Chair)
Christos Kapoutsis, Université Paris Diderot, France
Lila Kari, University of Western Ontario, London, Canada
Stavros Konstantinidis, St. Mary's University, Halifax, Canada
Dexter Kozen, Cornell University, Ithaca, USA
Martin Kutrib, Universität Gießen, Germany
Andreas Malcher, Universität Gießen, Germany
Ian McQuillan, University of Saskatchewan, Saskatoon, Canada
Victor Mitrana, Universitatea Bucure?ti, Romania
Nelma Moreira, Universidade do Porto, Portugal
Beatrice Palano, Università degli Studi di Milano, Italy
Giovanni Pighizzini, Università degli Studi di Milano, Italy
Rogério Reis, Universidade do Porto, Portugal (Co-Chair)
Jaques Sakarovitch, CNRS/ENST, Paris, France
Kai Salomaa, Queen's University, Kingston, Canada
Jeffrey Shallit, University of Waterloo, Canada
Bianca Truthe, Otto-von-Guericke-Universität, Magdeburg, Germany


Steering Committee

Erzsébet Csuhaj-Varjú (Budapest, Hungary)
Jürgen Dassow (Magdeburg, Germany)
Helmut Jürgensen (London, ON, Canada)
Hing Leung (Las Cruces, New Mexico)
Giovanni Pighizzini (Milano, Italy) (Chair)
Detlef Wotschke (Frankfurt, Germany)


Organizing Committee

Helmut Jürgensen, University of Western Ontario
To be announced




___________________________________________________________________________

9) Ackermann Award 2013 - Call for Nominations
ACKERMANN AWARD 2013 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN
COMPUTER SCIENCE
  CALL FOR NOMINATIONS

Eligible for the 2013 Ackermann Award are PhD dissertations in topics
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution between
1.1.2011 and 31.12.2012. The deadline for submission is 15 April 2013.
Submission details follow below.
Nominations can be submitted from 1 January 2013 on and should be sent
to the chair of the Jury, Anuj Dawar, by e-mail: 
<mailto:anuj.dawar at cl.cam.ac.uk>anuj.dawar at cl.cam.ac.uk

The Award
The 2013 Ackermann award will be presented to the recipient(s) at the
annual conference of the EACSL (CSL'13), 2-5 September 2013, in Torino
(Italy). The award consists of

   * a diploma,
   * an invitation to present the thesis at the CSL conference,
   * the publication of the laudatio in the CSL proceedings,
   * travel support to attend the conference.

The jury is entitled to give more (or less) than one award per year.
Jury
The jury consists of:

   * Thierry Coquand (Chalmers University of Gothenburg);
   * Anuj Dawar (University of Cambridge), the president of EACSL;
   * Thomas A. Henzinger (IST Austria);
   * Daniel Leivant (Indiana University, Bloomington);
   * Damian Niwinski (University of Warsaw);
   * Luke Ong (University of Oxford), LICS representative;
   * Simona Ronchi Della Rocca (University of Torino), the
vice-president of EACSL;
   * Wolfgang Thomas (RWTH, Aachen).

How to submit
The candidate or his/her supervisor has to submit

    1. the thesis (ps or pdf file);
    2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file);
    3. a supporting letter by the PhD advisor and two supporting letters
by other senior faculty or researchers in equivalent positions (in
English); supporting letters can also be sent directly to Anuj Dawar
(<mailto:anuj.dawar at cl.cam.ac.uk>anuj.dawar at cl.cam.ac.uk);
    4. a short CV of the candidate;
    5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period
(scanned as pdf-file or faxed).

The submission should preferably be sent by e-mail as attachments to
professor Anuj Dawar:
<mailto:anuj.dawar at cl.cam.ac.uk>anuj.dawar at cl.cam.ac.uk
With the following subject line and text:

   * Subject: Ackermann Award Submission
   * Text: Name of candidate, list of attachments

Submission can be sent via several e-mail messages. If this is the case,
please indicate it in the text. Letters of support and documents can
also be faxed to:
Prof. Anuj Dawar
Ackermann Award
+44 1223 334678

The Jury has the right to declare submissions to be out of scope or not
to meet the requirements.


___________________________________________________________________________

10) UCNC 2013: 2nd call for papers
___________________________________________________________________

              12th International Conference on
      UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION

                       UCNC 2013

            previously Unconventional Computation

                      1-5 July 2013
                      Milano, Italy
      Co-located with Computability in Europe (CiE 2013)

               <http://ucnc2013.disco.unimib.it>http://ucnc2013.disco.unimib.it
                 <mailto:ucnc2013 at disco.unimib.it>ucnc2013 at disco.unimib.it

Important dates

* Submission deadline: 2 February 2013
* Notification to authors: 25 March 2013
* Final version: 1 May 2013
* Conference: 1-5 July 2013

UCNC 2013 is organised by Dipartimento di Informatica,
Sistemistica e Comunicazione (Department of Computer Science,
Systems and Communication) of Università degli Studi di
Milano-Bicocca.

Topics

The topics of the conference include all areas of unconventional
computation and natural computation, including (but not limited
to) quantum, cellular, molecular, neural, DNA, membrane, and
evolutionary computing; cellular automata; computation based on
chaos and dynamical systems; massive parallel computation;
collective intelligence; computation based on physical principles
such as relativistic, optical, spatial, collision-based
computing; amorphous computing; physarum computing;
hypercomputation. Both theoretical and experimental papers are
welcome.

Submissions

Authors are invited to submit original papers (at most 12 pages
in LNCS format) using <http://EasyChair.org>EasyChair.org, at

    <https://www.easychair.org/conferences/?conf=ucnc2013>https://www.easychair.org/conferences/?conf=ucnc2013

Papers must be submitted in Portable Document Format (PDF). The
revised version of the manuscripts, to appear in a LNCS volume by
Springer, must be prepared in LaTeX according to the LNCS format
(see 
<http://www.springer.com/computer/lncs/>http://www.springer.com/computer/lncs/ 
lncs+authors).

The papers must not have been submitted simultaneously to other
conferences with published proceedings. All accepted papers must
be presented at the conference.

The proceedings will be available at the conference venue.

Authors of accepted papers will be invited to submit an extended
and improved version of their contribution to a special issue of
an international journal.

Invited speakers

* Enrico Formenti (Université Nice Sophia Antipolis, France)
* John V. Tucker (Swansea University, UK)
* Xin Yao (University of Birmingham, UK)

Joint UCNC/CiE 2013 invited speakers

* Gilles Brassard (Université de Montréal, Canada)
* Grzegorz Rozenberg (Universiteit Leiden, Netherlands and
    University of Colorado Boulder, USA)
* Endre Szemerédi (Hungarian Academy of Sciences, Hungary and
    Rutgers University, USA)

Program committee

* Andrew Adamatzky (University of the West of England, UK)
* Selim G. Akl (Queen's University, Canada)
* Olivier Bournez (École Politechnique, France)
* Cristian S. Calude (University of Auckland, New Zealand)
* José Félix Costa (Techinical University of Lisbon, Portugal)
* Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Hungary)
* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
    Italy)
* Michael J. Dinneen (University of Auckland, New Zealand)
* Marco Dorigo (Université Libre de Bruxelles, Belgium)
* Jérôme Durand-Lose (Université d'Orléans, France)
* Masami Hagiya (University of Tokyo, Japan)
* Oscar H. Ibarra (University of California, Santa Barbara, USA)
* Jarkko Kari (University of Turku, Finland)
* Lila Kari (University of Western Ontario, Canada)
* Viv Kendon (University of Leeds, UK)
* Giancarlo Mauri (chair, Università degli Studi di
    Milano-Bicocca, Italy)
* Mario J. Pérez-Jiménez (Universidad de Sevilla, Spain)
* Kai Salomaa (Queen's University, Canada)
* Hava Siegelmann (University of Massachusetts Amherst, USA)
* Susan Stepney (University of York, UK)
* Hiroshi Umeo (Osaka Electro-Communication University, Japan)
* Leonardo Vanneschi (Universidade Nova de Lisboa, Portugal)
* Damien Woods (California Institute of Technology, USA)

Organising committee

* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
    Italy)
* Luca Manzoni (Università degli Studi di Milano-Bicocca, Italy)
* Giancarlo Mauri (chair, Università degli Studi di
    Milano-Bicocca, Italy)
* Antonio E. Porreca (Università degli Studi di Milano-Bicocca,
    Italy)

Satellite workshops

* Wivace 2013 (Workshop Italiano di Vita Artificiale e
    Computazione Evolutiva 2013 -- Italian Workshop on Artificial
    Life and Evolutionary Computation 2013)
    <http://wivace2013.disco.unimib.it>http://wivace2013.disco.unimib.it

The UCNC 2013 conference will be co-located with Computability in
Europe 2013 (CiE 2013, 
<http://cie2013.disco.unimib.it>http://cie2013.disco.unimib.it).

The two conferences will take place at the U6 building of
Università degli Studi di Milano-Bicocca, Piazza dell'Ateneo
Nuovo 1, Milano.

The previous editions of the conference took place at Auckland,
New Zealand (UMC 1998); Brussels, Belgium (UMC 2000); Kobe, Japan
(UMC 2002); Seville, Spain (UC 2005); York, UK (UC 2006);
Kingston, Canada (UC 2007); Vienna, Austria (UC 2008); Ponta
Delgada, Portugal (UC 2009); Tokyo, Japan (UC 2010); Turku,
Finland (UC 2011); Orleans, France (UCNC 2012).

___________________________________________________________________________

11) CiE 2013 Call For Papers
************************************************************************
         9th International Conference on COMPUTABILITY IN EUROPE

                   CiE 2013: The Nature of Computation
                               Milan, Italy
                            July  1 - 5, 2013

                     <http://cie2013.disco.unimib.it/>http://cie2013.disco.unimib.it 


co-located with Unconventional Computation and Natural Computation 2013

                      <http://ucnc2013.disco.unimib.it/>http://ucnc2013.disco.unimib.it

IMPORTANT DATES

Submission Deadline for LNCS:                   20 January 2013
Notification of authors:                        4 March 2013
Deadline for final revisions:                   1 April 2013

CiE 2013 is the ninth conference organised by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world. Previous meetings have taken place in Amsterdam (2005),
Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
Dalgada (2010), Sofia (2011) and Cambridge (2012).

TOPICS

CiE 2013 conference topics include, but not exclusively:

* Admissible sets
* Algorithms
* Analog computation
* Artificial intelligence
* Automata theory
* Bioinformatics
* Classical computability and degree structures
* Cognitive science and modelling
* Complexity classes
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational biology
* Computational creativity
* Computational learning and complexity
* Computational linguistics
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* DNA computing
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* Emerging and Non-standard Models of Computation
* Finite model theory
* Formal aspects of program analysis
* Formal methods
* Foundations of computer science
* Games
* Generalized recursion theory
* History of computation
* Hybrid systems
* Higher type computability
* Hypercomputational models
* Infinite time Turing machines
* Kolmogorov complexity
* Lambda and combinatory calculi
* L-systems and membrane computation
* Machine learning
* Mathematical models of emergence
* Molecular computation
* Morphogenesis and developmental biology
* Multi-agent systems
* Natural Computation
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebras and concurrent systems
* Programming language semantics
* Proof mining and applications
* Proof theory and computability
* Proof complexity
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Semantics and logic of computation
* Swarm intelligence and self-organisation
* Type systems and type theory
* Uncertain Reasoning
* Weak systems of arithmetic and applications

We particularly welcome submissions in emergent areas, such as
bioinformatics and natural computation, where they have a basic
connection with computability.


SUBMISSIONS

Authors of accepted papers are expected to present their work at the
conference. Each presentation will be 25 minutes long, including the
time for the eventual discussion. Submitted papers must describe work
not previously published, and they must neither be accepted nor under
review at a journal or at another conference with refereed proceedings.
Authors are required to submit their manuscripts electronically in PDF
using the LNCS style. Authors using LaTeX can download the needed macros
at Springer-Verlag site. Papers should not exceed 10 pages; full proofs
may appear in a clearly marked technical appendix which will be read at
the reviewers’ discretion.
The submission process is managed by EasyChair and is available at
<https://www.easychair.org/conferences/?conf=cie2013>https://www.easychair.org/conferences/?conf=cie2013.

The proceedings will be available at the conference venue.
The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

AWARDS & GRANTS

Springer-Verlag has graciously funded two awards that will be given
during the CiE 2013 Conference.

Best student paper

This prize will be awarded for the best student paper presented at CiE
2013, as judged by the Program Committee. A prize of 500 Euros will be
given to the author(s) of the best student-authored paper (or split
between more than one paper if there is a tie). In order to be
considered, a paper has to be submitted in the category 'Regular paper
(eligible for best student paper award)' on EasyChair.
Papers are eligible if all of its authors are full-time students at the
time of submission.


Best paper on Natural Computing

The prize consists of the four volumes of the Handbook of Natural
Computing (see 
<http://cie2013.disco.unimib.it/awards/>http://cie2013.disco.unimib.it/awards/). 
This prize will
be awarded to the best paper on Natural Computing presented at CiE 2013,
as judged by the Program Committee. A paper is eligible if its main
topic falls within the scope of Natural Computing, roughly defined as
the set of fields studied in the above handbook. The Program Committee
is the only judge of the relevance of a paper within the Natural
Computing scope. The authors of a paper eligible for the award must
indicate this in the submission notes.

Grants

The ASL, EATCS and Elsevier have decided to sponsor students. In
particular Elsevier under the Women in Computability program offers
funds for junior female researchers to attend CiE 2013. The applications
for ASL and Elsevier funds must be sent before April 1, 2013.
Preference will be given to researchers who present a paper (contributed
paper or informal talk), see 
<http://cie2013.disco.unimib.it/awards/>http://cie2013.disco.unimib.it/awards/ 
for
details.

INVITED SPEAKERS

Ulle Endriss (University of Amsterdam)
Lance Fortnow (Georgia Institute of Technology)
Anna Karlin (University of Washington)
Bernard Moret (Ecole Polytechnique Fédérale de Lausanne)
Mariya Soskova (Sofia University)
Endre Szemerédi (Hungarian Academy of Sciences, 
Rutgers University) joint CIE/UCNC 2013 speaker

TUTORIAL SPEAKERS (joint with UCNC 2013)

Gilles Brassard (Université de Montréal)
Grzegorz Rozenberg (Leiden Institute of Advanced 
Computer Science and University of Colorado at Boulder)

SPECIAL SESSIONS on

Algorithmic Randomness
          organizers: Mathieu Hoyrup, Andre Nies
Data Streams and Compression
          organizers: Paolo Ferragina, Andrew McGregor
Computational Complexity in the Continuous World
          organizers: Akitoshi Kawamura, Robert Rettinger
Computational Molecular Biology
          organizers: Alessandra Carbone, Jens Stoye
Computation in Nature
          organizers: Mark Daley, Natasha Jonoska
History of Computation
          organizers: Gerard Alberts, Liesbeth De Mol

PROGRAM COMMITTEE:

* Gerard Alberts (Amsterdam)          * Luís Antunes (Porto)
* Arnold Beckmann (Swansea)           * Laurent Bienvenu (Paris)
* Paola Bonizzoni (Milan, co-chair)   * Vasco 
Brattka (Munich and Cape Town, co-chair)
* Cameron Buckner (Houston TX)        * Bruno Codenotti (Pisa)
* Stephen Cook (Toronto ON)           * Barry Cooper (Leeds)
* Ann Copestake (Cambridge)           * Erzsébet Csuhaj-Varjú (Budapest)
* Anuj Dawar (Cambridge)              * Gianluca Della Vedova (Milan)
* Liesbeth De Mol (Gent)              * Jérôme Durand-Lose (Orléans)
* Viv Kendon (Leeds)                  * Bjørn Kjos-Hanssen (Honolulu, HI)
* Antonina Kolokolova (St. John’s NF) * Benedikt Löwe (Amsterdam)
* Giancarlo Mauri (Milan)             * Rolf Niedermeier (Berlin)
* Geoffrey Pullum (Edinburgh)         * Nicole Schweikardt (Frankfurt)
* Sonja Smets (Amsterdam)             * Susan Stepney (York)
* S. P. Suresh (Chennai)              * Peter van Emde Boas (Amsterdam)


Contact: Paola Bonizzoni - bonizzoni at 
<http://disco.unimib.it/>disco.unimib.it
Website: <http://cie2013.disco.unimib.it/>http://cie2013.disco.unimib.it
************************************************************************




___________________________________________________________________________

12) TLCA 2013 Last Call for Papers
================================================================
TLCA 2013 Last Call for Papers

11th International Conference on
Typed Lambda Calculi and Applications
Eindhoven, 23-28 June 2013
co-located with RTA 2013 as part of RDP 2013

TLCA 2013 webpage: 
<http://www.kurims.kyoto-u.ac.jp/tlca2013/>http://www.kurims.kyoto-u.ac.jp/tlca2013/
RDP 2013 webpage: 
<http://www.win.tue.nl/rdp2013/>http://www.win.tue.nl/rdp2013/

*** Title and abstract due  25 January 2013 ***
*** Deadline for submission  1 February 2013 ***

================================================================

The 11th International Conference on Typed Lambda Calculi
and Applications (TLCA 2013) is a forum for original
research in the theory and applications of typed lambda
calculus, broadly construed.
Suggested, but not exclusive, list of topics for submission are:

* Proof-theory: natural deduction, sequent calculi, cut elimination
   and normalization, propositions as types, linear logic and proof
   nets, type-theoretic aspects of computational complexity
* Semantics: denotational semantics, game semantics, realisability,
   domain theory, categorical models
* Types: subtypes, dependent types, polymorphism, intersection types
   and related approaches, type inference and type checking, types in
   program analysis and verification, types in proof assistants
* Programming: foundational aspects of functional programming,
   object-oriented programming and other programming paradigms,
   flow analysis of higher-type computation, program equivalence,
   program transformation and optimization

INVITED SPEAKERS

* Simon Peyton-Jones (Microsoft Cambridge, UK) Joint invited speaker for
RTA+TLCA 2013
* Hugo Herbelin (INRIA, France) invited speaker for TLCA 2013
* Damiano Mazza (Universite Paris-Nord, France) invited speaker for TLCA
2013


IMPORTANT DATES

* Paper Registration (titles & short abstracts): 25 January 2013
* Full Paper Submission: 1 February 2013
* Author Notification: 22 March 2013
* Camera-Ready Paper for the Proceedings: 12 April 2013


SUBMISSION GUIDELINES

We solicit submissions of research papers, which must:
* be in English and not exceed 15 pages (including figures and
   bibliography). Additional material intended for the reviewers
   but not for publication in the final version - for example
   details of proofs - may be placed in a clearly marked appendix
   that is not included in the page limit. Reviewers will be told
   that they may choose to ignore the appendix.
* present original research which is unpublished and not submitted
   elsewhere (conferences, journals, books, etc.)
* use the Springer-Verlag LNCS style.
* be submitted electronically in PDF via the EasyChair TLCA 2013
   Submission Webpage
   <https://www.easychair.org/conferences/?conf=tlca2013>https://www.easychair.org/conferences/?conf=tlca2013 
.

Submissions deviating from these instructions may be rejected
without review. A condition of submission is that, if accepted,
one of the authors must attend the conference to give the
presentation. The proceedings will be published as a volume
in the ARCoSS subline series of Springer-Verlag Lecture Notes in
Computer Science. Final papers will be in the format specified by
Springer-Verlag. Any questions regarding the submission guidelines
should be directed to the Programme Committee Chair
(Masahito Hasegawa ) prior to
submitting.


COLOCATED EVENTS

TLCA 2013 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2013), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2013) and several related events. Details on
workshops affiliated with RDP 2013 will be available at the web
site in due course.


CONFERENCE CHAIR

Herman Geuvers (Radboud University Nijmegen, Netherlands)


PROGRAMME COMMITTEE CHAIR

Masahito Hasegawa (Kyoto University, Japan)


PROGRAMME COMMITTEE

Andreas Abel (LMU Munchen, Germany)
Patrick Baillot (CNRS and ENS Lyon, France)
Nick Benton (Microsoft Cambridge, UK)
Lars Birkedal (IT University of Copenhagen, Denmark)
Herman Geuvers (Radboud University Nijmegen, Netherlands)
Masahito Hasegawa (Kyoto University, Japan) (PC chair)
Naoki Kobayashi (University of Tokyo, Japan)
Paul-Andre Mellies (CNRS and Universite Paris Diderot, France)
Thomas Streicher (TU Darmstadt, Germany)
Lorenzo Tortora de Falco (Universita Roma Tre, Italy)
Stephanie Weirich (University of Pennsylvania, US)


TLCA STEERING COMMITTEE

Samson Abramsky (University of Oxford, UK)
Henk Barendregt (Radboud University Nijmegen, Netherlands)
Pierre-Louis Curien (CNRS and Universite Paris Diderot, France)
Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy)
Martin Hofmann (LMU Munchen, Germany)
Luke Ong (University of Oxford, UK)
Simona Ronchi Della Rocca (Universita di Torino, Italy)
Pawel Urzyczyn (University of Warsaw, Poland)


TLCA HONORARY ADVISOR

Roger Hindley (Swansea University)


TLCA PUBLICITY CHAIR

Luca Paolini (Universita di Torino, Italy)
___________________________________________________________________________

13) Permanent Academic Positions (Computational 
Logic/Functional Programming) in Dundee Deadline 23 January
         ******   Dundee Fellowships   ******
        <http://www.dundee.ac.uk/dundeefellows/>http://www.dundee.ac.uk/dundeefellows/

University of Dundee announces several permanent positions, with a
5-year starting period of a Research Fellowship.
One of the named priority areas is Computational Logic/ Functional
Programming / Verification.

  For more details, see below or email me:
Katya Komendantskaya


                  School of Computing
                  University of Dundee
                  Dundee Fellowship
                   Permanent position

           Closing Date for applications: Wednesday 23 January 2013.

University of Dundee  is advertising a series of permanent academic jobs
across the College of Arts & Science and Engineering, named Dundee Fellows.
The aim is to bring in a series of excellent academics onto permanent contracts
(subject to the completion of 3 year probation) into any research area
within the
College.  These staff will be labelled as Dundee Fellows during their
first 5 years,
over which time they will receive enhanced staff development and a
research focus
to their duties, while automatically moving to a regular academic
contract (lecturer,
senior lecturer, reader or professor) at the end of these 5 years.
These will be independent researchers (and not postdocs under supervision).
Their teaching load will start low, and will gradually increase over
the first 5 years,
to phase them into teaching.

As the University of Dundee moves towards its 25 year vision of becoming
Scotland?s leading University, we are actively investing in the next generation
of our academic community.  Our Dundee Fellows scheme offers exciting
opportunities to outstanding, high potential, early career researchers of any
age to establish themselves at the University of Dundee and develop towards
making a full and excellent contribution to research, teaching and leadership
in their chosen field.


Full details are available here: 
<http://www.dundee.ac.uk/dundeefellows/>http://www.dundee.ac.uk/dundeefellows/


___________________________________________________________________________




More information about the FOM mailing list