CiE Newsletter No.27, February 1, 2010:
There is quite a long list this week. They appear roughly order of receipt.
___________________________________________________________________________
CONTENTS:
1. MACHINES, COMPUTATIONS AND UNIVERSALITY (MCU'10), Call for Papers
2. Call for Papers - RP2010, 4th Workshop on REACHABILITY PROBLEMS, Brno,
Czech Republic
3. Call for papers, 6th IFIP International Conference on Theoretical
Computer Science (TCS2010)
4. Developments in Computational Models: DCM 2010 in Edinburgh - First Call
for Papers
5. Fall School of Logic & Complexity, September 20-24, 2010, Charles
University in Prague
6. PAR 2010: First CFP
7. Call for Papers/Participation - HyperNet 10: The UC2010 Hypercomputation
Workshop
8. UC10 - Submission deadline extended to Feb 8th
9. Infinite and Infinitesimal in Mathematics, Computing, and Natural
Sciences, Cetraro, Italy
10. ICALP 2010 - Submission site is open
11. CFP: Eleventh International Conference on Membrane Computing (CMC11),
Jena, Germany, 24-27 August 2010
12. Nominations for 2010 Shoenfield Prizes
13. Workshop on High Productivity Computations (HPC 2010) - Call for Papers
14. Workshop on Logic and Computational Complexity (LCC '10)
===========================================================================
===========================================================================
1. (from Jerome Durand-Lose) MACHINES, COMPUTATIONS AND UNIVERSALITY
(MCU'10), Call for Papers:
================
CALL FOR PAPERS CALL FOR PAPERS CALL FOR PAPERS CALL FOR PAPERS
- ----------------------------------------------------------------------
International Conference
MACHINES, COMPUTATIONS AND UNIVERSALITY
- ----------------------------------------------------------------------
M M CCC U U I 22222 00000 1 00000
MM MM C C U U I 2 2 0 0 11 0 0
M M M M C U U 2 2 0 0 1 1 0 0
M M M C U U 22 0 0 1 0 0
M M C U U 2 0 0 1 0 0
M M C C U U 22 0 0 1 0 0
M M CCC UUU 2222222 00000 1111 00000
- ----------------------------------------------------------------------
PITTSBURGH, PA, USA
Carnegie Mellon University
Department of Computer Science
---------
SEPTEMBER 21-25
- -----------------------------------------------------------------------
Organizing institutions :
Carnegie Mellon University, Department of Computer Science
Universite d'Orleans, LIFO
Universite Pau Verlaine - Metz, LITA
- -----------------------------------------------------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
TOPICS :
Digital Computations:
Turing machines, register machines, cellular automata,
other automata, tiling of the plane, polyominoes, snakes,
neural networks, molecular computations, word processing
(goups and monoids), other machines
Analog and Hybrid Computations:
BSS machines, infinte cellular automata, real machines,
quantum computing
In both cases:
frontiers between a decidable halting problem and an
undecidable one in the various computational settings
minimal universal codes:
size of such a code, namely, for Turing machines, register
machines, cellular automatas, tilings, neural nets,
Post systems, ...
computation complexity of machines with a decidable halting
problem as well as universal machines
self-reproduction and other tasks
universality and decidability in the real field
PROGRAM COMMITTEE :
Erzsebet CSUHAJ-VARJU, Hungarian Academy of Sciences, Hungary
Jerome DURAND-LOSE, University of Orleans, France, co-chair
Vladik KREINOVICH, the University of Texas at El Paso
Maurice MARGENSTERN, LITA, University of Metz, France, co-chair
Cris MOORE, Santa Fe, USA
Gheorghe PAUN, Romanian Academy, Bucharest, Romania
Igor POTAPOV, University of Liverpool, UK
Yurii ROGOZHIN, Institute of Mathematics, Chisinau, Moldov
Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA, co-chair
Jiri WIEDERMANN, Academy of Science, Czech Republic
Damien WOODS, University College, Cork, Ireland
ORGANIZING COMMITTEE :
Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA,
co-chair
Jerome DURAND-LOSE, Universite d'Orleans, Orleans, France,
co-chair
Maurice MARGENSTERN, Universite Paul Verlaine - Metz, Metz,
France, co-chair
INVITED SPEAKERS :
Andrew ADAMATZKY, University of Bristol, UK
Olivier BOURNEZ, LORIA, INRIA-Lorraine, France
Mark BURGIN, University of Califonia at Los Angeles, USA
Jarkko KARI, University of Turku, Finland
Pascal KOIRAN, Ecole Normale Superieure de Lyon, France
Kenichi MORITA, University of Hiroshima, Japan
Kumbakonam Govindarajan SUBRAMANIAN, Christian College of
Chennai, India
Wilfried SIEG, Carnegie Mellon University, Pittsburgh, USA
Stephen WOLFRAM, Wolfram Research
MCU'95, MCU'98 and MCU'2001 gave rise to TCS special issues on
"Machines, Computations and Universality": 168-2 (1996), 231-2 (2000)
and 296-2 (2002). MCU'2004 and MCU'2007 gave rise to Fundamenta
Informaticae special issues: 74(4) (2005), 91(1) and 91(2) (2008). The
interest of computer scientists for the topics of the conference
increased in the last years. New domains appeared, continuing them in a
natural way. This explains why a regular scientifing meeting on this
topics must hold, each three years. And so, three years after MCU'2007
the turn of MCU'2010 comes.
SUBMISSIONS
Send you submission by e-mail to one of the co-chairs of MCU (see
addresses at the end of the announcement) as a .ps or a .pdf file. NO
OTHER FORMAT will be accepted. Please, use the LaTeX style of Electronic
Proceedings in Theoretical Computer Science in order to produce your
submission. You can find the style file at:
http://style.eptcs.org/
Your submission should not exceed 25 pages in the above indicated format.
Please, keep in mind the following dates which are STRICT dead lines:
Dead line for submission : March, 15, 2010
Notification of acceptance or rejection : June, 1, 2010
Dead line for receiving corrected version of accepted papers :
July, 1, 2010
CONFERENCE PROCEEDINGS
The proceedings of MCU'2010 will published by Electronic Proceedings
in Theoretical Computer Science, which already published the proceedings
of CSP 2008, DCFS 2009, DCM 2009 (under ICALP 2009) and MeCBIC2009 and
they will publish those of DCFS 2010 for instance. The proceedings will
be available at the conference as a CD.
IJFCS SPECIAL ISSUE
A special issue of the International Journal of Foundations of
Computer Science devoted to "Universal Machines and Computations'VI"
will be published on the topics of the conference. A call for paper will
be launchedjust after MCU'2010 on the topics of the conference. The
submitted papers will be refereed and accepted papers after this process
will be published in the special issue. It will be possible to submit an
extended version of a paper published in the EPTCS proceedings of
MCU'2010, provided that the extension is actually needed or, preferably,
that it contains new substantial results. The selection process for the
special issue will be strict on these criteria.
REGISTRATION FEES :
In order to attend the conference, send your registration form by
surface mail at the below indicated address, by FAX, by e-mail or using
the web site of the conference when the date of registration will be
announced. Registration fees amount to 400 USD if paid before July 1st
2010 and to 450 USD after that date. Further details for the payment of
the registration fees will be available later on the web site of the
conference.
LANGUAGE OF THE CONFERENCE
English.
RECEPTION
Reception of participants will hold on Monday, September, 20 and on
Tuesday, September, 21, at times which will be later indicated.
MAIL:
e-mails :
margens@univ-metz.fr
jerome.durand-lose@univ-orleans.fr
sutner@cs.cmu.edu
by surface mail :
Maurice MARGENSTERN
Universite Paul Verlaine - Metz,
LITA, EA 3097, UFR MIM,
Campus du Saulcy,
F - 57045 METZ CEDEX
FRANCE
Jerome Durand-Lose
Universite d'Orleans,
LIFO, Batiment IIIA,
Rue Leonard de Vinci
B.P. 6759
F - 45067 ORLEANS Cedex 2
FAX: +33387315309
WEB SITE:
http://www.cs.cmu.edu/~mcu2010
===========================================================================
===========================================================================
2. (from Igor Potapov) Call for Papers - RP2010, 4th Workshop on
REACHABILITY PROBLEMS, Brno, Czech Republic:
================= Call for Papers =================
4th WORKSHOP ON REACHABILITY PROBLEMS, RP'2010
(August 27-29, 2010, Masaryk University, Brno, Czech Republic)
co-located with MFCS & CSL 2010
http://www.csc.liv.ac.uk/~rp2010/
---------------------------------------------------
==== Deadline for submissions: April 21, 2010 ====
==== Proceedings will be published in the ====
==== Springer LNCS series ====
---------------------------------------------------
The Workshop on Reachability Problems will be hosted by the
Faculty of Informatics, Masaryk University, Brno, Czech Republic
and will be co-located with Joint MFCS and CSL 2010. RP'10 is
the fourth in the series of workshops following three successful
meetings at Ecole Polytechnique, France in 2009 at University of
Liverpool, UK in 2008 and at Turku University, Finland in 2007.
Scope: The Reachability Workshop is specifically aimed at
gathering together scholars from diverse disciplines and backgrounds
interested in reachability problems that appear in - Algebraic structures
- Computational models
- Hybrid systems
- Logic and Verification
Invited Speakers:
=================
- Markus Holzer (Giessen University, Gernamy)
- Kim Guldstrand Larsen (Aalborg University, Denmark)
- Alexander Rabinovich (Tel Aviv University, Israel)
- Philippe Schnoebelen (ENS Cachan, France)
Important dates:
=================
Submission: April 21, 2010
Notification: June 3, 2010 Final version: June 10, 2010
Conference dates: Aug. 27-29, 2010
Topics of interest:
======================
Papers presenting original contributions related to reachability
problems in different computational models and systems are
being sought. Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting systems;
Reachability analysis in counter/ timed/ cellular/ communicating
automata; Petri-Nets; computational aspects of semigroups,
groups and rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable reachability
problems; complexity and decidability aspects; predictability
in iterative maps and new computational paradigms
The reachability problems are in the core of many questions
of computer science and mathematics. This topic covers
many aspects about the analysis of computational traces/paths
in classical and unconventional computational models, logic,
algebraic structures as well as in mathematical systems and
control theory. The classical reachability can be formulated as
follows: Given a computational system or model with a set of
allowed transformations (functions). Decide whether a certain
state of a system is reachable from a given initial state by a set
of allowed transformations. The same questions can be asked
not only about reachability of exact states of the system but
also about a set of states expressed in term of some property
as a parameterized reachability problem. Another set of
predictability questions can be seen in terms of reachability of
eligible traces of computations, their equivalence; unavoidability
of some dynamics and a possibility to avoid undesirable dynamic
using a limited control.
Proceedings
===========
The Conference Proceedings will be published as the volume
of the Springer Verlag Lecture Notes in Computer Science
(LNCS) series www.springer.com/lncs and distributed at the
Conference. We plan also to publish selected papers in a special
issue of a high quality journal following the regular referee
procedure.
Submissions:
============
Authors are invited to submit a draft of a full paper
with at most 12 pages (in LaTeX, formatted according
to LNCS guidelines) via the conference web page.
Proofs omitted due to space constraints must be put
into an appendix to be read by the program committee
members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in postscript
or pdf. Simultaneous submission to other conferences or
workshops with published proceedings is not allowed.
Program Committee:
==================
- Parosh Aziz Abdulla, Uppsala
- Eugene Asarin, Paris
- Christel Baier, Bonn
- Bernard Boigelot, Liege
- Olivier Bournez, Nancy
- Cristian S. Calude, Auckland
- Stephane Demri, Cachan
- Javier Esparza, Munich
- Laurent Fribourg, Cachan
- Vesa Halava, Turku
- Oscar Ibarra, Santa Barbara
- Franjo Ivancic, Princeton
- Juhani Karhumaki, Turku
- Joost-Pieter Katoen, Aachen
- Antonin Kucera, Brno
- Michal Kunc, Brno
- Alexander Kurz, Leicester
- Slawomir Lasota, Warsaw
- Alexei Lisitsa, Liverpool
- Luke Ong, Oxford
- Igor Potapov, Liverpool
- Wolfgang Thomas, Aachen
- Hsu-Chun Yen, Taipei
Organizing Committee:
=====================
- Antonin Kucera (Masaryk University)
- Igor Potapov (University of Liverpool)
===========================================================================
===========================================================================
3. (from Cristian Calude) Call for papers, 6th IFIP International Conference
on Theoretical Computer Science (TCS2010):
Call for Papers
6th IFIP International Conference on
Theoretical Computer Science
www.wcc2010.com/TCS2010
TCS 2010 will be composed of two distinct but interrelated tracks: Track A
on Algorithms, Complexity and Models of Computation, and Track B on Logic,
Semantics and verification
Important dates:
Title and abstract due February 12, 2010
Paper due: February 19, 2010
Notification of acceptance: April 30, 2010
Copyright release due: May 7, 2010
Camera-ready copies: May 15, 2010
Conference Co-Chairs
James Harland (AU)
Barry Jay (AU)
Programme Co-Chairs
Track A: Cristian S. Calude (NZ)
Track B: Vladimiro Sassone (GB)
Programme Committee
Track A: Algorithms, Complexity & Models of Computation
Valerie Berthe (Montpellier, F)
Cristian S. Calude (Auckland, NZ;chair)
Cezar Campeanu (Charlottetown, CAN) S. Barry Cooper (Leeds, UK)
Michael J. Dinneen (Auckland, NZ)
Rod Downey (Victoria, NZ)
Cunsheng Ding (Hong Kong, HG)
Graham Farr (Melbourne, AU)
Joachim Gudmundsson (Alexandria, AU)
Lane A. Hemaspaandra (Rochester, USA)
Oscar H. Ibarra (Santa Barbara, USA)
Masami Ito (Kyoto, JP)
Alexander Shen (Marseille, F)
Ludwig Staiger (Halle, D)
Frank Stephan (Singapore, SG)
Ileana Streinu (Northampton, USA)
Kohtaro Tadaki (Tokyo, JP)
Vincent Vajnovszki (Dijon, F) Taso Viglas (Sydney, AU)
Klaus Wagner (Wuerzburg, D) Damien Woods (Seville, S) Sheng Yu (London,
Ont., CAN)
Track B: Logic, Semantics, Specification and Verification Stephen L Bloom
(Stevens Inst, USA)
Roberto Bruni (Pisa, I)
Kostas Chatzikokolakis (CWI, NL)
Corina Cirstea (Southampton, UK)
Veronique Cortier (CNRS Loria, F) Mariangiola Dezani (Turin, I)
Rob van Glabbeek (NICTA & UNSW, AU & Stanford, USA)
Atsushi Igarashi (Kyoto, JP)
Alan Jeffrey (Bell Labs, USA)
He Jifeng (Shanghai, CN)
Bartek Klin (Cambridge, UK & Warsaw, PL)
Barbara Koenig (Duisburg, D)
Dexter Kozen (Cornell, USA)
Marta Kwiatkowska (Oxford, UK)
Huimin Lin (Bejing, CN)
Dale Miller (Ecole Polytechnique, F)
Carroll Morgan (UNSW, AU)
Doron Peled (Bar Ilan, IL)
Sabina Rossi (Venice, I)
Vladimiro Sassone (Southampton, UK; chair)
Thomas Schwentick (TU Dortmund, D)
Andrzej Tarlecki (Warsaw, PL)
Yde Venema (Amsterdam, NL)
Only electronic submissions will be accepted, via Track A & Track B:
http://www.easychair.org/conferences/?conf=tcs2010.
===========================================================================
===========================================================================
4. (from Barry Cooper) Developments in Computational Models: DCM 2010 in
Edinburgh - First Call for Papers:
=========================================================================
First Call for Papers
DCM 2010
6th International Workshop on Developments in Computational Models
** Causality, Computation, and Physics **
http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/
Edinburgh, Scotland
9-10 July 2010
Deadline for abstracts: 01 April, 2010
A satellite event of FLoC - http://www.floc-conference.org/
=========================================================================
DCM 2010 is the sixth in a series of international workshops focusing on new
computational models. It aims to bring together researchers who are
currently developing new computational models or new features of a
traditional one. And to foster interaction, to provide a forum for
presenting new ideas and work in progress, and to enable newcomers to learn
about current activities in this area.
DCM 2010 will be a two-day satellite event of FLoC 2010, with a special
focus on the theme 'Causality, Computation, and Physics'. Day 2 of the
Workshop will have an emphasis on quantum computation and physics, held as
Quantum Information Science Scotland (QUISCO), and is co-sponsored by
Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and
Computer Science Alliance (SICSA).
Topics of interest include all abstract models of computation and their
properties, and their applications to the development of programming
languages and systems:
- quantum computation, including implementations and formal methods in
quantum protocols;
- probabilistic computation and verification in modelling situations;
- chemical, biological and bio-inspired computation, including spatial
models, self-assembly, growth models;
- general concurrent models including the treatment of mobility, trust, and
security;
- information-theoretic ideas in computing.
PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF
format to the conference EasyChair submission page:
https://www.easychair.org/login.cgi?conf=dcm2010
by the deadline:
01 April, 2010.
Accepted contributions will appear in a pre-proceedings special issue of the
EPTCS (Electronic Proceedings in Theoretical Computer Science).
After the workshop, full versions of selected papers will be invited for a
special issue of the internationally leading journal Mathematical Structures
in Computer Science (MSCS).
IMPORTANT DATES:
Submission deadline for abstracts: 01 April, 2010
Notification: 26 April
Workshop: 9-10 July, 2010
CONFIRMED INVITED SPEAKERS:
Cristian Calude (Auckland, New Zealand)
Russ Harmer (Paris/Harvard)
Gordon Plotkin (Edinburgh)
Vlatko Vedral (Oxford)
PROGRAMME COMMITTEE:
S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham
Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier
Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino)
Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons
(Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean
Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris)
Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney
(York) John Tucker (Swansea)
=========================================================================
Further information: Barry Cooper, pmt6sbc@leeds.ac.uk,
Prakash Panangaden prakash@cs.mcgill.ca
===========================================================================
===========================================================================
5. (from Jan Krajicek) Fall School of Logic & Complexity, September 20-24,
2010, Charles University in Prague:
All available information is at:
http://www.karlin.mff.cuni.cz/~krajicek/fall10.html
The broad theme of the Fall schools is the interaction of Mathematical
Logic and Complexity Theory, with a special emphasis on Proof Complexity.
A typical format of the school is this: We have one or more series of
lectures during Monday to Thursday, each usually two hours per day. This
programme is traditionally complemented by lectures of the participants on
their own work (relevant to the topics of the year) during Friday.
The 2010 school will focus on one theme only:
Extended Frege systems and beyond.
The Extended Frege system is a pivotal example of strong proof systems.
While a lot of current activity in proof complexity is concentrated on very
weak proof systems (e.g. variants of resolution or various algebraic proof
systems), strong proof systems are neglected by many researchers. This is
presumably because EF is informally linked with the class of all Boolean
circuits and people are discouraged by the apparent lack of any progress on
lower bounds for general circuits, and conclude that lower bounds for strong
proof systems are impossible.
There is, however, a non-trivial theory related to strong proof systems.
The aim of this Fall school will be to present some of this material and to
discuss possibilities for further developments.
===========================================================================
===========================================================================
6. (from Ekaterina Komendantskaya) PAR 2010: First CFP:
========================================================================
1st Call for Papers
PAR 2010
Workshop on Partiality And Recursion in Interactive Theorem Provers
Edinburgh, UK, 15 July 2010
(satellite workshop of ITP'10)
a mid-FLoC 2010 workshop
========================================================================
PAR'10 workshop is a venue for researchers working on new approaches
to cope with partial functions and terminating general (co)recursion
in theorem provers.
Theorem provers with inductive types provide a restricted programming
language together with a formal meta-theory for reasoning about the
language. When propositions are represented as types and proofs as
programs, non-terminating proofs are disallowed for consistency and
decidability of type checking. As a result, there is no trivial way
to represent partial functions, and termination is syntactically
ensured by imposing that the recursive calls must be made on
structurally smaller arguments. Similar issues exist for productivity
of functions on infinite objects where syntactic methods are used to
ensure an infinite flow of data. The workshop aims to address these
issues and various approaches for dealing with them.
We invite submissions on all aspects of partiality and termination of
general (co)recursive functions in a logical framework.
The topics of this workshop include but are not limited to:
* partial functions and functions over partial objects in theorem
provers;
* specialised type systems for general (co)recursion;
* syntactical tests to guarantee termination of general recursive
functions;
* syntactical tests to guarantee productivity of functions on infinite
objects;
* methods to ensure termination of special classes of recursion
definitions, eg nested recursion, simultaneous inductive-recursive
data types and functions;
* semantic approaches to termination and productivity, eg based on
domain theory and topology;
* categorical approaches to termination and productivity;
* algebra of programming with partial functions and general
(co)recursion.
Description of software tools and case studies for dealing with the
issues in the scope of the workshop are welcome.
Submissions
-----------
The articles will be evaluated by the PC for publication in the
proceedings of the workshop. The final proceedings will be published
after the workshop as a special issue of EPTCS and a preliminary
version will be available during the workshop.
The articles must contain original contributions, be clearly written,
and include appropriate reference to and comparison with related
work. Submissions should preferably not exceed 16 pages (excluding
bibliography). Submissions must be prepared in LaTeX using the EPTCS
macro package .
The web-based system EasyChair will be used for submission
().
Important dates
---------------
* 29 March 2010: Submission deadline
* 29 April 2010: Notification of acceptance
* 24 May 2010: Final version of accepted papers
* 15 July 2010: the workshop
Invited Speakers
----------------
* Conor McBride (University of Strathclyde)
* TBA
Programme Committee
-------------------
Andreas Abel (Ludwig Maximilians University Munich, D)
Yves Bertot (INRIA Sophia-Antipolis, FR)
Ana Bove (Chalmers University of Technology, SE)
Ekaterina Komendantskaya (University of St Andrews, UK)
Ralph Matthes (IRIT Toulouse, FR)
Milad Niqui (CWI, NL)
Anton Setzer (Swansea University, UK)
Organisers
----------
Ana Bove
Ekaterina Komendantskaya
Milad Niqui
===========================================================================
===========================================================================
7. (from Mike Stannett) Call for Papers/Participation - HyperNet 10: The
UC2010 Hypercomputation Workshop:
------------------------------------------
Call for Papers / Participation
HyperNet 10: The UC2010 Hypercomputation Workshop
http://hypercomputation.net/hypernet10/
This workshop is being organized as part of
Unconventional Computation 2010, Tokyo (21-25 June 2010)
UC10: http://arn.local.frs.riken.jp/UC10/
Original papers are solicited in all areas relating to hypercomputation
research. Typical topics include, but are not restricted to: philosophical
implications, justifications and analyses of hypercomputation;
hypercomputational models of Newtonian, quantum and relativistic physics;
mathematical models and representations of hypercomputational systems;
engineering challenges; proposals for going beyond the Turing paradigm;
digital physics and refutations of hypercomputation.
Submissions:
Authors are invited to submit papers (no more than 12 pages) via EasyChair:
http://www.easychair.org/conferences/?conf=hypernet10
Papers should be submitted in PDF format. Joint submissions to other
conferences are not permitted. Each accepted paper must be presented at the
Workshop.
Submissions due: March 15th, 2010
Notification: April 12th, 2010
Final versions due: May 20th, 2010
UC 2010 begins: June 21st, 2010
Papers for presentation will be selected by the Programme Committee,
comprising: Selim AKL, Hajnal ANDREKA, Cristian CALUDE, Barry COOPER, Jack
COPELAND, Francisco Antonio DORIA, Marian GHEORGHE, Mark HOGARTH, Viv
KENDON, Kenichi MORITA, Istvan NEMETI, Mike STANNETT, Susan STEPNEY, Karl
SVOZIL, Christof TEUSCHER, John TUCKER, Benjamin WELLS.
Registration: should be carried out via the main UC10 web site (registration
for UC10 includes registration for the Workshop). Workshop enquiries may be
addressed to the coordinator (Mike Stannett) at hypernet10@easychair.org.
Background: HyperNet 10 is organized jointly by the University of Tokyo in
Japan, and members of the VT (Verification and Testing) Research Group at
the University of Sheffield, under the auspices of UC 2010 and the EPSRC,
and on behalf of the Hypercomputation Research Network. Comprising
researchers from around the world, the Network investigates all aspects of
hypercomputation, ranging from philosophy and logic to physical feasibility
and computability. Previous Network events include the 2006 workshop on
Future Trends in Hypercomputation (Sheffield, UK), the 2009 conference on
the Science and Philosophy of Unconventional Computing (SPUC 09, Cambridge,
UK), and the UC09 Hypercomputation Workshop (Ponta Delgada, The Azores,
Portugal).
===========================================================================
===========================================================================
8. (from Mike Stannett) UC10 - Submission deadline extended to Feb 8th:
Call for Papers or Posters
Ninth International Conference on
UNCONVENTIONAL COMPUTATION 2010
UC10
University of Tokyo, Japan
June 21st-25th, 2010
http://arn.local.frs.riken.jp/UC10/
UC10 is organized by the University of Tokyo, Japan, and CDMTCS, University
of Auckland, New Zealand, under the auspices of EATCS. Original
papers/posters are solicited in all areas of unconventional computation.
Papers/posters dealing with theory as well as with experiments and
applications are welcome. Typical, but not exclusive, topics are: natural
computing including quantum, cellular, molecular, neural, and membrane
computing as well as evolutionary paradigms; chaos and dynamical systems
based computing; proposals for computations going beyond the Turing model.
Submissions: Authors are invited to submit papers (at most 12 pages) or
posters electronically, via EasyChair:
http://www.easychair.org/conferences/?conf=uc2010
Each author of a paper should prepare a PDF file following LNCS format of
Springer. Each author of a poster should submit a PDF file of either a
graphical poster or abstract text, which contains sufficient information for
reviewers to evaluate the research outcomes. Joint submissions to other
conferences are not permitted. Each accepted paper/poster must be presented
at the conference. The author of the poster is responsible for printing. The
proceedings will be published by Springer LNCS series and will be available
at the conference.
Invited Speakers: (to be confirmed)
Satellite Workshops: Hypercomputation Computing with Spatio-Temporal
Dynamics DNA Nanotechnology
Conference Location: The conference and satellite workshops will take place
in the University of Tokyo (Sanjo Conference Hall), Hongo Campus, Japan.
Conference History: The first venue of the Unconventional Computation
Conference (formerly called Unconventional Models of Computation) was
Auckland, New Zealand, in 1998; subsequent sites of the conference were
Brussels, Belgium, in 2000; Kobe, Japan, in 2002; Seville, Spain, in 2005;
York, UK, in 2006; Kingston, Canada, in 2007; Vienna, Austria, in 2008; and
Ponta Delgada, Portugal, in 2009.
UC Steering Committee:
T. Baeck (Leiden, The Netherlands), C.S. Calude (Auckland, NZ, co-chair),
L.K. Grover (Murray Hill, NJ, USA), J. Kari (Turku, Finland), L. Kari
(London, Ont., Canada), J. van Leeuwen (Utrecht, The Netherlands), S. Lloyd
(Cambridge, MA, USA), Gh. Paun (Seville, Spain, and Bucharest, Romania), T.
Toffoli (Boston, MA, USA), C. Torras (Barcelona, Spain), G. Rozenberg
(Leiden, The Netherlands, and Boulder, Colorado, USA, co-chair), A. Salomaa
(Turku, Finland).
Organizing Committee: Masashi Aono, Wako, Japan Masami Hagiya, Tokyo, Japan
(chair) Satoshi Murata, Tokyo, Japan Ferdinand Peper, Kobe, Japan Fumiaki
Tanaka, Tokyo, Japan
Programme Committee:
Andrew Adamatzky, Bristol, UK Selim Akl, Kingston, Canada Masashi Aono,
Wako, Japan Olivier Bournez, Paris, France Cristian S. Calude, Auckland, NZ
Luca Cardelli, Cambridge, UK David Corne, Edinburgh, UK Nachum Dershowitz,
Tel Aviv, Israel Michael Dinneen, Auckland, NZ Marco Dorigo, Brussels,
Belgium Masami Hagiya, Tokyo, Japan Emma Hart, Edinburgh, UK Gregg Jaeger,
Boston, USA Natasha Jonoska, Tampa, USA Jarkko Kari, Turku, Finland Viv
Kendon, Leeds, UK Vincenzo Manca, Verona, Italy Jonathan Mills, Bloomington,
USA Kenichi Morita, Hiroshima (co-chair) Ferdinand Peper, Kobe, Japan Kai
Salomaa, Kingston, Canada Hava Siegelmann, Amherst, USA Mike Stannett,
Sheffield, UK Darko Stefanovic, Albuquerque, USA Susan Stepney, York, UK Jon
Timmis, York, UK (co-chair)
Christof Teuscher, Portland, USA Hiroshi Umeo, Osaka, Japan Damien Woods,
Seville, Spain Xin Yao, Birmingham, UK Proceedings Committee: Cristian S.
Calude, Auckland, NZ Masami Hagiya,
Tokyo, Japan Kenichi Morita, Hiroshima, Japan Grzegorz Rozenberg, Leiden,
Netherland Jon Timmis, York, UK
----------------------------------------
Important Dates:
Submission Deadline: February 8th, 2010
Notification of Acceptance: March 8th, 2010
Revision Deadline: March 29th, 2010
Conference Dates: June 21st-25th, 2010
===========================================================================
===========================================================================
9. (from Andrea Sorbi) Infinite and Infinitesimal in Mathematics, Computing,
and Natural Sciences, Cetraro, Italy:
________________________________________________________________
Infinite and Infinitesimal in Mathematics, Computing, and Natural
Sciences
17-21 May 2010, Grand Hotel San Michele, Cetraro, Italy
http://www.theinfinitycomputer.com/infinity2010
________________________________________________________________
THE FIRST CALL FOR PAPERS
The goal of the Workshop is to create a multidisciplinary round table
for an open discussion on modelling nature by using traditional and
emerging computational paradigms. Mathematics and natural sciences
offer discrete and continuous models to describe space, processes,
and events occurring in nature. Very often both approaches use
notions of infinite and infinitesimal in order to create coherent
models. It is assumed that it is possible to work with infinitesimal
quantities and/or to execute an infinite number of steps in
algorithms. However, our abilities in computing are limited and only
a finite number of computational steps can be executed by humans and
machines.
The Workshop will discuss all aspects of the usage of infinity and
infinitesimals in mathematics, computing, philosophy, and natural
sciences. Fundamental ideas from theoretical computer science, logic,
set theory, and philosophy will meet requirements and new fresh
applications from physics, chemistry, biology, medicine, and economy.
Researchers from both theoretical and applied sciences are very
welcome to submit their papers and to use this excellent possibility
to exchange ideas with leading scientists from different research
fields. Papers discussing new computational paradigms and their
impact on natural sciences are particularly solicited.
A special attention will be dedicated to the new methodology allowing
one to execute numerical computations with finite, infinite, and
infinitesimal numbers on a new type of a computational device - the
Infinity Computer (EU patent 1728149). The new approach is based on
the principle 'The part is less than the whole' introduced by Ancient
Greeks that is applied to all numbers (finite, infinite, and
infinitesimal) and to all sets and processes (finite and infinite).
The new methodology evolves Cantor's ideas in a more applied way and
introduces new infinite numbers that possess both cardinal and
ordinal properties as usual
finite numbers. It gives the possibility to execute numerical
computations of a new type and simplifies fields of mathematics where
the usage of the infinity and/or infinitesimals is necessary.
There will be tutorials, discussion sections, and regular
presentations.
Topics of the workshop include the following research streams and
their interrelations with infinite and infinitesimal quantities
* Analytical computations
* Astronomy and infinity
* Complexity and computability
* Divergent processes and fractals
* Foundations of mathematics
* Infinity in economy
* Infinity in natural sciences
* Language theory
* Logic and infinity
* Modelling: continuous vs. discrete
* Numerical analysis
* Philosophy of mathematics
* Physics of particles and infinitesimals
* Quantum computing
More information at:
http://www.theinfinitycomputer.com/infinity2010
===========================================================================
===========================================================================
10. (from Ioannis Chatzigiannakis) ICALP 2010 - Submission site is open:
______________________________________________________________________
CALL FOR PAPERS
ICALP 2010
37th International Colloquium on Automata, Languages and Programming
July 5-12, 2010
Bordeaux, France
http://icalp10.inria.fr/
Supported by the European Association for Theoretical Computer Science
(EATCS)
______________________________________________________________________
Important Dates:
* Submission Deadline: Feb 10, 2010
* Author Notification: Apr 6, 2010
* Final Manuscript Due: Apr 27, 2010
______________________________________________________________________
The 37th International Colloquium on Automata, Languages and
Programming, the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS), will take place
from the 5th to the 12th of July 2010 in Bordeaux, France. The main
conference will be preceded and followed by a series of
Workshops. 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
Topics: Algorithmic Game Theory * Approximation Algorithms *
Combinatorics in Computer Science * Computational Biology *
Computational Complexity * Computational Geometry * Cryptography *
Data Structures * Design and Analysis of Algorithms * Internet
Algorithmics * Machine Learning * Parallel, Distributed and External
Memory Computing * Randomness in Computation * Quantum Computing
Track B - Logic, Semantics, Automata and Theory of Programming
Topics: Algebraic and Categorical Models * Automata Theory, Formal
Languages * Non-standard Approaches to Computability * 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
Topics: Algorithmic Aspects of Networks * Auctions * Computing with
Incentives * E-commerce, Privacy, Spam * Formal Methods for Network
Information Management * Foundations of Trust and Reputation in
Networks * Internet Algorithmics * Mobile and Wireless Networks *
Models of Complex Networks * Models and Algorithms for Global
Computing * Models of Mobile Computation * Networks Economics *
Networks of Low Capability Devices * Overlay Networks and P2P Systems
* Social Networks * Specification, Semantics, Synchronization of
Networked Systems * Theory of Security in networks and Distributed
Computing * Web Searching, Ranking * Web Mining and Analysis
______________________________________________________________________
Invited Speakers:
* Pierre Fraigniaud (CNRS and Univ. Paris Diderot)
* Jean Goubault-Larrecq (ENS Cachan and LSV)
* Burkhard Monien (Univ. Paderborn)
* Joel Ouaknine, (Oxford Univ. Computing Lab.)
* Roger Wattenhofer (ETH Zurich)
* Emo Welzl (ETH Zurich)
______________________________________________________________________
Submission Guidelines:
Submissions should be made through the on-line submission site:
https://wiki.bordeaux.inria.fr/icalp10/index.php?n=Main.Submission
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 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 recommended that submissions adhere to the specified format and
length. Submissions that are clearly too long may be rejected
immediately. Additional material intended for the referee 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.
______________________________________________________________________
Conference Chairs:
* Cyril Gavoille, Univ. of Bordeaux (LaBRI) & INRIA, Bordeaux.
* Claude Kirchner, INRIA, Bordeaux.
Program Committees:
Track A. - Algorithms, Complexity and Games
* Dimitris Achlioptas, Univ. Santa Cruz
* Kwstis Daskalakis, MIT
* Anuj Dawar, Cambridge Univ.
* Xiaotie Deng, City Univ. Hong Kong
* Philippe Flajolet, INRIA
* Micelle Flammini, Univ. L\'Acquilla
* Oscar Ibarra, UCSB (Santa Barbara)
* Giuseppe Italiano, Univ. Roma 2
* Kazuo Iwama, Univ. Kyoto
* Klaus Jansen, Univ. Kiel
* Elias Koutsoupias, Univ. Athens
* Ludek Kucera, Charles Univ.
* Daniel Marx, Budapest Univ.
* Burkhard Monien, U Paderborn
* Amin Coja Oghlan, Univ. Edinburgh
* Tonyann Pitassi, Univ. Toronto
* John Reif, Duke Univ.
* Jose Rolim, Univ. Geneva
* Paul Spirakis, Univ. Patras and RACTI (PC Chair)
* Leslie Valiant, Harvard Univ.
* Emo Welzl, ETH
* Gerhard Woeginger, Univ. Eindhoven
Track B - Logic, Semantics, Automata and Theory of Programming
* Samson Abramsky, Oxford Univ. (PC Chair)
* Luca Aceto, Univ. Rejkjavik
* Lars Birkedal, Univ. Copenhagen
* Mikolaj Bojanczyk, Univ. Warsaw
* Patricia Bouyer, CNRS, LSV Cachan
* Josée Desharnais, Univ. Laval
* Gilles Dowek, Ecole Polytechnique & INRIA
* Manfred Droste, Univ. Leipzig
* Peter Dybjer, Univ. Chalmers
* Jose Felix Costa, Univ. Lisbon
* Phokion Kolaitis, IBM Almaden
* Ugo Dal Lago, Univ. Bologna
* Daniel Leivant, Univ. Indiana
* Andrzej Murawski, Oxford Univ.
* Filip Murlak, Univ. Edinburgh
* Flemming Nielsen, Univ. Copenhagen
* Dominique Perrin, Univ. Paris Est
* Alex Rabinovich, Univ. Tel Aviv
* Lutz Schroder, DFKI Bremen
* Ian Stark, Univ. Edinburgh
Track C- Foundations of Networked Computation: Models, Algorithms and
Information Management
* Debora Donato, Yahoo! Research Barcelona
* Faith Ellen, Univ. Toronto
* Phil Gibbons, Intel Research Pittsburgh
* Rob van Glabbeek, Stanford Univ. and National ICT Australia
* Monika Henzinger, EPFL Lausanne
* Christos Kaklamanis, Univ. of Patras
* Fabian Kuhn, MIT
* Miroslaw Kutylowski, Wroclaw University of Technology
* Christian Lengauer, Univ. Passau
* Stefano Leonardi, Sapienza Univ. of Rome
* Friedhelm Meyer auf der Heide, Univ. Paderborn (PC chair)
* Dusko Pavlovic, Oxford Univ. and Kestrel Institute
* Andrzej Pelc, Univ. du Québec en Outaouais
* Giuseppe Persiano, Univ. Salerno
* Frank Pfenning, CMU
* Geppino Pucci, Univ. Padova
* Christian Scheideler, Univ. Paderborn
* Nir Shavit, Tel Aviv Univ.
* Berthold Vöcking, RWTH Aachen
* Gerhard Weikum, MPI-Saarbrücken
Workshops Chair:
* Ralf Klasing, CNRS & Univ. Bordeaux (LaBRI) & INRIA
Publicity Chairs:
* Nicolas Bonichon, Univ. Bordeaux (LaBRI) & INRIA
* Lionel Eyraud-Dubois, INRIA & Univ. Bordeaux (LaBRI)
* Frédéric Mazoit, Univ. Bordeaux (LaBRI)
Conference Secretariat:
* Laetitia Grimaldi, INRIA, Bordeaux
ICALP 2010 is organised by the INRIA Bordeaux - Sud-Ouest research
center in collaboration with the LaBRI, computer science laboratory of
CNRS and the University of Bordeaux.
===========================================================================
===========================================================================
11. (from Thomas Hinze) CFP: Eleventh International Conference on Membrane
Computing (CMC11), Jena, Germany, 24-27 August 2010:
*********************** CMC11 Call for Papers *************************
Eleventh International Conference on Membrane Computing (CMC11)
Friedrich-Schiller University Jena, Germany, 24-27 August 2010
http://cmc11.uni-jena.de
***********************************************************************
Membrane computing is an area of computer science aiming to abstract
computing ideas and models from the structure and the functioning of living
cells, as well as from the way the cells are organized in tissues or higher
order structures. It deals with membrane systems, also called P systems,
which are distributed and parallel algebraic models processing multisets of
objects in a localised manner (evolution rules and evolving objects are
encapsulated into compartments delimited by membranes), with an essential
role played by the communication among compartments and with the
environment.
From a systems biological point of view, membrane systems provide a discrete
modelling approach to describe biological reaction systems composed of
interconnected membranes. Each membrane delimits a spatial region in which
chemical reactions can occur. Within a membrane, a multiset of objects
represents molecular particles while dedicated term-rewriting mechanisms
simultaneously execute reaction rules associated to each membrane.
Supplementary rules can control the exchange of objects among membranes or
even modify the membrane structure. Hence, capturing descriptional aspects
of structural dynamics is seen as an advantageous feature of membrane
systems. Further information about membrane computing can be found at the P
systems web page.
Having now for the first time the status of a conference, CMC11 aims for
continuing the fruitful tradition of 10 previous editions of the
International Workshop on Membrane Computing (WMC). It is intended to bring
together researchers working in membrane computing and related areas in a
friendly atmosphere enhancing communication and cooperation. We are pleased
to host CMC11 at the Friedrich Schiller University Jena in collaboration
with the Jena Centre for Bioinformatics under the auspices of the European
Molecular Computing Consortium and the Molecular Computing Task Force of the
Emergent Technologies Technical Committee at IEEE Computational Intelligence
Society.
IMPORTANT DATES
* Paper submission: 10 May 2010
* Paper notification: 4 June 2010
* Early bird registration: 11 June 2010
* Camera-ready version: 5 July 2010
* Registration deadline: 5 July 2010
* Conference: 24-27 August 2010
PROGRAM COMMITTEE
* Artiom Alhazov (Hiroshima, Japan)
* Gabriel Ciobanu (Iasi, Romania)
* Erzsébet Csuhaj-Varjú (Budapest, Hungary)
* Gabi Escuela (Jena, Germany)
* Rudolf Freund (Vienna, Austria)
* Pierluigi Frisco (Edinburgh, UK)
* Marian Gheorghe (Sheffield, UK) â~@~S Chair
* Thomas Hinze (Jena, Germany) â~@~S Co-chair
* Oscar H. Ibarra (Santa Barbara, USA)
* Vincenzo Manca (Verona, Italy)
* Maurice Margenstern (Metz, France)
* Giancarlo Mauri (Milan, Italy)
* Van Nguyen (Adelaide, Australia)
* Marion Oswald (Budapest, Hungary)
* Linqiang Pan (Wuhan, China)
* Gheorghe Paun (Bucharest, Romania and Sevilla, Spain)
* Mario J. Perez-Jimenez (Sevilla, Spain)
* Dario Pescini (Milan, Italy)
* Francisco J. Romero-Campero (Nottingham, UK)
* Monika Sturm (Dresden, Germany)
* Sergey Verlan (Paris, France)
SUBMISSION
Original research contributions (including significant work-in-progress) on
membrane computing, its applications and related subjects are sought.
Contributions reporting in-vivo or in-silico experimental results are
particularly encouraged. Authors are invited to submit their contribution as
PDF, written in English and preferrably prepared in LaTeX using Springer
LNCS style (llncs).
There are three categories for submission:
(1) Full paper of a reasonable length
(2) Software manual.
To assign a contribution to this category, the title should include the
phrase «Software Manual». A software manual should introduce a self-made
software tool relevant to applications for membrane computing or related
areas (e.g. a membrane system simulator, a membrane system designer, a
visualization tool, a format converter, a statistical tool, a new version of
an existing membrane computing tool with extended or revised features, ...).
A typical software manual consists of at least three parts: the user manual,
a (short) technical description, and some dedicated case studies like
simulation results or findings. Moreover, a software manual should contain a
download or access link via internet to enable the reviewers to test the
corresponding software.
(3) Extended abstract for poster presentation,
maximum four pages. Typical extended abstracts present significant
work-in-progress, late-breaking results, or initial self-dependent
contributions of students new in the field.
All submissions will be reviewed by at least three referees. The
pre-proceedings volume will be available during the conference. The final
proceedings, a volume in Springer Lecture Notes in Computer Science series,
for selected and additionally refereed papers, will be published after
CMC11.
SATELLITE WORKSHOPS
* Workshop on Non-Classical Models of Automata and Applications (NCMA)
* Applications of Membrane computing, Concurrency and Agent-based
modeling in POPulation biology (AMCA-POP)
* Fourth Workshop on Membrane Computing and Biologically Inspired
Process Calculi (MeCBiC)
OTHER RELEVANT DETAILS
Conform the tradition, the conference is planned as a friendly working
meeting, with a good balance of science, tourism, socializing, and
scientific collaboration. The provisional basic registration fee will be of
about 200 euros per person, to be paid along with registration via bank
transfer. The basic fee covers conference participation as well as the
tourist program. Further optional service will be offered upon supplementary
fees. The accommodation, to be paid by each participant, will be available
at various prices. To know more about Jena, consult:
http://en.wikipedia.org/wiki/Jena
We are looking forward to welcoming you to CMC11 in Jena.
Best regards
Thomas Hinze
(CMC11 PC co-chair and OC chair)
===========================================================================
===========================================================================
12. (from Julia Knight) Nominations for 2010 Shoenfield Prizes:
The ASL invites nominations for the Shoenfield Prizes for outstanding
expository writing in the field of logic. There are two Shoenfield prizes,
one for books and one for expository articles, each to be awarded
simultaneously every three years; the first Shoenfield Prizes were awarded
in 2007. The deadline for nominations for the 2010 Prizes is March 1, 2010.
There are two Shoenfield prizes, one for books and one for expository
articles. Any book first published in the past 9 years may be considered
for the book award. Any article published in the past 6 years, may be
considered for the article award.
The Shoenfield prizes were established by the ASL to honor the late Joseph
R. Shoenfield for his many outstanding contributions to logic and to the
ASL. Generations of logicians have especially valued Shoenfield's expository
gifts, and his writings provide models of lucidity and elegance. The fund on
which the Prize is based is administered by the ASL and the award is made by
the Association upon the recommendation of the ASL Committee on Prizes and
Awards. For general information about the Prize, visit
http://www.aslonline.org/info-prizes.html
--
Association for Symbolic Logic
Box 742 Vassar College
124 Raymond Avenue
Poughkeepsie, NY 12604, USA
Fax: 845-437-7830
asl@vassar.edu
WWW: aslonline.org
===========================================================================
===========================================================================
13. (from Edward A. Hirsch) Workshop on High Productivity Computations (HPC
2010) - Call for Papers:
***********************************************************************
Call for Papers
Workshop on High Productivity Computations (HPC 2010)
Organized in conjunction with CSR 2010
June 21-22, 2010, Kazan, Russia
http://csr2010.antat.ru/HPC.html
***********************************************************************
The workshop is intended to organize discussions about high productivity
computing means and models, including but not limited to high performance
and quantum information processing.
IMPORTANT DATES:
Deadline for submissions: February 25, 2010
Notification of acceptance: March 9, 2010
Workshop dates: June 21-22, 2010
INVITED SPEAKERS:
Kamil Valiev - Yuri Bogdanov
Bob Coecke
Farid Ablayev - Alexander Vasiliev
Sergei Moiseev
PROGRAM COMMITTEE CHAIRS:
Farid Ablayev (Kazan State University, Russia)
Bob Coecke (University of Oxford, UK)
PROGRAM COMMITTEE:
Rusins Freivalds (University of Latvia)
Aida Gainutdinova (Kazan State University, Russia)
Alexander Holevo (Steklov Mathematical Institute, Russia)
Richard Jozsa (University of Bristol, UK)
Airat Khasianov (Kazan State University, Russia)
Vladimir Korepin (Yang Institute for Theoretical Physics, USA)
Alexander Razborov (University of Chicago and Steklov Mathematical
Institute)
Alexander Vasiliev (Kazan State University, Russia)
Mingsheng Ying (Tsinghua University and University of Technology Sydney)
ORGANIZERS:
Institute of Informatics of Academy of Sciences of Tatarstan Republic, and
Kazan State University
SUBMISSIONS:
Authors are invited to submit an up to 6 pages abstract which provides an
essence of results allowing the program committee to evaluate the work.
Submissions of works in progress are encouraged but must be more substantial
than a research proposal. Submissions of original or already presented
research are welcome. Submissions should be in Postscript or PDF format and
should be sent to HPC.CSR2010@gmail.com by February 25, with a subject
"Submission". We're applying to publish the extended versions of abstracts
in Electronic Proceedings in Theoretical Computer Science.
FURTHER INFORMATION AND CONTACTS:
Web: http://csr2010.antat.ru/HPC.html
Email: HPC.CSR2010@gmail.com
===========================================================================
===========================================================================
14. (from Simona Ronchi Della Rocca) Workshop on Logic and Computational
Complexity (LCC '10):
====================================================
Preliminary call for papers
11th International Workshop on Logic and Computational Complexity
LCC'10
http://web.comlab.ox.ac.uk/people/stephan.kreutzer/lcc10/index.html
Edinburgh, July 10, 2010
affiliated to LICS 2010
====================================================
The Eleventh International Workshop on Logic and Computational
Complexity (LCC'10) will be held in Edinburgh on 10th July 2010, as
an affiliated meeting of Logic in Computer Science (LiCS) 2010 as
part of the 2010 Federated Logic Conference (FLoC).
LCC meetings are aimed at the foundational interconnections between
logic and computational complexity, as present, for example, in
implicit computational complexity (descriptive and type-theoretic
methods); deductive formalisms as they relate to complexity (e.g.
ramification, weak comprehension, bounded arithmetic, linear logic
and resource logics); complexity aspects of finite model theory and
databases; complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity.
The LCC'10 program consists of invited lectures as well as
contributed papers selected by the program committee.
Details on invited speakers will be made available later.
Types of submission
This year we invite two forms of submissions: full papers and
abstracts for short presentation.
Submissions published elsewhere or which are simultaneouosly being
submitted to another conference or workshop are welcome, but this
information must be revealed to the PC chairs.
Complete submissions:
Complete papers have a page limit of 15 pages, and their acceptance
implies a presentation of half an hour.
Abstract submissions:
Abstracts have a page limit of 4 pages, they are supposed to be used
for communicating problems or not yet developed ideas, and their
acceptance imply a short presentation of ten minutes.
Proceedings:
Post-preceedings could be considered, depending on the number and the
quality of the submissions.
Important Dates:
Submission deadline:
1 May 2010, 1am CET (GMT +1). The submission server will remain open
till 7am CET.
Author notification:
1 June 2010
Program Committee
* Andrei Bulatov (Vancouver)
* Phokion Kolaitis (Santa Cruz)
* Jan Krajicek (Prague)
* Stephan Kreutzer (Oxford, co-chair)
* Olivier Laurent (Lyon)
* Jean Yves Moyen (Paris 13)
* Damian Niwinski (Warsaw)
* Simona Ronchi Della Rocca (Torino, co-chair)
*
Steering Committee
* Michael Benedikt (Oxford) (Co-chair)
* Robert Constable (Cornell)
* Anuj Dawar (Cambridge)
* Fernando Ferreira (Lisbon)
* Martin Hofmann (U Munich)
* Neil Immerman (U Mass. Amherst)
* Neil Jones (Copenhagen)
* Bruce Kapron (U Victoria)
* Daniel Leivant (Indiana U) (Co-chair)
* Jean-Yves Marion (LORIA Nancy)
* Luke Ong (Oxford)
* Martin Otto (Darmstadt)
* James Royer (Syracuse)
* Helmut Schwichtenberg (U Munich)
* Pawel Urzyczyn (Warsaw)
*
===========================================================================
===========================================================================
Items for the next CiE Newsletter should be sent to s.b.cooper@leeds.ac.uk
to arrive by February 14, 2010
___________________________________________________________________________
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE 2010 http://www.cie2010.uac.pt/
CiE Membership Application Form http://www.cs.swan.ac.uk/acie
ALAN TURING YEAR http://www.turingcentenary.eu/
___________________________________________________________________________