CiE Newsletter No.6, February 17, 2009 ___________________________________________________________________________ CONTENTS: 1. LEEDS SYMPOSIUM ON PROOF THEORY AND CONSTRUCTIVISM, July 3-16, 2009 2. BCTCS, University of Warwick, April 6-9, 2009: Call for Participation 3. SECOND CALL FOR PAPERS / POSTERS UNCONVENTIONAL COMPUTATION UC' 09 4. International Workshop "Structures and Deduction" (SD09) 5. CALL FOR PAPERS - ICALP'09, July 5-12, 2009, Rhodes, Greece 6. CFP: REACHABILITY PROBLEMS 2009, Submission: 23 April 2009 7. Special TCS Issue on "Theoretical Foundations of Evolutionary Computation" ========================================================================= 1. (from Laura Crosilla, Michael Rathjen and Stan Wainer) LEEDS SYMPOSIUM ON PROOF THEORY AND CONSTRUCTIVISM: ------------------------------------------------------------------------- LEEDS SYMPOSIUM ON PROOF THEORY AND CONSTRUCTIVISM A two week symposium on Proof Theory and Constructivism will be held in the Research Visitors' Centre of the School of Mathematics at Leeds, from 3rd July (arrival) to 16th July (departure) this year. It will comprise three connected events: 4th & 5th July: An LMS-funded conference on Proofs and Computations with speakers W. Buchholz (Munich), E.A. Cichon (Nancy), D. Normann (Oslo), W.W. Tait (Chicago), J.V. Tucker (Swansea), A. Weiermann (Ghent). This meeting will be in honour of Stan Wainer on the occasion of his 65th birthday. 5th & 6th July: A Gentzen Centenary Conference funded by the Goedel Society, celebrating 100 years since the birth of Gerhard Gentzen, the founder of structural proof theory. Speakers who have so far agreed to come are: M. Baaz (Vienna), G. Mints (Stanford), J. von Plato (Helsinki), G. Sundholm (Leiden). 7th - 16th July: An EPSRC-funded Research Workshop on Proof Theory and Constructivism. Though each day will begin with two plenary sessions, the emphasis will be on research activity within the areas: Ordinal Analysis, Proof Mining and Complexity, Constructive Foundations, and Constructive Methods in Mathematics. In addition to many of those aforementioned, the following have already indicated their intention to participate, and others (yet to be announced) are expected to come: P.Aczel (Manchester), T. Arai (Kobe), A. Beckmann (Swansea), U. Berger (Swansea), D. Bridges (Christchurch), S. Buss (San Diego), A. Cantini (Florence), R. Constable (Cornell), T. Coquand (Gothenberg), H. Friedman (Columbus), N. Gambino (Leicester), M. Hyland (Cambridge), G. Jaeger (Bern), H. Ishihara (JAIST), U. Kohlenbach (Darmstadt), R. Lubarsky (Florida), G. Sambin (Padua), P. Schuster (Munich), A. Setzer (Swansea), T. Strahm (Bern), W. Tait (Chicago), S. Tupailo (Tallinn), A. Weiermann (Ghent). Limited support is available for younger researchers, who are encouraged to attend. Basic accommodation is available at modest cost, at Lyddon Hall on the Leeds University Campus close to the School of Mathematics. For further information visit the web-site: http://www.personal.leeds.ac.uk/~matptw/index.html or contact the organisers at: matptw@leeds.ac.uk Organisers of the LMS meeting: Michael Rathjen and Laura Crosilla. Organisers of the other events: Michael Rathjen, Laura Crosilla, and Stan Wainer. ========================================================================= 2. (from Sara Kalvala) BCTCS, University of Warwick, April 6-9, 2009: Call for Participation: 25th British Colloquium for Theoretical Computer Science (BCTCS) 6th to 9th April 2009 University of Warwick, Coventry UK http://go.warwick.ac.uk/bctcs SCOPE The purpose of the BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. The conference will consist of invited keynote presentations by distinguished researchers and a number of contributed talks. LOCATION AND SCHEDULE BCTCS 2009 will be held at the campus of the University of Warwick, in the outskirts of Coventry, UK. The campus is located in the "Heart of England" and is easy to reach from most places in the UK. It is also close to Birmingham International Airport, which has flights to other cities in the UK, Europe, and further abroad. The event will start on Monday afternoon, with registration from 3pm and the invited talk by Noga Alon at 5pm. The meeting will end with lunch on Thursday. INVITED SPEAKERS BCTCS 2009 will be enriched by talks given by several invited distinguished speakers, including: * Noga Alon, Tel Aviv University * Paul Goldberg, University of Liverpool * Andy Gordon, Microsoft Research * Jane Hillston, University of Edinburgh * Alistair Sinclair, University of California at Berkeley * Bill Wadge, University of Victoria REGISTRATION Registration is now open. The early registration fee will apply until 28 February. Accomodation on campus is limited and we suggest registration as early as possible. CONTRIBUTED TALKS Participants at the colloquium are encouraged to present a contributed talk. Please prepare an abstract using the LaTeX template and submit at the abstract submission page. The abstracts of accepted contributed talks will be published in the Bulletin of the European Association for Theoretical Computer Science. The deadline for submission of abstracts is 28 February 2009. FELLOWSHIPS The BCTCS steering committee has obtained ongoing funding to support the participation of upto 45 graduate students at BCTCS. The fellowships cover registration including accomodation and meals, but not travel. Students enrolled at UK higher education institutions may apply for fellowships by filling the online application form. Fellowships will be allocated on a first-come, first-serve basis to those PhD students who submit an abstract and commit to presenting a contributed talk (see above). Some fellowships may be available to students not presenting contributed talks; decisions on these cases will be taken in March 2009. ORGANISATION AND FURTHER INFORMATION The conference is being organised by Artur Czumaj, Sara Kalvala, and Steve Matthews from the Department of Computer Science, University of Warwick. More information about the meeting including updates are available from the conference webpages at: http://go.warwick.ac.uk/bctcs We hope to see you there! ========================================================================= 3. SECOND CALL FOR PAPERS / POSTERS UNCONVENTIONAL COMPUTATION UC' 09: -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- UC 2009 8th International Conference on UNCONVENTIONAL COMPUTATION Ponta Delgada, PORTUGAL September 7-11, 2009 Deadline for submissions: April 10th, 2009 Conference Poster and Call for Papers/Posters can be downloaded from the Conference Homepage: http://www.uc09.uac.pt . TAKE A LOOK TO OUR WEBSITE -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- Original papers or posters are solicited in all areas of unconventional computation. Papers dealing with theory as well as with experiments and applications are welcome. Typical, but not exclusive, topics are: -  Amoeba-based computing -  Analogue computation -  Ant networks -  Algorithmic cooling -  Cellular automata -  Church-Turing thesis -  Cornerstones of the halting problem -  Diophantine equations -  Dynamic system computing -  Ergodic system computing -  Evolutionary computation -  Genetic networks -  Immune networks -  Molecular computing -  Nanocomputing -  Natural Computing -  Neural Computing -  Non-standard lambda-calculus and logics -  Optical computing -  P systems -  Reaction-diffusion computing -  Self-assembly -  Tiles -  Quantum computation -  Quantum protocols -  Unconventional Turing machines (infinite-time, relativistic, bio, etc.) -  Undecidability in Physical Theories All researchers in the area of the conference are kindly invited to submit their papers (at most 12 pages) electronically, via EASYCHAIR:       http://www.easychair.org/conferences/?conf=uc09 . The submissions of papers are expected to be in PDF format using the suitable class files of Springer LNCS. Joint submissions to other conferences are not permitted. Each accepted paper must be presented at the conference. The proceedings will be published by Springer LNCS series and will be available at the conference. Selected papers will be invited for Special Issues of well known Journals. We also encourage physicists, chemists, and biologists (students or senior researchers) to submit a poster (standard size A1 or 1 or 2 x A2). Posters should be focused on experimental laboratory prototypes of non-standard computing devices. The submissions of posters are also expected to be in PDF format. The author is responsible for printing out the poster. To submit a poster you should go to EASYCHAIR and choose the special topic "POSTERS" instead of a thematic topic. Submissions Due: April 10th, 2009 Notification: May 8th, 2009 Final Versions Due: June 5th, 2009 Contributed papers/posters will be selected from submissions received by the PROGRAMME COMMITTEE consisting of - Andrew ADAMATZY, UWE Bristol, UK - Selim AKL, Queen's University, Canada - Masashi AONO, RIKEN Advanced Science Institute, Japan - Edwin BEGGS, Swansea University, UK - Olivier BOURNEZ, Ecole Polytechnique, France - Mark BURGIN, University of California, Los Angeles, USA - Cristian S. CALUDE, University of Auckland, New Zealand - Luca CARDELLI, Microsoft Research Cambridge, UK - S. Barry COOPER, University of Leeds, UK - José Félix COSTA (co-chair), Tech. Univ. of Lisbon and Swansea Univ., Portugal and UK - James CRUTCHFIELD, Complexity Sciences Center, Univ. of California at Davis, USA - Martin DAVIS, Prof. Emeritus, New York University and Visiting Scholar, Berkeley, USA - Nachum DERSHOWITZ (co-chair), Tel Aviv University, Israel - Michael DINNEEN, University of Auckland, New Zealand - Gilles DOWEK, Ecole Polytechnique and INRIA, France - Rudolf FREUND, Vienna University of Technology, Austria - Dina Q. GOLDIN, Brown University, USA - Masami HAGIYA, University of Tokyo, Japan - Mark HOGARTH, University of Cambridge, UK - Natasha JONOSKA, University of South Florida in Tampa, USA - Lila KARI, University of Western Ontario, Canada - Julia KEMPE, Tel Aviv University, Israel - Yasser OMAR, ISEG, Technical University of Lisbon, Portugal - Ferdinand PEPER, National Inst. of Information and Communications Tech., Kobe, Japan - Mario J. PÃ~IREZ-JIMÃ~INEZ, University of Seville, Spain - Petrus H. POTGIETER, University of South Africa, South Africa - Kai SALOMAA, Queen's University, Canada - Hava SIEGELMANN, University of Massachusetts Amherst and Harvard University, USA - Darko STEFANOVIC, University of New Mexico, USA - Susan STEPNEY, University of York, UK - Christof TEUSCHER, Portland State University, USA - Jon TIMMIS, University of York, UK CONFERENCE: 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, Sevilla, Spain, in 2005, York, United Kingdom, in 2006, Kingston Ontario, Canada, in 2007, Vienna, Austria, in 2008, and Ponta Delgada (Azores), Portugal, in 2009. INVITED SPEAKERS: - Edwin BEGGS (Swansea University): Experimental Computation - Jarkko KARI (University of Turku): Cellular Automata - Carlos LOURENÃ~GO (University of Lisbon): Brain Dynamics - Przemyslaw PRUSINKIEWICZ (University of Calgary): Developmental Computing - Lukáš SEKANINA (Brno University of Technology): Evolvable Hardware: From successful applications to implications for the theory of computation TUTORIALS: - Manuel Lameiras CAMPAGNOLO (Technical University of Lisbon): Analogue Computation - James CRUTCHFIELD (University of California at Davis): Computational Mechanics: Natural Computation and Self-Organization - Martin DAVIS (Professor Emeritus, New York University and Visiting Scholar, Berkeley): Diophantine Equations WORKSHOPS: - Hyper-computation, Organized by Mike STANNETT (University of Sheffield) - Novel Computing Substrates, Organized by Andrew ADAMATZKI (University of West England, Bristol) - Physics and Computation, Organized by Olivier BOURNEZ (Ecole Polytechnique), and Gilles DOWEK (Ecole Polytechnique and INRIA) ORGANIZING COMMMITTEE - José Félix COSTA (chair), Tech. Univ. of Lisbon and Swansea Univ. Portugal and UK - Elisabete FREIRE, University of Azores, Portugal - Matthias FUNK, University of Azores, Portugal - Luís Mendes GOMES, University of Azores, Portugal - Hélia GUERRA, University of Azores, Portugal CONTACT ADDRESS: Elisabete FREIRE Department of Mathematics University of Azores Rua da Mãe de Deus 9501-855 Ponta Delgada Portugal Phone: (+351) 296 650 506 /  (+351) 296 650 000 e-mail: freire@uac.pt ========================================================================= 4. (from Lutz Strassburger) International Workshop "Structures and Deduction" (SD09): ******************************************************************* SECOND CALL FOR PAPERS International Workshop "Structures and Deduction" (SD09) July 20 - 24, 2009 organized as part of the European Summer School on Logic, Language and Information ESSLLI 2009 July 20 - 31, 2009 in Bordeaux ******************************************************************* ORGANIZERS: Michel Parigot (CNRS, Univ. Paris 7, France) Lutz Strassburger (INRIA Saclay-IdF, France) DESCRIPTION OF THE WORKSHOP: The topic of this workshop is the application of algebraic, geometric, and combinatorial methods in proof theory. In recent years many researchers have proposed approaches to understand and reduce "syntactic bureaucracy" in the presentation of proofs. Examples are proof nets, atomic flows, new deductive systems based on deep inference, and new algebraic semantics for proofs. These efforts have also led to new methods of proof normalisation and new results in proof complexity. The workshop is relevant to a wide range of people. The list of topics includes among others: algebraic semantics of proofs, game semantics, proof nets, deep inference, tableaux systems, category theory, deduction modulo, cut elimination, complexity theory, etc. The goal of the workshop is twofold: first, to bring together researchers from various fields who share the interest of understanding and dealing with structural properties of proofs and second, to provide an opportunity for PhD students and researchers to present and discuss their work with colleagues who work in the broad subject areas that are represented at ESSLLI. The workshop is intended to be a sequel of the ICALP-workshop SD05 in Lisbon 2005 . SUBMISSION DETAILS: Contributions can be regular papers, but also work in progress, programmatic/position papers or tutorials. Submissions should be formatted with the LNCS LaTeX style, take between two and fifteen pages and allow the committee to assess their merits with reasonable effort. The length limit can be relaxed for the versions that will be presented at the workshop, depending on the total bulk of the accepted contributions. Please use the SD'09 submission page handled by the EasyChair conference system, to submit papers. The accepted papers will appear in the workshop proceedings published by ESSLLI. One author of each accepted paper must attend the workshop in order to present the paper. WORKSHOP FORMAT: The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the first week of ESSLLI. There will be 2 or 3 slots for paper presentation and discussion per session. On the first day the workshop organizers will give an introduction to the topic. INVITED SPEAKER: Francois Lamarche (LORIA, Nancy) PROGRAM COMMITTEE: Lev Beklemishev (Moscow) Stefano Berardi (Torino) Agata Ciabattoni (Vienna) Alessio Guglielmi (Bath/Nancy) Martin Hyland (Cambridge) Grigori Mints (Stanford) Michel Parigot (Paris) Lutz Strassburger (Palaiseau) Kazushige Terui (Kyoto) IMPORTANT DATES: Deadline for submissions: February 15, 2009 Notification of acceptance: April 15, 2009 Deadline for final versions: May 11, 2009 Workshop dates: July 20 - 24, 2009 LOCAL ARRANGEMENTS: All workshop participants including the presenters will be required to register for ESSLLI. The registration fee for authors presenting a paper will correspond to the early student/workshop speaker registration fee. Moreover, a number of additional fee waiver grants will be made available by the ESSLLI local organizing committee on a competitive basis and workshop participants are eligible to apply for those. There will be no reimbursement for travel costs and accommodation. Workshop speakers who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. FURTHER INFORMATION: About the workshop: About ESSLLI: ========================================================================= 5. (from EATCS) CALL FOR PAPERS - ICALP'09, July 5-12, 2009, Rhodes, Greece: The submission server for ICALP 2009 is open. Submission deadline: February 10, Tuesday HTML Version of the CFP: http://icalp09.cti.gr/cfp.html Details follow. ___________________________________________________________________ CALL FOR PAPERS - ICALP\'09 36th International Colloquium on Automata, Languages and Programming July 5-12, 2009, Rhodes, Greece http://icalp09.cti.gr ___________________________________________________________________ The 36th 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 2009 in Rhodes, Greece. The main conference will take place from the 6th till the 11th of July, and will be preceded and followed by a series of Workshops. Following the successful experience of the last four editions, ICALP 2009 will complement the established structure of the scientific program based on Track A on Algorithms, Automata, Complexity and Games, and Track B on Logic, Semantics, and Theory of Programming, corresponding to the two main streams of the journal Theoretical Computer Science, with a special Track C on Foundations of Networked Computation: Models, Algorithms and Information Management. The aim of Track C is to allow a deeper coverage of a particular topic, to be specifically selected for each year\'s edition of ICALP on the basis of its timeliness and relevance for the theoretical computer science community. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A - Algorithms, Automata, Complexity and Games: * Algorithmic Game Theory * Approximation Algorithms * Automata Theory * 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, and Theory of Programming: * 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 * 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 SUBMISSION GUIDELINES 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. For further information on how to submit a paper to the conference, please visit the URL http://icalp09.cti.gr/index.php/Main/Submissions INVITED SPEAKERS * Georg Gottlob (Oxford University) * Thomas Henzinger (Ecole Polytechnique Fédérale de Lausanne) * Kurt Mehlhorn (Max-Planck-Institut für Informatik, Saarbrücken) * Noam Nisan (Google, Tel Aviv, and Hebrew University) * Christos Papadimitriou (University of California at Berkeley) IMPORTANT DATES * Submissions: February 10, 2009. * Notification: April 6, 2009 * Final version due: April 27, 2009 PROGRAM COMMITTEE Track A * Susanne Albers, Univ. of Freiburg (PC chair) * Gerth Brodal, Univ. of Aarhus * Martin Dyer, Univ. of Leeds * Irene Finocchi, Univ. of Rome \"La Sapienza\" * Anna Gal, Univ. of Texas at Austin * Naveen Garg, IIT Delhi * Raffaele Giancarlo, Univ. of Palermo * Andrew Goldberg, Microsoft * Mordecai Golin, Hong Kong Univ. * Michel Habib, LIAFA, Paris 7 * Thore Husfeldt, Lund Univ. * Kazuo Iwama, Univ. of Kyoto * Howard Karloff, AT&T Labs * Yishay Mansour, Tel Aviv Univ. and Google * Jiri MatouÅ¡ek, Charles Univ. Prague * Marios Mavronicolas, Univ. of Cyprus * Piotr Sankowski, Univ of Warsaw & ETH Zurich * Raimund Seidel, Univ. of Saarbrücken * Paul Spirakis, CTI & Univ. of Patras * Dorothea Wagner, Univ. of Karlsruhe * Peter Widmayer, ETH Zurich * Ronald de Wolf, CWI Amsterdam Track B * Albert Atserias,Univ. Politecnica de Catalunya, Barcelona * Jos Baeten, Eindhoven Univ. of Technology * Gilles Barthe, IMDEA Software, Madrid * Mikolaj Bojanczyk, Warsaw Univ. * Christian Choffrut, Univ. Denis Diderot, Paris * Roberto di Cosmo, Univ. Denis Diderot, Paris * Thierry Coquand, Göteborg Univ. * Kousha Etessami, Univ. of Edinburgh * Kim Guldstrand Larsen, Aalborg Univ * Dexter Kozen, Cornell Univ., Ithaca, NY * Stephan Kreutzer, Oxford Univ. * Orna Kupferman, Hebrew Univ. * Dale Miller, Ecole Polytechnique, Palaiseau * Markus Müller-Olm, Univ. Münster * Anca Muscholl, Univ. Bordeaux 1 * R. Ramanujam, Inst. of Math. Sciences, Chennai * Simona Ronchi Della Rocca, Univ. of Torino * Jan Rutten, CWI, Amsterdam * Vladimiro Sassone, Univ. of Southampton * Peter Sewell, Univ. of Cambridge * Howard Straubing, Boston College * Wolfgang Thomas, RWTH Aachen Univ. (PC chair) Track C * Hagit Attiya, Technion * Andrei Broder, Yahoo * Xiaotie Deng, City Univ. of Hong Kong * Danny Dolev, Hebrew Univ. * Michele Flammini, Univ. of L\'Aquila * Pierre Fraigniaud, CNRS, Paris * Ashish Goel, Univ. of Stanford * Matthew Hennessy, Trinity College Dublin * Kohei Honda, Univ. of London * Elias Koutsoupias, Univ. of Athens * Alberto Marchetti Spaccamela, Univ. of Rome \"La Sapienza\" (PC co-chair) * Yossi Matias, Google and Tel Aviv Univ. (PC co-chair) * Silvio Micali, MIT * Muthu Muthukrishnan, Google, NY * Moni Naor, Weizmann Institute * Mogens Nielsen, Univ. of Aarhus * Harald Raecke, Univ. of Warwick * Jose Rolim, Univ. of Geneva * Christian Schindelhauer, Univ. of Freiburg * Roger Wattenhofer, ETH Zurich * Martin Wirsing, Univ. of Munich ORGANIZING COMMITTEE Paul G. Spirakis Elias Koutsoupias Christos Kaklamanis CONTACT ADDRESSES For further information see: http://icalp09.cti.gr/ ========================================================================= 6. (from Igor Potapov) CFP: REACHABILITY PROBLEMS 2009, Submission: 23 April 2009: ++++++++++ Submissions: April 23, 2009 +++++++++++++ LIX Colloquium: 3rd WORKSHOP ON REACHABILITY PROBLEMS, RP'2009 (September 23-25, 2009, Ecole Polytechnique, France) --------------------------------------------------- ==== Deadline for submissions: April 23, 2009 ==== ==== Proceedings will be published in the ==== ==== Springer LNCS series ==== --------------------------------------------------- http://www.lix.polytechnique.fr/~bournez/LIXCRP09/ The annual fall colloquium organized by the Computer Science Department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009. Reachability Problems RP'2009 will take place at Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris). Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. 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 - Verification Invited Speakers: ================ - Ahmed Bouajjani ( University of Paris 7 ) - Thomas A. Henzinger ( EPFL in Lausanne ) - Oded Maler ( VERIMAG ) - Alexander Shen ( CNRS Marseille ) - Moshe Y. Vardi ( Rice University Submissions: ============ 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 probelms in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); predictability in iterative maps and new computational paradigms. Authors are invited to submit a draft of a full paper with at most 12 pages formatted according to LNCS guidelines. 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 pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Proceedings ============= The proceedings will be published in the Springer Verlag LNCS series and distributed during the conference. Selected papers will be invited to the special issue of a high quality journal devoted to RP 2009. Important dates: ================ - Submission: April 23, 2009 - Notification: May 30, 2009 - Final version: June 15, 2009 - Workshop: Sept. 23-25, 2009 Program Committee: ================ - Parosh Aziz Abdulla, Uppsala - Luca de Alfaro, Santa Cruz - Eugene Asarin, Paris - Vincent Blondel, Louvain - Bernard Boigelot, Liege - Ahmed Bouajjani , Paris - Olivier Bournez, Palaiseau - Cristian S. Calude, Auckland - Javier Esparza, Munchen - Laurent Fribourg, Cachan - Vesa Halava, Turku - Franjo Ivancic, Princeton - Oscar Ibarra, Santa Barbara - Alexei Lisitsa, Liverpool - Maurice Margenstern, Metz - Igor Potapov, Liverpool - Colin Stirling, Edinburgh - Wolfgang Thomas, Aachen - Hsu-Chun Yen, Taipei Workshop Organizers: ==================== - Olivier Bournez (Ecole Polytechnique) - Igor Potapov (University of Liverpool) Contact: ================ 3rd Workshop on Reachability Problems 2009 - RP'09 Olivier Bournez: bournez@lix.polytechnique.fr Igor Potapov: potapov@liverpool.ac.uk http://www.lix.polytechnique.fr/~bournez/LIXCRP09/ ========================================================================= 7. (from Per Kristian Lehre) Special TCS Issue on "Theoretical Foundations of Evolutionary Computation": Special Issue on "Theoretical Foundations of Evolutionary Computation" in Theoretical Computer Science (Elsevier) Submission Deadline: September 30, 2009. Guest Editors: Per Kristian Lehre, University of Birmingham, UK. p.k.lehre@cs.bham.ac.uk Frank Neumann, Max Planck Institute for Informatics, Germany. fne@mpi-inf.mpg.de Jonathan E. Rowe, University of Birmingham, UK. j.e.rowe@cs.bham.ac.uk Xin Yao, University of Birmingham, UK. x.yao@cs.bham.ac.uk Description: The theory of evolutionary computation (including, for example, run-time analysis of evolutionary algorithms, population dynamics, and fitness landscape analysis) has grown rapidly in recent years. Many papers have appeared in the last few years on various aspects of evolutionary computation theory. However, most of these papers were scattered among different journals in evolutionary computation, operations research and computer science, addressing different theoretical issues. It is high time to bring all such theoretical work together and examine the fundamental challenges in a single venue. The primary aim of this special issue is to report the latest development in foundations of evolutionary computation. It is envisaged that this special issue will serve as a milestone in reporting the latest breakthroughs and setting new directions in evolutionary computation. Potential authors are invited to submit papers describing original contributions to foundations of evolutionary computation. Although we are most interested in theoretical foundations, computational studies of a foundational nature may be considered. We interpret evolutionary computation in a broad sense in this special issue to include all meta-heuristics such as evolutionary algorithms, swarm intelligence (e.g., ant colony optimisation and particle swarm optimisation), differential evolution, culture algorithms, artificial immune systems, etc. This special issue will consider papers on a number of topics, including but not limited to, population dynamics, self-adaptation, run-time analysis of meta-heuristics, fitness landscapes and problem difficulty, and no free lunch theorems. All problem domains will be considered, including combinatorial and continuous optimisation, single-objective and multi-objective optimisation, constrained handling, dynamic and stochastic optimisation, co-evolution and evolutionary learning. Submission: Authors should submit their manuscripts to the Theoretical Computer Science Editorial Manager at http://ees.elsevier.com/tcs/ and indicate "Special Issue: T. F. Evolut. Comp. (Yao)" for their submission. All submitted papers must be the original work, not published before nor under consideration by another journal or conference. ========================================================================= Items for the next CiE Newsletter should be sent to pmt6sbc@leeds.ac.uk to arrive by March 1, 2009 -------------------------------------------------------------------------