|
Postdoctoral Position in Algorithmic Engineering |
 |
 |
 |
|
Written by Administrator
|
|
Thursday, 19 May 2011 19:40 |
Postdoctoral Position in Algorithmic Engineering at University of Warsaw
A postdoctoral position in the area of algorithmic engineering is available in the Department of Mathematics, Informatics and Mechanics
at University of Warsaw under the guidance of Prof. Piotr Sankowski. Although algorithmic engineering is the main area of interest, all
candidates with strong qualifications in algorithmic research are encouraged to apply and will be carefully considered.
Applicants should have a PhD degree or being close to completing it. Knowledge of Polish language is not necessary, but a good knowledge of English is required. Salary is competitive at the European level. The position is supported by the PAAl project (ERC Starting Grant 259515 :
Practical Approximation Algorithms).
The goal of PAAl project is the development and study of practical approximation algorithms. We will base our study on theoretical models
that can describe requirements for algorithms that make them practically efficient. We plan to develop an efficient and useful programming library of approximation algorithms. The project is executed in cooperation with Prof. Stefano Leonardi from Sapienza University of Rome. A more detailed information about the project can be found at http://paal.mimuw.edu.pl.
Successful candidates can start after July 2011 (negotiable). Funding is available for up to 4 years and different durations are possible.
Travel support is available for all research members and no teaching duty is required.
Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent, by email if possible, by June 30, 2011 to:
Prof. Piotr Sankowski
Institute of Informatics
University of Warsaw
ul. Banacha 2
02-097 Warsaw
Poland
Email:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
|
Written by Administrator
|
|
Friday, 05 November 2010 19:54 |
PAAl Is starting!!!
Our ERC StG project on Practical Approximation Algorithm has started on the 1st of November.
The project is realized both at University of Warsaw and "Sapienza" University of Rome. In both sites we have post-doc and Ph.D. positions open. |
|
Last Updated on Tuesday, 09 November 2010 09:23 |
|
Written by Administrator
|
|
Friday, 05 November 2010 19:54 |
PAAl: Practical Approximation Algorithms
The goal of this proposal is the development and study of practical approximation algorithms. We will base our study on theoretical models that can describe requirements for algorithms that make them practically efficient. We plan to develop an efficient and useful programming library of approximation algorithms. Our research on approximation algorithms will be concentrated on three main topics:
- multi-problem optimization, when the solution has to be composed out of different problems that need to interact,
- efficient approximation algorithms captured by dynamic and preprocessing models,
- interplay between regular and random structure of network that could allow construction of good approximation algorithms.
The above concepts try to capture the notion of effective algorithms. It has to be underlined that they were not studied before. The practical importance of these problems will be verified by the accompanying work on generic programming concepts for approximation algorithms. These concepts will form the basis of universal library that will include Web algorithms and algorithms for physical applications. |
|
Last Updated on Tuesday, 09 November 2010 11:11 |
|
|
Written by Administrator
|
|
Tuesday, 09 November 2010 09:24 |
PAAl: Call for post-docs
The PAAl project (ERC Starting Grant 259515 : Practical Approximation Algorithms) has open positions for 2 post-doctoral researchers.
The goal of PAAl project is the development and study of practical approximation algorithms. We will base our study on theoretical
models that can describe requirements for algorithms that make them practically efficient. We plan to develop an efficient and useful
programming library of approximation algorithms. A more detailed information about the project can be found at http://paal.mimuw.edu.pl.
The positions are available at University of Warsaw (project host) and ''Sapienza'' University of Rome (partner). Applications are sought from
candidates with expertise in approximation algorithms and algorithmic aspects of networks. For Warsaw we seek candidates with special emphasis
on algorithmic and software engineering. On the other hand, for Rome experience in approximation algorithms for network problems is considered
an advantage.
Although these are the main areas of interest, ALL candidates with strong qualifications in algorithmic research are encouraged to
apply and will be carefully considered.
Applicants should have a PhD degree or being close to completing it. Knowledge of Polish or Italian language is not necessary, but
good knowledge of English is required. Salary is competitive at the European level.
Successful candidates can start between December 2010 and April 2011 (negotiable). Funding is available for up to 4 years and different
durations are possible. Travel support is available for all research members and no teaching duty is required.
Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period
of stay) should be sent, by email if possible, by December 15, 2010 to both:
Piotr Sankowski
Institute of Informatics
University of Warsaw
ul. Banacha 2
02-097 Warsaw
Poland
Email:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
and
Stefano Leonardi
Dipartimento di Informatica e Sistemistica
"Sapienza" Universita' di Roma
Via Ariosto 25,
00185 Roma Italy
Email:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
Last Updated on Tuesday, 09 November 2010 09:45 |
|
|