[FOM] [CiE] Newsletter No.39, September 19, 2010
S Barry Cooper
pmt6sbc at maths.leeds.ac.uk
Sun Sep 19 12:42:34 EDT 2010
CiE Newsletter No.39, September 19, 2010:
September has been a busy month - lots of
activity on the Turing centenary, with TCAC
meetings, and details of the Turing-related
Newton Institute programme in 2012 being firmed
up (see below). Also, the first call for papers
from the CiE 2011 organisers appeared (also below).
We should also report that Vasco Brattka has
taken over the negotiations around the proposed
CiE journal "COMPUTABILITY", and we are still
hoping for its first appearance during the 2012
Turing centenary - although there is a long way
to go yet. A first priority, as voiced by members
at the AGM in the Azores, is free online access for all CiE members.
It is a short deadline for the next Newsletter - items needed by Oct. 1.
Note: This is the last CiE Newsletter to be
copied to the old CiE Network list. Only existing
CiE members will receive it from now on. A
membership application form can be found at:
http://www.cs.swan.ac.uk/acie
___________________________________________________________________________
CONTENTS:
1. First Announcement: Computability in Europe
2011 (CiE 2011) - Models of Computation in Context
2. Preliminary details of the Isaac Newton
Institute programme in Cambridge associated with the Turing Centenary
3. First Call for Papers - 6th International
Computer Science Symposium in Russia (CSR 2011)
4. Call for Papers: TLCA'11, 1-3 June 2011, Novi Sad
5. STACS 2011 - Last Call for Papers
6. Call for papers - Developments in Implicit
Computational ComplExity (DICE 2011)
7. Second call for papers - CCA 2010 post conference special issue
8. Postdoctoral Position in Algorithms (Berlin)
9. 2nd CFP: Evolutionary Intelligence: Special Issue on Alan Turing
===========================================================================
===========================================================================
1. (from Alexandra Soskova) First Announcement:
Computability in Europe 2011 (CiE 2011) - Models of Computation in Context:
**********************************************************************
First Announcement
COMPUTABILITY IN EUROPE 2011
Models of Computation in Context
Sofia, Bulgaria, 27 June- 02 July
http://cie2011.fmi.uni-sofia.bg
Deadline for submissions: January 14, 2011
**********************************************************************
Computability in Europe provides the largest international conference
dealing with the full spectrum of computability-related research.
CiE 2011 is the seventh conference in the series and emphasises the
connections and context, within the traditional CiE respect for
researchers' autonomy and diversity of approach. CiE in Sofia will
bring context, multidisciplinary perspective and computability-
theoretic focus to a wide spectrum of disciplines - including computer
science, mathematics and logic, physics and quantum theory, biology
and informatics, linguistics and philosophy, neuroscience and learning
theory. CiE serves as an interdisciplinary forum for research in all
aspects of computability and foundations of computer science, as well
as the interplay of these theoretical areas with practical issues in
computer science and with other disciplines such as biology,
mathematics, philosophy, or physics. We particularly invite papers
that build bridges between different parts of the research community.
Since women are underrepresented in mathematics and computer science,
we emphatically encourage submissions by female authors.
The main events in this year conference are as follows:
Tutorials:
Jack Lutz (Iowa State University)
Geoffrey Pullum (University of Edinburgh)
Confirmed plenary speakers:
Scott Aaronson (MIT)
Christel Baier (University of Bonn)
Michiel van Lambalgen (University of Amsterdam)
Antonio Montalban (University of Chicago)
Alexandra Shlapentokh (East Carolina University)
Theodore Slaman (UC Berkley)
Alasdair Urquhart (University of Toronto)
Special sessions:
Computability in Analysis, Algebra, and Geometry
(Organizers: Alexandra Shlapentokh, Dieter Spreen)
Classical Computability Theory
(Organizers: Doug Cenzer, Bjørn Kjos-Hanssen)
Natural Computing
(Organizers: Erzsébet Csuhaj-Varjú, Ion Petre)
Relations between the physical world and formal
models of computability (Organizers: Viv Kendon, Sonja Smets)
Theory of transfinite computations
(Organizers: Peter Koepke, C.T. Chong)
Computational Linguistics
(Organizers: Tejaswini Deoskar, Tinko Tinchev)
SUBMISSIONS: The Programme Committee cordially invites all
researchers in the area of the conference to submit their papers
(in PDF-format, at most 10 pages) for presentation at CiE 2011
to http://www.easychair.org/conferences/?conf=cie2011. The best
of the accepted papers will be published in the conference
proceedings within the Lecture Notes in Computer Science (LNCS)
series of Springer, which will be available at the conference.
Other accepted contributed papers together with abstracts of
informal presentations will appear in our local pre-conference
proceedings volume. Authors of accepted papers are expected to
present their work at the conference. Submitted papers must
describe work not previously published, and they must neither
be accepted nor under review at a journal or at another conference
with refereed proceedings. All papers need to be prepared in
LNCS-style LaTeX. Papers should not exceed 10 pages; full proofs
may appear in a technical appendix which will be read at the
reviewers' discretion. Submissions authored or co-authored by
members of the Programme Committee are not allowed.
IMPORTANT DATES:
Deadline for submissions: January 14, 2011
Notification of authors: March 12, 2011
Final version: April 2, 2011
CiE 2011: June 27 - July 2, 2011
PROGRAMME COMMITTEE: Selim Akl, Albert Atserias, Anthony Beavers,
Arnold Beckmann, Paola Bonizzoni, Anne Condon, Thierry Coquand,
Anuj Dawar, Fernando Ferreira, Denis Hirschfeldt, Radha Jagadeesan,
Neil Jones, Natasha Jonoska, Achim Jung, Viv Kendon, Julia Knight,
Phokion Kolaitis, Benedikt Löwe, Elvira Mayordomo, Dag Normann
(co-chair), Jan-Willem Romeijn, Marie-France Sagot, Dirk Schlimm,
Anthony Seda, Nir Shavit, Ivan Soskov (co-chair), Alexandra Soskova,
Sarah Teichmann, Peter van Emde Boas, Jan van Leeuwen, Klaus Wagner,
Andreas Weiermann.
LOCAL ORGANIZING COMMITTEE: Angel Dichev, Hristo Ganchev, Dimitar
Guelev, Vladislav Nenchev, Stela Nikolova, Dimitar Shiyachki,
Alexandra Soskova (Chair), Mariya Soskova, Stefan Vatev, Mitko
Yanchev, Anton Zinoviev.
Please e-mail your inquiries to cie2011 at fmi.uni-sofia.bg .
===========================================================================
===========================================================================
2. (from Barry Cooper) Preliminary details of the
Isaac Newton Institute programme in Cambridge
associated with the Turing Centenary:
For your diaries, there are some preliminary
details of the Isaac Newton Institute programme in Cambridge
SEMANTICS AND SYNTAX. A LEGACY OF ALAN TURING
http://www.newton.ac.uk/programmes/SAS/
associated with the Turing Centenary, to take
place from 9 January 2012 to 6 July 2012.
Here is a rough schedule giving the current plans for INI-related and
Cambridge-based activities during this period:
9-10 Jan. Opening Event
26-30 Mar. Workshop "Logical Approaches to Barriers in Computing and
Complexity II"
10-13 Apr. Workshop "Formal and Computational Cryptographic Proofs"
15-19 Apr. EuroCrypt 2012
12-16 Jun. Workshop "The Incomputable"
18-23 Jun. Computability in Europe 2012
2-6 Jul. Workshop "Randomness"
6 Jul. Final Event
Organisers:
Arnold Beckmann
Barry Cooper
Benedikt Loewe
Elvira Mayordomo
Nigel Smart
Further information will appear on the webpage,
or can be obtained from the Principal Organiser
of the Newton Institute programme:
Benedikt Loewe <b.loewe at uva.nl>
===========================================================================
===========================================================================
3. (from Alexander S. Kulikov) First Call for
Papers - 6th International Computer Science Symposium in Russia (CSR 2011):
***********************************************************************
First Call for Papers
6th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2011)
June 14-18, 2010, St. Petersburg, Russia
http://logic.pdmi.ras.ru/csr2011/
***********************************************************************
CSR 2011 intends to reflect the broad scope of international cooperation in
computer science. It is the sixth conference in a
series of regular events started with CSR 2006 in
St. Petersburg (see LNCS 3967), CSR 2007 in
Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow
(see LNCS 5010), CSR 2009 in Novosibirsk (see
LNCS 5675), and CSR 2010 in Kazan (see LNCS 6072).
IMPORTANT DATES
Deadline for submissions: December 6, 2010
Notification of acceptance: February 6, 2011
Conference dates: June 14-18, 2011
As has become tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!
TOPICS
include, but are not limited to:
* algorithms and data structures
* combinatorial optimization
* constraint solving
* computational complexity * cryptography
* combinatorics in computer science
* formal languages and automata
* 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
OPENING LECTURE
Dima Grigoriev (Institut des Mathematiques de Lille, France)
INVITED SPEAKERS
Manindra Agrawal (Indian Institute of Technology Kanpur, India)
Jarkko Kari (University of Turku, Finland)
Alexander Shen (LIF Marseille, France) Madhu
Sudan (MIT & Microsoft Research, USA)
The full list of invited speakers TBA.
PROGRAM COMMITTEE
Nikolai K. Vereshchagin (Moscow State University, Russia; Chair)
Farid Ablayev (Kazan State University, Russia)
Maxim Babenko (Moscow State University, Russia)
Olivier Carton (Universite Paris Diderot, France)
Bruno Durand (Universite de Provence, Marseille)
Anna Frid (Sobolev Institute of Mathematics, Russia)
Valentine Kabanets (Simon Fraser University, Canada)
Juhani Karhumaki (University of Turku, Finland)
Michal Koucky (Institute of Mathematics, Czech Republic)
Meena Mahajan (Institute of Mathematical Sciences, India)
Yuri Matiyasevich (Steklov Institute of Mathematics at St. Petersburg,
Russia)
Pierre McKenzie (Universite de Montreal, Canada)
Ilya Mironov (Microsoft Research, USA)
Ilan Newman (Haifa University)
Alexander Razborov (University of Chicago, USA and
Steklov Mathematical Institute, Russia)
Miklos Santha (Universite Paris-Sud, France)
Nitin Saxena (Hausdorff Center for Mathematics, Germany)
Valentin Shehtman (Institute for the Information Transmission Problems,
Russia)
Alexander Sherstov (Microsoft Research, New England)
Thomas Thierauf (Aalen University, Germany)
Oleg Verbitsky (Institute for Applied Problems of
Mechanics and Mathematics, Ukraine)
Mikhail Volkov (Ural State University, Russia)
Igor Walukiewicz (Universite de Bordeaux, France)
ORGANIZERS
Steklov Institute of Mathematics at St.
Petersburg of the Russian Academy of Sciences and
Academic University of the Russian Academy of Sciences
CONFERENCE CHAIR
Alexander S. Kulikov (Steklov Institute of Mathematics at
St. Petersburg, Russia)
SUBMISSIONS
Authors are invited to submit an extended abstract or a full paper of at
most
12 pages, not including references, in the LNCS format (LaTeX, as pdf; final
version with source); instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-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.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2011
SATELLITE WORKSHOPS
A workshop on post-quantum cryptography, which is a satellite
workshop of CSR 2011, will be held in cooperation with PDMI on
June 12-13, 2011. The workshop will focus on new ideas in cryptography,
in particular in public key cryptography, that could lead to cryptographic
schemes resistant against attacks by quantum computers. Topics of interest
include (but are not restricted to): authentication, key establishment,
secret sharing, multiparty computation, hash functions. Workshop
co-chairs are Dima Grigoriev and Vladimir Shpilrain;
contact email: postquantum at logic.pdmi.ras.ru
FURTHER INFORMATION AND CONTACTS
Web: http://logic.pdmi.ras.ru/csr2011/
Email: csr2011 at logic.pdmi.ras.ru
===========================================================================
===========================================================================
4. (from Luca Paolini) Call for Papers: TLCA'11, 1-3 June 2011, Novi Sad:
CALL FOR PAPERS
TLCA 2011, 1-3 June 2011, Novi Sad
http://www.rdp2011.uns.ac.rs/tlca/index.html
The 10th Conference on Typed Lambda Calculi and Applications (TLCA
2011) is a forum for original research in the theory and applications
of typed lambda calculus, broadly construed. Suggested, but not
exclusive, list of topics for submission are:
* Proof-theory: formal reasoning based on type theory, linear
logic and proof nets, type-theoretic aspects of computational complexity
* Semantics: game semantics, realisability, categorical and other models
* Types: dependent types, polymorphism, intersection types and
related approaches (union types, refinement / liquid types,
behavioural types), type inference, types
in program analysis and verification
* Programming: foundational aspects of functional and
object-oriented programming, flow analysis of higher-type computation,
program equivalence (step-indexed, bisimulation and related methods)
IMPORTANT DATES
---------------
26 January 2011: Submission of titles and short abstracts
2 February 2011, 23:00 Greenwich Mean Time:
Strict deadline for submission of 15-page full papers
23 March 2011: Notification of acceptance
3 April 2011: Camera-ready paper versions due
(The above dates are tentative, to be confirmed as soon as possible.)
Programme Committee Chair
* Luke Ong (Oxford, GB)
Programme Committee
* Thorsten Altenkirch (University of Nottingham)
* Stefano Berardi (University of Torino)
* Adriana Compagnoni (Stevens Institute of Technology, New Jersey)
* Giles Dowek (Ecole Polytechnique, Paris)
* Silvia Ghilezan (University of Novi Sad)
* Hugo Herbelin (INRIA, Paris)
* Atsushi Igarashi (Kyoto University)
* Ranjit Jhala (UC San Diego)
* Ralph Matthes (CNRS, IRIT)
* Ugo dal Lago (University of Bologna)
* Luke Ong (University of Oxford) (PC Chair)
* Rick Statman (Carnegie Mellon University)
* Tachio Terauchi (Tohoku University)
* Nobuko Yoshida (Imperial College, London)
TLCA Publicity Chair
* Luca Paolini (Turin)
===========================================================================
===========================================================================
5. (from Thomas Schwentick) STACS 2011 - Last Call for Papers:
************************************************************************
28th International Symposium on Theoretical Aspects of Computer Science
STACS 2011 - LAST CALL FOR PAPERS
March 10-12, 2011, Dortmund, Germany
Deadline for submission: September 24, 2010
Submission site: http://www.easychair.org/conferences/?conf=stacs2011
http://stacs2011.de/
************************************************************************
SCOPE
********
Authors are invited to submit papers presenting original and
unpublished research on theoretical aspects of computer
science. Typical areas include (but are not limited to):
* Algorithms and data structures, including: parallel and distributed
algorithms, computational geometry, cryptography, algorithmic learning
theory;
* Automata and formal languages;
* Computational and structural complexity;
* Logic in computer science, including: semantics, specification, and
verification of programs, rewriting and deduction;
* Current challenges, for example: biological computing, quantum
computing, mobile and net computing.
PROGRAM COMMITTEE
***************************
Dietmar Berwanger, ENS Cachan
Patrick Briest, Paderborn University
Christian Choffrut, LIAFA, Universite Denis
Diderot Benjamin Doerr, MPI Saarbrucken
Christoph Dorr, Ecole Polytechnique (co-chair)
Leah Epstein, University of Haifa
Thomas Erlebach, University of Leicester
Michele Flammini, University of L'Aquila Nicolas Hanusse, LaBRI Bordeaux
Markus Holzer, Giessen University
Daniel Marx, Tel Aviv University
Claire Mathieu, Brown University
Colin McDiarmid, Oxford University
Rolf Niedermeier, Jena University
Nicolas Ollinger, Aix-Marseille Universite
Marco Pellegrini, CNR Pisa
Jean-Francois Raskin, Universite Libre de Bruxelles
Thomas Schwentick, TU Dortmund University (co-chair)
Jeffrey Shallit, University of Waterloo
Till Tantau, University of Lubeck
Sophie Tison, Universite de Lille
Ronald de Wolf, CWI Amsterdam
INVITED SPEAKERS
****************
- Susanne Albers, Humboldt University Berlin
- Veronique Cortier, LORIA Nancy
- Georg Gottlob, Oxford University
SUBMISSIONS
***********
Authors are invited to submit a draft of a full paper with at most 12
pages (STACS style or similar - e.g. LaTeX article style, 11pt
a4paper) at
http://www.easychair.org/conferences/?conf=stacs2011.
The title page must contain a classification of the topic
covered, preferably using the list of topics above. The paper should
contain a succinct statement of the issues and of their motivation, a
summary of the main results, and a brief explanation of their
significance, accessible to non-specialist readers. 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 with published
proceedings is not allowed.
PROCEEDINGS
***********
Accepted papers will be published in the proceedings of the Symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss
Dagstuhl. This guarantees perennial, free and easy electronic access,
while the authors will retain the rights over their work. In
addition, the proceedings will also be available as archives in the
open access electronic repositories HAL and arXiv. With their
submission, authors consent to sign a license authorizing the program
committee chairs to organize the electronic publication of their paper
if it is accepted. Further details are available on www.stacs-conf.org
and on the conference website, stacs2011.de.
Instructions for the preparation of final manuscripts can be found at
the LIPIcs website:
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/.
Participants of the conference will receive a USB-stick with an
electronic version of the proceedings. It is also planned to publish
in a journal a selection of papers.
IMPORTANT DATES
***************
Deadline for submission: September 24, 2010
Notification to authors: November 29, 2010
Final version: January 3, 2011
Symposium: March 10-12, 2011
===========================================================================
===========================================================================
6. (from Jean-Yves Marion) Call for papers -
Developments in Implicit Computational ComplExity (DICE 2011):
-----------------------------------------------------------------------
------- Call for papers ---------
-----------------------------------------------------------------------
Second International Workshop on
Developments in Implicit Computational complExity
(DICE 2011)
http://dice11.loria.fr/
April, 2nd-3rd, Saarbrucken, Germany
as part of ETAPS 2011
-----------------------------------------------------------------------
SCOPE AND TOPIC:
The area of Implicit Computational Complexity
(ICC) has grown out from several proposals to use
logic and formal methods to provide languages for
complexity- bounded computation (e.g. Ptime,
Logspace computation). It aims at studying
computational complexity without referring to
external measuring conditions or a particular
machine model, but only by considering language
restrictions or logical/computational
principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather than
descriptive methods). In this approach one
relates complexity classes to restrictions on
programming paradigms (functional programs,
lambda calculi, rewriting systems), such as
ramified recurrence, weak polymorphic types,
linear logic and linear types, and interpretative
measures. The two main objectives of this area are:
- to find natural implicit characterizations of various complexity
classes of
functions, thereby illuminating their nature and importance;
- to design methods suitable for static verification of program
complexity.
Therefore ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis.
The workshop will be open to contributions on various aspects of ICC
including (but not exclusively):
- types for controlling complexity,
- logical systems for implicit computational complexity,
- linear logic,
- semantics of complexity-bounded computation,
- rewriting and termination orderings,
- interpretation-based methods for implicit complexity,- programming
languages for complexity bounded computation, -
application of implicit complexity to other programming paradigms
(e.g. imperative or object-oriented languages)
The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was
held in 2010 at ETAPS. Before that, several meetings
on this topic had already been held with success in Paris in
2008(WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in
Marseille in 2006
(GEOCAL'06 workshop on Implicit
computationalcomplexity,
http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) ,
and Paris in 2004 (ICC and logic meeting,
http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html).
INVITED SPEAKERS: TBA
IMPORTANT DATES:
* Paper submission: December 15th, 2010
* Notification date: January 27th, 2011
* Final version due: February 8th, 2011
* Workshop: April 2nd-3rd, 2011
SUBMISSION PROCEDURE:
There will be two categories of submissions:
* Full papers: up to 15 pages (including bibliography).
* Extended abstracts for short presentations (that will not be
included in the proceedings): up to 3 pages;
Authors must indicate if their submission belongs to the second
category (by mentioning "(Extended Abstract)" in the title).
Papers must be sumbitted electronically, as pdf files, at the
following URL:
http://www.easychair.org/conferences/?conf=dice2010
Submissions of the first category (full papers) should not have been
published before or submitted simultaneously
to another conference or journal. This restriction does not hold for
the second category (extended abstracts).
These latter submissions will be an opportunity to present work in
progress or to get a feedback from
the audience on a work already published elsewhere. Submissions of
papers authored by PC members are allowed.
We plan to publish post-proceedings.
PROGRAMME COMMITTEE:
Amir Ben-Amram (Academic College of Tel-Aviv)
Patrick Baillot (ENS Lyon, CNRS)
Jean-Yves Marion (Universite de Lorraine) (Chair)
Simone Martini (Universite di Bologna)
Damiano Mazza (Universite Paris 13)
Georg Moser (Universitat Innsbruck)
Ricardo Pena (Universidad de Madrid)
Luca Roversi (Universite di Torino)
Jim Royer (Syracuse University)
STEERING COMMITTEE:
Patrick Baillot (ENS Lyon, CNRS) (Chair)
Martin Hofmann (Ludwig-Maximilians-Universitat Munchen)
Jean-Yves Marion (Universite de Lorraine)
Simona Ronchi Della Rocca (Universite di Torino)
FINANCIAL SUPPORT: The workshop is partially supported by:
ANR project COMPLICE (Implicit Computational Complexity, Concurrency
and Extraction), ANR-08-BLANC-0211-01.
CONTACT: Jean-Yves.Marion at loria.fr
===========================================================================
===========================================================================
7. (from Ning Zhong) Second call for papers - CCA
2010 post conference special issue:
SECOND CALL FOR PAPERS
CCA 2010 Post Conference Special Issue
The Seventh International Conference on
Computability and Complexity in Analysis (CCA
2010) took place from June 21 to June 25, 2010,
in Zhenjiang, China. There will be a special
issue dedicated to CCA 2010 in the open access journal
Logical Methods in Computer Science
http://www.lmcs-online.org/
We invite submissions to this special issue of original research papers
in all CCA related areas. Papers not presented at
CCA 2010 may also be submitted. All submitted
papers will be subject to the usual refereeing
process of the journal. Submitted papers must not
be previously published nor submitted for
publication elsewhere and must deviate
significantly from the CCA 2010 conference proceedings in PETCS.
The authors should follow the instructions for the authors on the LMCS web page
http://www.lmcs-online.org/ojs/information.php
with the following special author instructions:
1. Register as an author on the web page lmcs-online.org
and use the special issue code:
-C-C-A-1-0-
(In case you are already registered, go to
"profile" and enter the above special code under "register for special issue".)
2. Go through the submission routine on the webpage.
In Step 0 choose the name of the meeting for which this special issue is
being organized.
The authors should prepare their manuscripts
using the style file requested by the journal
upon submission. Please see the LMCS web page
http://www.lmcs-online.org/Information/style.php
for instructions on style for authors.
Deadline for submission: November 29, 2010
Notification: March1, 2011
Final Version: April 1, 2011
Martin Escardo
Klaus Weihrauch
Xizhong Zheng
Ning Zhong
(Editors of Special Issue)
===========================================================================
===========================================================================
8. (from Susanne Albers) Postdoctoral Position in Algorithms (Berlin):
Postdoctoral Position in Algorithms
Humboldt University Berlin
A postdoctoral position in the area of efficient algorithms is available
in the Department of Computer Science at Humboldt University Berlin
under the direction of Prof. Susanne Albers.
The postdoc may pursue his/her own line of research but a research
interest in approximation and online algorithms, algorithmic game theory
or algorithm engineering is very welcome. Information about the
algorithms group at Humboldt University can be found at:
http://www2.informatik.hu-berlin.de/alkox/group/
There exist close collaborations with various other research groups in
Berlin, hosted at the Free University and the Berlin Institute of
Technology.
The position is supported by a grant of the German Research Foundation
and provides a competitive 12 month salary with standard benefits. The
appointment is initially for one year and can be renewed for a second
year subject to satisfactory progress and mutual agreement. The expected
start date of the position is January 2011.
The successful candidate should have a PhD degree in computer science or
mathematics. The application material should include (1) a cover letter
describing the interest in the position, (2) a CV and list of
publications, (3) a short research summary, and (4) the names and
contact information of at least two references. The material should be
sent electronically to <albers at informatik.hu-berlin.de>.
Applications will be reviewed starting from October 4, 2010 until the
position is filled.
Susanne Albers
Department of Computer Science
Humboldt University Berlin
Unter den Linden 6
10099 Berlin, Germany
E-mail: albers at informatik.hu-berlin.de
http://www2.informatik.hu-berlin.de/~albers/
===========================================================================
===========================================================================
9. (from Christof Teuscher) 2nd CFP: Evolutionary
Intelligence: Special Issue on Alan Turing:
Colleagues,
In 1948 Alan Turing wrote a short paper entitled
"Intelligent Machinery" in which he drew an
analogy between learning and search.
Significantly, he suggested that intellectual,
genetical and cultural searches may all be used
to inspire mechanisms by which to achieve machine
intelligence. 2012 sees the centenary of Turing's
birth (http://www.turingcentenary.eu) and to join
in the celebrations of his remarkable
contributions to computer science and artificial
intelligence, Evolutionary Intelligence will
publish a special issue in January of that year.
Submissions are welcomed that use simulated
evolution in conjunction with other ideas of
Turing's, such as his unorganised machines, to achieve artificial intelligence.
Details of the journal can be found online:
http://www.springer.com/engineering/journal/12065
The deadline for submissions is
*** Dec 1, 2010 ***
Please see
http://www.teuscher-lab.com/2012_turing_special_issue
for more details.
Please contact me if you intend to contribute to this special issue.
--
Christof Teuscher
Portland State University
Department of Electrical and Computer Engineering
http://www.teuscher-lab.com/christof
http://www.teuscher-lab.com
===========================================================================
===========================================================================
Items for the next CiE Newsletter should be sent
in plain text (avoiding accents) to
s.b.cooper at leeds.ac.uk to arrive by October 1st, 2010
___________________________________________________________________________
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE 2011 http://cie2011.fmi.uni-sofia.bg/?q=node/1
CiE 2012 http://www.cie2012.eu
CiE Membership Application Form http://www.cs.swan.ac.uk/acie
ALAN TURING YEAR http://www.turingcentenary.eu/
___________________________________________________________________________
More information about the FOM
mailing list