[FOM] CiE Newsletter No.62, October 15, 2012
Olivier Bournez
martin at eipye.com
Mon Oct 15 16:15:24 EDT 2012
CiE Newsletter No.62, October 15th 2012.
Please send any items you would like included in
next letter to Olivier Bournez (bournez at lix.polytechnique.fr)
DEADLINE: November 10th 2012.
___________________________________________________________________________
** 2012 - THE ALAN TURING YEAR
For the latest news on the ALAN TURING YEAR,
please go to http://www.mathcomp.leeds.ac.uk/turing2012/
** 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.
___________________________________________________________________________
CONTENTS
1) 2013 IEEE Conference on Computational Complexity
2) Call for workshop proposals at LICS 2013
3) Topical Research Meetings on Physics:
Quantum technologies: taking concepts through to implementations
4) LICS 2013: Logic in Computer Science, New
Orleans LA, U.S.A., 25-28 June 2013
5) FSFLA 2012: final announcement
6) FSNC 2012: 3rd announcement
7) Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory
8) FCT 2013 (Pre-announcement), University of Liverpool, Aug 19-21, 2013
9) CFP : UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION
10) 8th International Computer Science
Symposium in Russia (CSR 2013) - Call for Papers
11) LATA 2013: 3rd call for papers
___________________________________________________________________________
1) 2013 IEEE Conference on Computational Complexity
Dear complexity theorist,
The call for papers for the 2013 IEEE Conference on Computational
Complexity is now available from the conference website
http://computationalcomplexity.org. Note that the website has been
redesigned so you may need to refresh the page (ctrl-r) to see the new
version.
The submission deadline is November 30, 2012. The conference will take
place June 4-7 in Palo Alto, California, and will be collocated and
partly overlap with STOC.
___________________________________________________________________________
2) Call for workshop proposals at LICS 2013
**********************************************************
Call for Workshop Proposals
LICS 2013
28th ACM/IEEE Symposium on Logic In Computer Science
http://www2.informatik.hu-berlin.de/lics/lics13/
**********************************************************
The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science
(LICS 2013) will be held in New Orleans, USA, 25--28 June 2013. It
will be colocated with MFPS (Mathematical Foundations of Programming
Semantics) and CSF (IEEE Computer Security Foundations). Possible
dates for workshops are Monday 24 June, Friday 28 June afternoon, and
Saturday 29 June.
Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic - broadly construed - to computer
science or related fields. Typically, LICS workshops feature a number
of invited speakers and a number of contributed presentations. LICS
workshops do not usually produce formal proceedings. However, in the
past there have been special issues of journals based in part on
certain LICS workshops.
Proposals should include:
- A short scientific summary and justification of the proposed
topic. This should include a discussion of the particular benefits
of the topic to the LICS community.
- A discussion of the proposed format and agenda.
- The proposed duration, which is typically one day (two-day
workshops can be accommodated too).
- Your preferred dates. This is important!
- Let us know if you would like your workshop to be a joint
workshop with CSF. In that case you should submit to both.
- Procedures for selecting participants and papers.
- Expected number of participants. This is important!
- Potential invited speakers.
- Plans for dissemination (for example, special issues of journals).
Proposals should be submitted via Easychair at
https://www.easychair.org/conferences/?conf=licsworkshops2013
**********************************************************
Important dates:
Submission deadline: November 26, 2012
Notification: December 20, 2012
Program of the workshops ready: April 30, 2013
Workshops: June 24, 2013 or June 28-29, 2013
LICS conference: June 25-28, 2013
**********************************************************
The workshops selection committee consists of the LICS General Chair
(Luke Ong), LICS Workshops Chair (Patricia Bouyer-Decitre), LICS 2013
PC Chair (Orna Kupferman) and LICS 2013 Conference Chair (Mike Mislove).
___________________________________________________________________________
3) Topical Research Meetings on Physics: Quantum
technologies: taking concepts through to implementations
Please circulate!
Abstract submission deadline: 15 October 2012
Registration deadline: 10 December 2012
(Abstracts the usual IoP 250 words submitted online.)
Topical Research Meetings on Physics: Quantum technologies:
takingconcepts through to implementations
http://qtech.iopconfs.org/
17- 18 December 2012, Institute of Physics, London, UK
It is now recognised worldwide that new Quantum Technologies
(QT), based on quantum rather than classical laws and
underpinned by Quantum Information (QI) research, have real
potential for commercial development and impact. QT have
been recognised by EPSRC as a Grand Challenge and QI
research has been identified as a UK strength, to be grown
in the new EPSRC Portfolio.
The meeting will cover the whole range of new quantum
technologies, from existing technologies through to the long
term grand challenges, linking theory to experiment and concepts
to implementations.
Topics:
- Quantum communication
- Memory and networking technologies
- Quantum metrology and sensing technologies
- Quantum simulation and computing technologies.
To encourage and facilitate the participation of
early-career researchers and PhD students, short contributed
talks and a poster session form key aspects of this meeting.
Further key features are a summary session to address the
technology vision, and discussion of funding opportunities
and the routes to further investment.
Invited speakers include:
K Banaszek (University of Warsaw, Poland)
J Dowling (Louisiana State University, USA)
J Hwang (Imperial College London, UK)
A Kuhn (University of Oxford, UK)
L Molenkamp (University of Würzburg, Germany)
J G Rarity (University of Bristol, UK)
C F Roos (Univeristy of Innsbruck, Austria)
R Renner (ETH Zurich, Switzerland)
A Wallraff (ETH Zurich, Switzerland)
P Zoller (Univeristy of Innsbruck, Austria)
Scientific organisers:
Professor Timothy P Spiller (University of Leeds, UK)
Professor Ian Walmsley (University of Oxford, UK)
For more information please go to http://qtech.iopconfs.org/
___________________________________________________________________________
4) LICS 2013: Logic in Computer Science, New
Orleans LA, U.S.A., 25-28 June 2013
CALL FOR PAPERS
Twenty-Eighth Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS 2013)
June 25-28, 2013, New Orleans, USA
http://www2.informatik.hu-berlin.de/lics/lics13/
LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA,
from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13
(23-25 June) and CSF13 (28-30 June).
The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic, broadly construed.
We invite submissions on topics that fit under that rubric. Suggested, but
not exclusive, topics of interest include: automata theory, automated
deduction, categorical models and logics, concurrency and distributed
computation, constraint programming, constructive mathematics, database
theory, decision procedures, description logics, domain theory, finite model
theory, theory of automatic structures, formal aspects of program analysis,
formal methods, foundations of computability, higher-order logic, lambda
and combinatory calculi, linear logic, logic in artificial intelligence, logic
programming, logical aspects of bioinformatics, logical aspects of
computational complexity, logical aspects of quantum computation,
logical frameworks, logics of programs, modal and temporal logics,
model checking, probabilistic systems, process calculi, programming
language semantics, proof theory, real-time systems, reasoning about
security, rewriting, type systems and type theory, and verification.
Important Dates:
Authors are required to submit a paper title and a short abstract of about
100 words in advance of submitting the extended abstract of the paper.
Titles & Short Abstracts Due : January 7, 2013
Extended Abstracts Due : January 14, 2013
Author Notification (approximate) : March 22, 2013
Final Versions Due for Proceedings: April 26, 2013
Deadlines are firm; late submissions will not be considered. All submissions
will be electronic via http://easychair.org/conferences/?conf=lics2013.
Submission Instructions:
Every extended abstract must be submitted in the IEEE Proceedings 2-column
10pt format and may not be longer than 10 pages, including references.
LaTeX style files will be available on the conference website. The extended
abstract must be in English and provide sufficient detail to allow the
program committee to assess the merits of the paper. It should begin with
a succinct statement of the issues, a summary of the main results, and
a brief explanation of their significance and relevance to the conference
and to computer science, all phrased for the non-specialist. Technical
development directed to the specialist should follow. References and
comparisons with related work must be included. (If necessary, detailed
proofs of technical results may be included in a clearly-labeled appendix,
to be consulted at the discretion of program committee members.) Extended
abstracts not conforming to the above requirements will be rejected without
further consideration. Papers selection will be merit-based, with no a priori
limit on the number of accepted papers. Results must be unpublished and not
submitted for publication elsewhere, including the proceedings of other
symposia or workshops. The program chair must be informed, in advance of
submission, of any closely related work submitted or about to be submitted
to a conference or journal. Authors of accepted papers are expected to sign
copyright release forms. One author of each accepted paper is expected to
present it at the conference.
Short Presentations:
A session of short presentations, intended for descriptions of student
research, works in progress, and other brief communications, is planned.
These abstracts will not be published. Dates and guidelines will be
posted on the LICS website.
Kleene Award for Best Student Paper:
An award in honor of the late Stephen C. Kleene will be given
for the best student paper(s), as judged by the program committee.
Special Issues:
Full versions of up to three accepted papers, to be selected by the program
committee, will be invited for submission to the Journal of the ACM.
Additional selected papers will be invited to a special issue of Logical
Methods in Computer Science.
Sponsorship:
The symposium is sponsored by the IEEE Technical Committee on Mathematical
Foundations of Computing and by ACM SIGACT, in cooperation with the Association
for Symbolic Logic and the European Association for Theoretical
Computer Science.
Program Chair:
Orna Kupferman, Hebrew University
Program Committee:
Parosh A. Abdulla, Uppsala University
Amal Ahmed, Northeastern Universtiy
Sergei Artemov, City University of New York
Andrei Bulatov, Simon Fraser University
Yijia Chen, Shanghai Jiao Tong University
Veronique Cortier, CNRS, Loria
Mariangiola Dezani-Ciancaglini, Univ. di Torino
Thomas Ehrhard, CNRS, Universite Paris Diderot
Javier Esparza, Technische Universitaet Muenchen
Kousha Etessami, University of Edinburgh
Maribel Fernandez, King?s College London
Santiago Figueira, University of Buenos Aires
Simon Gay, University of Glasgow
Martin Grohe, Humboldt-Universitaet zu Berlin
Martin Hofmann, LMU Munich
Petr Jancar, Technical University Ostrava
Barbara Jobstmann, CNRS, Verimag and Jasper DA
Patricia Johann, University of Strathclyde
Bakhadyr Khoussainov, The University of Auckland
Antonina Kolokolova, University of Newfoundland
Victor Marek, University of Kentucky
Angelo Morzenti, Politecnico di Milano
Lawrence Moss, Indiana University
Madhavan Mukund, Chennai Math. Institute
Anca Muscholl, Universite Bordeaux
Mogens Nielsen, Aarhus University
Catuscia Palamidessi, INRIA, Ecole Polytechnique
Luc Segoufin, INRIA, ENS Cachan
Natarajan Shankar, SRI International
Alexandra Silva, Radboud University Nijmegen
Balder ten Cate, UC Santa Cruz
Kazushige Terui, Kyoto University
Ron van der Meyden, Univ. of New South Wales
Jeannette M. Wing, Carnegie Mellon University
Nobuko Yoshida, Imperial College London
Conference Chair:
Mike Mislove, Tulane University
Workshop Chair:
Patricia Bouyer-Decitre, CNRS, ENS Cachan
Publicity Chair:
Andrzej Murawski, Univ. of Leicester
General Chair:
Luke Ong, University of Oxford
Organizing Committee:
Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame,
Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum
Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna
Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman,
Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej
Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys,
Matt Valeriote
Advisory Board:
Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry
Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller,
John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin,
Moshe Vardi, Glynn Winskel
___________________________________________________________________________
5) FSFLA 2012: final announcement
*********************************************************************
2012 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS
FSFLA 2012
(formerly International PhD School in Formal Languages and Applications)
Tarragona, Spain
October 29 ? November 2, 2012
Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/fsfla2012/
*********************************************************************
AIM:
FSFLA 2012 offers a broad and intensive series of
lectures at different levels on selected topics
in language and automata theory and their
applications. The students choose their preferred
courses according to their interests and
background. Instructors are top names in their
respective fields. The School intends to help
students initiate and foster their research career.
The previous event in this series was FSFLA 2011
(http://grammars.grlmc.com/fsfla2011/).
ADDRESSED TO:
Graduate (and advanced undergraduate) students
from around the world. Most appropriate degrees
include: Computer Science and Mathematics. Other
students (for instance, from Linguistics,
Electrical Engineering, Molecular Biology or
Logic) are welcome too provided they have a good
background in discrete mathematics.
The School is appropriate also for people more
advanced in their career who want to keep
themselves updated on developments in the field.
There is no overlap in the class schedule.
COURSES AND PROFESSORS:
- Eric Allender (Rutgers), Circuit Complexity:
Recent Progress in Lower Bounds [introductory/advanced, 8 hours]
- Amihood Amir (Bar-Ilan), Periodicity and
Approximate Periodicity in Pattern Matching [introductory, 6 hours]
- Ahmed Bouajjani (Paris 7), Automated
Verification of Concurrent Boolean Programs [introductory/advanced, 8 hours]
- Bruno Courcelle (Bordeaux), Automata for
Monadic Second-order Model Checking [intermediate, 8 hours]
- Jörg Flum (Freiburg), The Halting Problem for
Turing Machines [introductory/advanced, 6 hours]
- Aart Middeldorp (Innsbruck), Termination of
Rewrite Systems [introductory/intermediate, 8 hours]
REGISTRATION:
It has to be done on line at
http://grammars.grlmc.com/fsfla2012/Registration.php
FEES:
They are variable, depending on the number of
courses each student takes. The rule is:
1 hour =
- 10 euros (for payments until June 2, 2012),
- 12.50 euros (for payments between June 3 and August 15, 2012),
- 15 euros (for payments after August 15, 2012).
PAYMENT PROCEDURE:
The fees must be paid to the School's bank account:
Uno-e Bank
bank?s address: Julian Camarillo 4 C, 28037 Madrid, Spain
IBAN: ES3902270001820201823142
SWIFT/BIC code: UNOEESM1
account holder: Carlos Martin-Vide GRLMC
account holder?s address: Av. Catalunya 35, 43002 Tarragona, Spain
Please mention FSFLA 2012 and your name in the
subject. A receipt will be provided on site.
Remarks:
- Bank transfers should not involve any expense for the School.
- People claiming early registration will be
requested to prove that the bank transfer order
was carried out by the deadline.
- Students may be refunded only in the case when
a course gets cancelled due to the unavailability of the instructor.
People registering on site at the beginning of
the School must pay in cash. For the sake of
local organization, however, it is much recommended to do it earlier.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Students will be delivered a certificate stating
the courses attended, their contents, and their duration.
IMPORTANT DATES:
Announcement of the programme: March 24, 2012
Starting of the registration: March 24, 2012
Very early registration deadline: June 2, 2012
Early registration deadline: August 15, 2012
Starting of the School: October 29, 2012
End of the School: November 2, 2012
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu at urv.cat
WEBSITE:
http://grammars.grlmc.com/fsfla2012/
POSTAL ADDRESS:
FSFLA 2012
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Diputació de Tarragona
Universitat Rovira i Virgili
___________________________________________________________________________
6) FSNC 2012: 3rd announcement
*********************************************************************
2012 INTERNATIONAL FALL SCHOOL IN NATURAL COMPUTING
FSNC 2012
Tarragona, Spain
November 19-23, 2012
Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/fsnc2012/
*********************************************************************
AIM:
FSNC 2012 offers a broad and intensive series of
lectures at different levels on selected topics
in nature-inspired computing. The students choose
their preferred courses according to their
interests and background. Instructors are top
names in their respective fields. The School
intends to help students initiate and foster their research career.
ADDRESSED TO:
Graduate (and advanced undergraduate) students
from around the world. Most appropriate degrees
include: Computer Science, Biology, Neuroscience,
Physics and Mathematics. Other students (for
instance, from Engineering or Information Sciences) are welcome too.
The School is appropriate also for people more
advanced in their career who want to keep
themselves updated on developments in the field.
There is no overlap in the class schedule.
COURSES AND PROFESSORS:
- Andries P. Engelbrecht (Pretoria), Learning
from Zero-Knowledge [intermediate/advanced, 6 hours]
- Etienne E. Kerre (Gent), Basic Principles of
Fuzzy Set Theory [introductory, 8 hours]
- Xiaodong Li (Royal Melbourne Institute of
Technology), Advances in Particle Swarm
Optimization [introductory/advanced, 6 hours]
- Leandro Nunes de Castro (Mackenzie
Presbiterian, São Paulo), Introduction to
Evolutionary Data Clustering [introductory/intermediate, 6 hours]
- Sankar K. Pal (Indian Statistical Institute,
Kolkata), Granular Mining in Soft Computing and
Pattern Recognition [introductory/advanced, 4 hours]
- Ned Seeman (New York), Structural DNA
Nanotechnology [introductory/advanced, 10 hours]
- Tatsuya Suda (University Netgroup Inc.,
Irvine), Molecular Communication and the
Bio-networking Architecture [introductory/intermediate, 6 hours]
REGISTRATION:
It has to be done on line at
http://grammars.grlmc.com/fsnc2012/Registration.php
FEES:
They are variable, depending on the number of
courses each student takes. The rule is:
1 hour =
- 10 euros (for payments until September 24, 2012),
- 12.50 euros (for payments between September 25 and October 22, 2012),
- 15 euros (for payments after October 22, 2012).
PAYMENT PROCEDURE:
The fees must be paid to the School's bank account:
Uno-e Bank
bank?s address: Julian Camarillo 4 C, 28037 Madrid, Spain
IBAN: ES3902270001820201823142
SWIFT/BIC code: UNOEESM1
account holder: C. Martin ? GRLMC
account holder?s address: Av. Catalunya 35, 43002 Tarragona, Spain
Please mention FSNC 2012 and your name in the
subject. A receipt will be provided on site.
Remarks:
- Bank transfers should not involve any expense for the School.
- People claiming early registration will be
requested to prove that the bank transfer order
was carried out by the deadline.
- The organizers reserve the right to cancel a
course if the number of students who signed up for it is less than 10.
- Students will be refunded only in the case when
a course gets cancelled due to the unavailability
of the instructor or because of insufficient registration numbers.
People registering on site at the beginning of
the School must pay in cash. For the sake of
local organization, however, it is much recommended to do it earlier.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Students will be delivered a certificate stating
the courses attended, their contents, and their duration.
IMPORTANT DATES:
Announcement of the programme: August 27, 2012
Very early registration deadline: September 24, 2012
Early registration deadline: October 22, 2012
Starting of the School: November 19, 2012
End of the School: November 23, 2012
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu at urv.cat
WEBSITE:
http://grammars.grlmc.com/fsnc2012/
POSTAL ADDRESS:
FSNC 2012
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Diputació de Tarragona
Universitat Rovira i Virgili
___________________________________________________________________________
7) Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory
---------------------------------------------------------------------
Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory
---------------------------------------------------------------------
http://www.al.ics.saitama-u.ac.jp/elc/en/?pd
The newly established Center for Exploring the Limits of Computation
(CELC, Tokyo, Japan) seeks applications for four post-doctoral fellow
positions in Computational Complexity Theory and related areas. The
appointments are for two years starting in April 2013 (or as soon as
possible). A monthly salary of approximately 350,000 Japanese yen
plus a research allowance will be offered. Applicants should hold a
PhD in theoretical computer science or related fields (or be expected
to do so by July 2013).
Two of the fellows will be based at the Tokyo site (Tokyo Institute of
Technology and the CELC) and two at the Kyoto site (Kyoto University).
Collaboration with other research groups of the ELC project (including
visits for several months) will be encouraged and supported.
Applications should include
* a curriculum vitae,
* list of publications,
* a research statement, and
* three letters of referees (to be sent directly from the referees).
Applications and letters of referees should be sent via email to
elc-pd-application at is.titech.ac.jp. Priority will be given to
applications received by December 20, 2012. Applicants may be invited
to an interview in early 2013 (the travel expenses will be covered).
---------
About ELC
---------
Exploring the Limits of Computation (ELC) is a five-year research
project funded by the Japanese Ministry of Education, Culture, Sports,
Science and Technology.
Project Title (formal):
A multifaceted approach toward understanding the limitations of computation
Short Title: Exploring the Limits of Computation (ELC)
Project Term: 2012.7 - 2017.3
Researchers have proposed various techniques for investigating the
limits of computation, many of which have been sharpened in depth
during the last two decades. We may soon be entering the stage of
expecting some big breakthrough results toward understanding the
limits of computation.
In this project, we investigate these techniques and relationships
among them with the goal of finding the next steps toward a big
breakthrough. We propose the following three lines of research, each
of which will be conducted by three core research groups (i.e., nine
core research groups altogether).
A. Team for pushing the current frontier of research on the limits of
computation.
B. Team for investigating the limits of computation by using various
algorithmic/optimization techniques (even by using supercomputers).
C. Team for introducing new approaches to and interpretations of the
existing techniques for investigating the limits of computation.
We also create a research center (CELC) in Tokyo for investigating
computational complexity theory by stimulating worldwide
collaborations among researchers based on our core research groups,
hosting short/long term visitors and postdoctoral researchers, and
organizing various meetings and workshops. We welcome researchers
working on subjects related to computational complexity theory to join
us for various occasions.
Project webpage (currently under construction)
http://www.al.ics.saitama-u.ac.jp/elc/en/
????????????????????????????????????
___________________________________________________________________________
8) FCT 2013 (Pre-announcement), University of Liverpool, Aug 19-21, 2013
FCT 2013, University of Liverpool
The 19th International Symposium on Fundamentals of Computation
Theory (FCT 2013) will be hosted by the Department of Computer
Science at the University of Liverpool.
Dates: August 19-21, 2013
Website: http://fct2013.csc.liv.ac.uk/
Three invited speakers (to be announced soon) will be at the
symposium. A formal invitation to submit papers for
consideration will be announced in due course.
Submission deadline: Tuesday, April 23, 2013
Program chairs: Leszek Gasieniec, University of Liverpool
Frank Wolter, University of Liverpool
Conference scope
----------------
FCT covers
Algorithms, including algorithm design, optimization,
approximation and randomized algorithms, computational
complexity, computational geometry, machine learning,
artificial intelligence, computational algebra, online
algorithms, and parallel and distributed computing.
Formal methods, including algebraic and categorical
methods, automata and formal languages, database theory,
foundations of concurrency, logic and model checking,
principles of programming languages, program analysis
and transformation, specification, refinement and
verification, and security.
Emerging fields, including algorithmic game theory,
computational biology, foundations of cloud computing, and
quantum computing.
Further details, including the program committee, will be
updated on the FCT website above as more information becomes
available
___________________________________________________________________________
9) CFP : UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION
============================================================
12th International Conference on
UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION
UCNC 2013
previously Unconventional Computation
1-5 July 2013
Milano, Italy
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)
* 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: to be announced
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).
___________________________________________________________________________
10) 8th International Computer Science Symposium
in Russia (CSR 2013) - Call for Papers
*******************************************************************************
First Call for Papers
8th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2013)
June 25-29, 2013, Ekaterinburg, Russia
http://csr2013.urfu.ru/
*******************************************************************************
CSR 2013 intends to reflect the broad scope of international cooperation in
computer science. It is the eighth conference in a series of regular events
previously held in St.Petersburg (2006), Ekaterinburg (2007), Moscow (2008),
Novosibirsk (2009), Kazan (2010), St.Petersburg (2011), and Nizhny
Novgorod (2012). The proceedings are published in Springer LNCS.
IMPORTANT DATES
Deadline for submissions: December 11, 2012
Notification of acceptance: February 13, 2013
Conference dates: June 25-29, 2013
As it has become a tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!
VENUE
Ekaterinburg is a large city in the heart of Russia, 1600 km (a 2 hour
flight) east from Moscow. It is the capital city as well as the main
financial, cultural, and scientific centre of the Ural region.
Ekaterinburg is accessible by direct regular flights of a number of
international airlines including Lufthansa, Aeroflot, Finnair,
Czech Airlines, Turkish Airlines, and FlyDubai. Ural Federal
University is the largest Russian university outside Moscow.
TOPICS include, but are not limited to:
* algorithms and data structures
* automata and formal languages
* combinatorial optimization
* constraint solving
* computational complexity
* cryptography
* combinatorics in computer science
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods
CONFIRMED INVITED SPEAKERS
* Thomas Colcombet (CNRS)
* Gilles Dowek (INRIA)
* Alexandr Kostochka (University of Illinois at
Urbana-Champaign / Novosibirsk State University)
* Nicole Schweikardt (Goethe University)
* Jeffrey Shallit (University of Waterloo)
* Ryan Williams (Stanford University)
PROGRAM COMMITTEE
* Max Alekseyev (University of South Carolina)
* Andris Ambainis (University of Latvia)
* Maxim Babenko (Higher School of Economics, Moscow)
* Patrick Baillot (ENS Lyon)
* Glencora Borradaile (Oregon State University)
* Andrei Bulatov (Simon Fraser University) Chair
* Yijia Chen (Shanghai Jiao Tong University)
* Victor Dalmau (University Pompeu Fabra)
* Yevgeniy Dodis (Courant Institute of Mathematical Sciences)
* Manfred Droste (University Leipzig)
* Anna Frid (Sobolev Institute of Mathematics)
* Hamed Hatami (McGill University)
* Tero Harju (University of Turku)
* Michal Koucky (Mathematical Institute of Czech Academy of Sciences)
* Stephan Kreutzer (Tecnical University of Berlin)
* Alexander Kulikov (Steklov Institute of Mathematics at St. Petersburg)
* Konstantin Makarychev (Microsoft Research at Redmond)
* Simone Martini (University of Bologna)
* Jaroslav Nesetril (Charles University)
* Jean-Eric Pin (University Paris 7)
* Harald Raecke (University of Munich)
* Alexander Razborov (University of Chicago and Steklov Mathematical Institute)
* Mikhail Volkov (Ural Federal University)
ORGANIZERS
B.N.Yeltsin Ural Federal University, Ekaterinburg, Russia
CONFERENCE CHAIR
Arseny Shur (Ural Federal University)
SUBMISSIONS
Authors are invited to submit an extended abstract or a full paper of
at most 12 pages in the LNCS format (LaTeX, as pdf; final version with
source), in English; instructions can be found at
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.
Proofs and other material omitted due to space constraints are to be put
into a clearly marked appendix to be read at discretion of the referees.
Papers must present original (and not previously published) research.
Simultaneous submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the symposium will be
published in Springer's LNCS series. Accepted papers MUST be presented at
the symposium.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2013
FURTHER INFORMATION AND CONTACTS
Web: http://csr2013.urfu.ru/
Email: csr2013 at urfu.ru
___________________________________________________________________________
11) LATA 2013: 3rd call for papers
----------------------------------------------------------------------------------------------------
7th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA
THEORY AND APPLICATIONS
LATA 2013
Bilbao, Spain
April 2-5, 2013
Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/LATA2013/
AIMS:
LATA is a yearly conference in theoretical
computer science and its applications. Following
the tradition of the International Schools in
Formal Languages and Applications developed at
Rovira i Virgili University in Tarragona since
2002, LATA 2013 will reserve significant room for
young scholars at the beginning of their career.
It will aim at attracting contributions from both
classical theory fields and application areas
(bioinformatics, systems biology, language
technology, artificial intelligence, etc.).
VENUE:
LATA 2013 will take place in Bilbao, at the
Basque Country in Northern Spain. The venue will
be the Basque Center for Applied Mathematics (BCAM).
SCOPE:
Topics of either theoretical or applied interest
include, but are not limited to:
? algebraic language theory
? algorithms for semi?structured data mining
? algorithms on automata and words
? automata and logic
? automata for system analysis and programme verification
? automata, concurrency and Petri nets
? automatic structures
? cellular automata
? combinatorics on words
? computability
? computational complexity
? computational linguistics
? data and image compression
? decidability questions on words and languages
? descriptional complexity
? DNA and other models of bio?inspired computing
? document engineering
? foundations of finite state technology
? foundations of XML
? fuzzy and rough languages
? grammars (Chomsky hierarchy, contextual,
multidimensional, unification, categorial, etc.)
? grammars and automata architectures
? grammatical inference and algorithmic learning
? graphs and graph transformation
? language varieties and semigroups
? language?based cryptography
? language?theoretic foundations of artificial intelligence and artificial life
? parallel and regulated rewriting
? parsing
? pattern recognition
? patterns and codes
? power series
? quantum, chemical and optical computing
? semantics
? string and combinatorial issues in computational biology and bioinformatics
? string processing algorithms
? symbolic dynamics
? symbolic neural networks
? term rewriting
? transducers
? trees, tree languages and tree automata
? weighted automata
STRUCTURE:
LATA 2013 will consist of:
? invited talks
? invited tutorials
? peer?reviewed contributions
INVITED SPEAKERS:
Jin-Yi Cai (Madison), Complexity Dichotomy for Counting Problems
Kousha Etessami (Edinburgh), Algorithms for
Analyzing Infinite-state Recursive Probabilistic Systems
Luke Ong (Oxford), tutorial Languages and
Automata for Higher-order Model Checking
Joël Ouaknine (Oxford), tutorial Discrete Linear Dynamical Systems
Thomas Schwentick (Dortmund), Applications of
Automata in Database Theory -- Challenges to Automata Theory from Databases
Andrei Voronkov (Manchester), The Lazy Reviewer Assignment Problem in EasyChair
PROGRAMME COMMITTEE:
Parosh Aziz Abdulla (Uppsala)
Franz Baader (Dresden)
Jos Baeten (CWI, Amsterdam)
Christel Baier (Dresden)
Gerth Stølting Brodal (Aarhus)
John Case (Delaware)
Marek Chrobak (Riverside)
Mariangiola Dezani (Torino)
Rod Downey (Wellington)
Ding-Zhu Du (Dallas)
Ivo Düntsch (Brock)
E. Allen Emerson (Austin)
Javier Esparza (Technical University Munich)
Michael R. Fellows (Darwin)
Alain Finkel (ENS Cachan)
Dov M. Gabbay (King?s, London)
Jürgen Giesl (Aachen)
Rob van Glabbeek (NICTA, Sydney)
Georg Gottlob (Oxford)
Annegret Habel (Oldenburg)
Reiko Heckel (Leicester)
Sanjay Jain (Singapore)
Charanjit S. Jutla (IBM Thomas J. Watson)
Ming-Yang Kao (Northwestern)
Deepak Kapur (Albuquerque)
Joost-Pieter Katoen (Aachen)
S. Rao Kosaraju (Johns Hopkins)
Evangelos Kranakis (Carleton)
Hans-Jörg Kreowski (Bremen)
Tak-Wah Lam (Hong Kong)
Gad M. Landau (Haifa)
Kim G. Larsen (Aalborg)
Richard Lipton (Georgia Tech)
Jack Lutz (Iowa State)
Ian Mackie (École Polytechnique, Palaiseau)
Rupak Majumdar (Max Planck, Kaiserslautern)
Carlos MartÃn-Vide (Tarragona, chair)
Paliath Narendran (Albany)
Tobias Nipkow (Technical University Munich)
David A. Plaisted (Chapel Hill)
Jean-François Raskin (Brussels)
Wolfgang Reisig (Humboldt Berlin)
Michaël Rusinowitch (LORIA, Nancy)
Davide Sangiorgi (Bologna)
Bernhard Steffen (Dortmund)
Colin Stirling (Edinburgh)
Alfonso Valencia (CNIO, Madrid)
Helmut Veith (Vienna Tech)
Heribert Vollmer (Hannover)
Osamu Watanabe (Tokyo Tech)
Pierre Wolper (Liège)
Louxin Zhang (Singapore)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Peter Leupold (Tarragona)
Carlos MartÃn?Vide (Tarragona, co-chair)
Magaly Roldán (Bilbao)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
Enrique Zuazua (Bilbao, co-chair)
SUBMISSIONS:
Authors are invited to submit papers presenting
original and unpublished research. Papers should
not exceed 12 single?spaced pages (including
eventual appendices) and should be formatted
according to the standard format for Springer
Verlag's LNCS series (see
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=lata2013
PUBLICATIONS:
A volume of proceedings published by Springer in
the LNCS series will be available by the time of the conference.
A special issue of a major journal will be later
published containing peer?reviewed extended
versions of some of the papers contributed to the
conference. Submissions to it will be by invitation.
REGISTRATION:
The period for registration is open from August
6, 2012 to April 2, 2013. The registration form
can be found at the website of the conference:
http://grammars.grlmc.com/LATA2013/
FEES:
Early registration fees: 500 Euro
Early registration fees (PhD students): 400 Euro
Late registration fees: 540 Euro
Late registration fees (PhD students): 440 Euro
On?site registration fees: 580 Euro
On?site registration fees (PhD students): 480 Euro
At least one author per paper should register.
Papers that do not have a registered author who
paid the fees by January 2, 2013 will be excluded from the proceedings.
One registration gives the right to present only one paper.
Fees comprise access to all sessions, one copy of
the proceedings volume, coffee breaks and lunches.
PAYMENT:
Early (resp. late) registration fees must be paid
by bank transfer before January 2, 2013 (resp.
March 23, 2013) to the conference bank account:
Uno-e Bank
bank?s address: Julian Camarillo 4 C, 28037 Madrid, Spain
IBAN: ES3902270001820201823142
BIC/SWIFT: UNOEESM1
account holder: C. Martin ? GRLMC
account holder?s address: Av. Catalunya 35, 43002 Tarragona, Spain
Please mention LATA 2013 and your name in the
subject. A receipt will be provided on site.
Remarks:
- Bank transfers should not involve any expense for the conference.
- People claiming early registration will be
requested to prove that the bank transfer order
was carried out by the deadline.
- PhD students will need to provide evidence of their status on site.
People registering on site must pay in cash. For
the sake of local organization, however, it is
much recommended to do it earlier.
DEADLINES:
Paper submission: November 9, 2012 (23:59h, CET)
Notification of paper acceptance or rejection: December 16, 2012
Final version of the paper for the LNCS proceedings: December 25, 2012
Early registration: January 2, 2013
Late registration: March 23, 2013
Starting of the conference: April 2, 2013
End of the conference: April 5, 2013
Submission to the post?conference journal special issue: July 5, 2013
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu at urv.cat
POSTAL ADDRESS:
LATA 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34?977?559543
Fax: +34?977?558386
ACKNOWLEDGEMENTS:
Basque Center for Applied Mathematics
Diputació de Tarragona
Universitat Rovira i Virgili
___________________________________________________________________________
More information about the FOM
mailing list