4 faculty positions in Computer Science (section 27) are opened at University Paris-Sud 11 with research assignment to the Laboratory of Research in Computer Science (LRI, Univ. Paris-Sud and CNRS,
http://www.lri.fr): 2 assistant professors (MCF) and 2 full professors (PR).
Only the position MCF 1234 has a predefined research profile.
The scientific recruiting policy of LRI is to favor mobility and to attract the best faculty members.
Interested candidates from other universities or institutes, in France or in foreign countries, are strongly encouraged to get in touch as soon as possible in order to prepare their application and
Administrative information (in French):
http://www.u-psud.fr/fr/recrutement/enseignants_chercheurs.html
Calendar:
Publication: mid-February
Application: February 24 to March 25
Applications examination / oral examination and ranking:
- MCF 1234 : May 6 / May 18
- MCF 0600 : April 29 / May 13
- PR 2081 : May 2 / May 9
- PR 0742 : April 28 / May 13
Definite decision announcement: June 7
Candidates wishes: June 16
Final result: June 20
Position starting time: September
1. 27 MCF 1234
Teaching:
The candidate is expected to teach undergraduate and graduate courses in the Computer Science departments of the Faculty of Sciences and of Polytech, including core and specialty areas based on the candidate's expertise (advanced database courses).
This position involves teaching in French and proficiency in this language is necessary at the time the position is taken (September 2011).
Research:
We will consider candidates in computer science working in the Database field. We expect the candidate to develop a research program including: XML data management, distributed querying and updating, optimization algorithms, cloud computing for massive data management, etc.
The candidate is also expected to participate to the developement of prototyping XML data management tools and benchmarks.
The candidate will join the Data Bases research group of LRI, common with the Leo team of INRIA Saclay–Île-de-France.
2. 27 MCF 0600
Teaching:
The candidate is expected to teach undergraduate and graduate courses in the Computer Science departments of the Faculty of Sciences and of Polytech, including core and specialty areas based on the candidate's expertise.
This position involves teaching in French and proficiency in this language is necessary at the time the position is taken (September 2011).
Research:
LRI is interested in any application allowing the reinforcement of the research topics of its teams: Algorithmics and combinatorics, Machine Learning and optimization, Architecture and compilation, Bioinformatics, Artificial Intelligence, Human-Machine Interaction, Parallelism, Proof of programs, Networking, Formal testing, Graph theory and combinatorial optimization.
The laboratory encourages particularly candidates in the field of Human-Machine Interaction (advanced interaction, collaborative interaction, participative design, software architecture of interactive systems) for integrating the In Situ research group, common with INRIA Saclay–Île-de-France, and in the field of fundamental Computer Science (analysis and complexity of algorithms, approximation, inapproximability, algorithmic game theory, random structures and algorithms, combinatorics, graph algorithms) for integrating the Algorithmics and Complexity research group.
3. 27 PR 2081
Teaching:
The candidate is expected to teach undergraduate and graduate courses in the Computer Science departments of the Faculty of Sciences and of Polytech, including core and specialty areas based on the candidate's expertise.
The candidate will participate to the Faculty of Sciences Computer Science department management.
This position involves teaching in French and proficiency in this language is necessary at the time the position is taken (September 2011).
Research:
LRI is interested in any application allowing the reinforcement of the research topics of its teams: Algorithmics and combinatorics, Machine Learning and optimization, Architecture and compilation, Data Bases, Bioinformatics, Artificial Intelligence, Human-Machine Interaction, Parallelism, Proof of programs, Networking, Formal testing, Graph theory and combinatorial optimization.
The laboratory wishes particularly to recruit in the field of Networking (mobile networks and large scale sensors, cooperative communication and Internet of the future) for integrating the Networking research group, common with INRIA Saclay–Île-de-France, and in the field of fundamental Computer Science (analysis and complexity of algorithms, approximation, inapproximability, algorithmic game theory, random structures and algorithms, combinatorics, graph algorithms - the list is not exhaustive).
The candidate recruited will be bound to invest himself in the large scale project "KIC ICT Labs" of the European Institute of Technology, in which the University is strongly involved.
4. 27 PR 0742
Teaching:
The candidate is expected to teach undergraduate and graduate courses in the Computer Science department of Polytech Paris-Sud, including core and specialty areas based on the candidate's expertise.
He could also be involved in other departments of Polytech or in the Computer Science department of the Faculty of Sciences.
The candidate will participate to the Polytech Computer Science department management.
This position involves teaching in French and proficiency in this language is necessary at the time the position is taken (September 2011).
Research:
LRI is interested in any application allowing the reinforcement of the research topics of its teams: Algorithmics and combinatorics, Machine Learning and optimization, Architecture and compilation, Data Bases, Bioinformatics, Artificial Intelligence, Human-Machine Interaction, Parallelism, Proof of programs, Networking, Formal testing, Graph theory and combinatorial optimization.
The laboratory wishes particularly to recruit in the field of Networking (mobile networks and large scale sensors, cooperative communication and Internet of the future) for integrating the Networking research group, common with INRIA Saclay–Île-de-France, and in the field of fundamental Computer Science (analysis and complexity of algorithms, approximation, inapproximability, algorithmic game theory, random structures and algorithms, combinatorics, graph algorithms - the list is not exhaustive).
