[DMANET] ELC PD positions

---------------------------------------------------------------------
Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory
---------------------------------------------------------------------
http://www.al.ics.saitama-u.ac.jp/elc/en/?pd


The newly established Center for Exploring the Limits of Computation
(CELC, Tokyo, Japan) seeks applications for four post-doctoral fellow
positions in Computational Complexity Theory and related areas. The
appointments are for two years starting in April 2013 (or as soon as
possible). A monthly salary of approximately 350,000 Japanese yen
plus a research allowance will be offered. Applicants should hold a
PhD in theoretical computer science or related fields (or be expected
to do so by July 2013).

Two of the fellows will be based at the Tokyo site (Tokyo Institute of
Technology and the CELC) and two at the Kyoto site (Kyoto University).
Collaboration with other research groups of the ELC project (including
visits for several months) will be encouraged and supported.

Applications should include
* a curriculum vitae,
* list of publications,
* a research statement, and
* three letters of referees (to be sent directly from the referees).

Applications and letters of referees should be sent via email to
elc-pd-application@is.titech.ac.jp. Priority will be given to
applications received by December 20, 2012. Applicants may be invited
to an interview in early 2013 (the travel expenses will be covered).

---------
About ELC
---------

Exploring the Limits of Computation (ELC) is a five-year research
project funded by the Japanese Ministry of Education, Culture, Sports,
Science and Technology.

Project Title (formal):
A multifaceted approach toward understanding the limitations of computation
Short Title: Exploring the Limits of Computation (ELC)

Project Term: 2012.7 - 2017.3

Researchers have proposed various techniques for investigating the
limits of computation, many of which have been sharpened in depth
during the last two decades. We may soon be entering the stage of
expecting some big breakthrough results toward understanding the
limits of computation.

In this project, we investigate these techniques and relationships
among them with the goal of finding the next steps toward a big
breakthrough. We propose the following three lines of research, each
of which will be conducted by three core research groups (i.e., nine
core research groups altogether).

A. Team for pushing the current frontier of research on the limits of
computation.

B. Team for investigating the limits of computation by using various
algorithmic/optimization techniques (even by using supercomputers).

C. Team for introducing new approaches to and interpretations of the
existing techniques for investigating the limits of computation.

We also create a research center (CELC) in Tokyo for investigating
computational complexity theory by stimulating worldwide
collaborations among researchers based on our core research groups,
hosting short/long term visitors and postdoctoral researchers, and
organizing various meetings and workshops. We welcome researchers
working on subjects related to computational complexity theory to join
us for various occasions.

Project webpage (currently under construction)
http://www.al.ics.saitama-u.ac.jp/elc/en/


％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************