[Elsnet-list] LICS Newsletter 101
Kreutzer + Schweikardt
lics at informatik.hu-berlin.de
Fri Nov 4 18:20:00 CET 2005
November 04, 2005
* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
can be found at
* To unsubscribe, send an email with "unsubscribe" in the
subject line to lics at informatik.hu-berlin.de
TABLE OF CONTENTS
* CONFERENCES AND WORKSHOPS
CSL 2006 - Call for Workshop Proposals
NL-KR Special Track at FLAIRS 2006 - Call for Papers
ALGSTOCH 2006 - Call for Papers
CiE 2006 - Call for Papers
TERMGRAPH 2006 - Call for Papers
PSI 2006 - Call for Papers
CAV 2006 - Call for Papers
ESSLLI 2006 STUDENT SESSION - Call for Papers
Ackermann Award 2006 - Call for nominations
Logical Methods in Computer Science (LMCS)
Electronic Notes In Theoretical Computer Science (ENTCS)
Maitre de Conferences Position, University of Savoie, Chambery, France
COMPUTER SCIENCE LOGIC (CSL 2006)
25-29 September, 2006
Call For Workshop Proposals
* Computer Science Logic (CSL) is the annual conference series of the
European Association for Computer Science Logic (EACSL).
* Workshops affiliated to CSL'06 will be held before and after the
main conference, on September 23 and 24, and on September 30 and
October 1, 2006.
* Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic to computer science.
* Proposals should include:
- A short scientific summary and justification of the proposed topic.
- Proposed format and agenda.
- Proposed duration.
- Procedures for selecting participants and papers.
- Expected number of participants.
- Potential invited speakers.
- Plans for dissemination (e.g. proceedings, journal special issue).
* Proposals will be evaluated by the CSL'06 Workshop Committee on the
basis of their assessed benefit for prospective participants of
* Workshop Committee: Matthias Baaz (Vienna), Damian Niwinski (Warsaw)
and Sandor Vagvolgyi (Szeged, chair).
* Proposals and/or enquiries should be submitted by electronic mail in
ASCII, PDF or postscript format to:
Sandor Vagvolgyi (CSL'06 Workshop Chair)
Email: vagvolgy at inf.u-szeged.hu
* Important dates:
- Submission of workshop proposals: November 15, 2005
- Acceptance decisions: December 1, 2005
* For more information refer to: http://www.inf.u-szeged.hu/~csl06/
NATURAL LANGUAGE AND KNOWLEDGE REPRESENTATION (NL-KR) SPECIAL TRACK AT
Holiday Inn Melbourne Oceanfront, Melbourne Beach, FLORIDA, USA
11-12-13 May 2006
Second call for papers
* Special track web page: http://users.ox.ac.uk/~lady0641/Flairs06_NL_KR
Main conference web page: http://www.indiana.edu/~flairs06
* NL-KR track topics: For this track, we will invite submissions
including, but not limited to:
- A novel NL-like KR or building on an existing one
- Reasoning systems that benefit from properties of NL to reason with NL
- Semantic representation used as a KR:
compromise between expressivity and efficiency?
- More Expressive KR for NL understanding (Any compromise?)
- Any work exploring how existing representations fall short of
addressing some problems involved in modelling, manipulating or
reasoning (whether reasoning as used to get an interpretation for
a certain utterance, exchange of utterances or what utterances
follow from other utterances) with NL documents
- Representations that show how classical logics are not as efficient,
transparent, expressive or where a one-step application of an
inference rule require more (complex) steps in a classical
environment and vice-versa; i.e. how classical logics are more
- Building a reasoning test collection for natural language
understanding systems: any kind of reasoning (deductive, abductive,
etc); for a deductive test suite see for e.g. deliverable 16 of
the FraCas project (http://www.cogsci.ed.ac.uk/~fracas/). Also,
look at textual entailment challenges 1 and 2
- Comparative results (on a common test suite or a common task) of
different representations or systems that reason with NL (again any
kind of reasoning). The comparison could be either for
efficiency, transparency or expressivity
- Knowledge acquisition systems or techniques that benefit from
properties of NL to acquire knowledge already 'coded' in NL
- Automated Reasoning, Theorem Proving and KR communities views on all this
* NL_KR Track Program Committee:
James ALLEN, University of Rochester, USA; Patrick BLACKBURN, Institut
National de Recherche en Informatique, France; Johan BOS, University
of Edinburgh, UK; Richard CROUCH, Palo Alto Research Centre, USA
Maarten DE RIJKE, University of Amsterdam, The Netherlands; Anette FRANK,
DFKI, Germany; Fernando GOMEZ, University of Central Florida, USA
Sanda HARABAGIU, University of Texas at Dallas, USA; John HARRISON,
Intel, USA; Jerry HOBBS, Information Sciences Institute, USA
Chung Hee HWANG, Raytheon Co., USA; Michael KOHLHASE, International
University Bremen, Germany; Shalom LAPPIN, King's College, UK
Carsten LUTZ, Dresden University of Technology, Germany; Dan MOLDOVAN,
University of Texas at Dallas, USA; Jeff PELLETIER, Simon Fraser
University, Canada; Stephen PULMAN, University of Oxford, UK
Lenhart SCHUBERT, University of Rochester, USA; John SOWA, VivoMind
Intelligence, Inc., USA; Jana SUKKARIEH, University of Oxford, UK (Chair)
Geoff SUTCLIFFE, Miami University, USA; Timothy WILLIAMSON, University
of Oxford, UK
* Details about submission can be found on:
Selected papers will be considered for publication in a special
journal issue of "The journal of Logic and Computation" in the
2nd half of 2006.
* Important dates:
- Submission of papers: 21 November, 2005
- Notification of acceptance: 20 January, 2006
- Final version of the paper is due: 13 February, 2006
- Main Conference: 11-13 May 2006
- Track: max 1 day during the main conference
* Those interested in running a demo please contact
Jana Sukkarieh <J.Sukkarieh.94 at cantab.net> or
Simon Dobnik <Simon.Dobnik at clg.ox.ac.uk>.
ALGEBRAIC ASPECTS OF STOCHASTIC SYSTEMS (ALGSTOCH)
Co-located at ETAPS 2006, Vienna, March 25, 2006
Call For Papers
* Motivation: As stochastic systems become more important in such
diverse areas as model checking, concurrency theory, testing,
control theory etc., it becomes increasingly important and
interesting to study the (co-) algebraic properties of these
systems, properties that center on notions like bisimulations,
congruences, simplicity; the recent incorporation of continuous time
systems is particularly exciting. The purpose of this workshop is
to study stochastic and related systems from an algebraic point of
view, and to relate them to applications. Papers are requested in
the following areas: discrete and continuous time stochastic systems
structural, e.g. categorial aspects of stochastic systems
applications to logic, and model checking applications to the design
of programming systems, relations to the theory of coalgebras. The
list is not exhaustive.
* Proceedings: The proceedings will be published in the ENTCS series;
extended versions of selected papers may be published in a special
issue of Fundamenta Informaticae following the regular referee
procedure. The PC encourages the submission of work in progress.
* Important dates:
Submission: November 30, 2005, Notification: January 10, 2006
Final version: February 10, 2006, Workshop: March 25, 2006
* PC: Ch. Baier, U Bonn; E.-E. Doberkat (Chair), U Dortmund;
K. Keimel, TH Darmstadt; P. Panangaden, McGill; F. van Breugel, York
U.; I. Viglizzo, Indiana U
Ernst-Erich Doberkat, University of Dortmund, doberkat at acm.org.
The workshop page, where instructions to submit a paper can be found,
COMPUTABILITY IN EUROPE 2006 (CiE 2006): NEW COMPUTATIONAL PARADIGMS
Swansea, UK, June 30 - July 5, 2006
Call for Papers
* CiE 2006 is the second of a new conference series on Computability
Theory and related topics which started in Amsterdam in 2005.
CiE 2006 will focus on (but not be limited to) logical approaches to
computational barriers: practical and feasible barriers, e.g., centred
around the P vs. NP problem; computable barriers connected to models
of computers and programming languages; hypercomputable barriers
related to physical systems. CiE 2006 will have 3-hour tutorials by
Sam Buss and Julia Kempe (titles tbd) as well as invited talks by
Jan Bergstra, Luca Cardelli, Jan Krajicek, Elvira Mayordomo Camara,
Istvan Nemeti, Helmut Schwichtenberg, and Andreas Weiermann. Further
invited speakers are to be announced. There will also be two-hour
special sessions on Proofs and Computation, Computable Analysis,
Challenges in Complexity, Foundations of Programming, Mathematical
Models of Computers and Hypercomputers, and a special session
"Goedel Centenary: His Legacy for Computability".
* The Programme Committee cordially invites all researchers (European
and non-European) in the area of Computability Theory to submit their
papers (in PDF-format, at most 10 pages) for presentation at CiE 2006.
We particularly invite papers building bridges between different parts
of the research community. The proceedings are intended to be
published in the Springer LNCS series.
* Submission Deadline: December 15th, 2005.
* Programme committee: Samson Abramsky (Oxford), Klaus Ambos-Spies
(Heidelberg), Arnold Beckmann (Swansea, co-chair), Ulrich Berger
(Swansea), Olivier Bournez (Nancy), Barry Cooper (Leeds),
Laura Crosilla (Firenze), Costas Dimitracopoulos (Athens),
Abbas Edalat (London), Fernando Ferreira (Lisbon), Ricard Gavalda
(Barcelona), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam),
Yuri Matiyasevich (St.Petersburg), Dag Normann (Oslo), Giovanni Sambin
(Padova), Uwe Schoening (Ulm), Andrea Sorbi (Siena), Ivan Soskov
(Sofia), Leen Torenvliet (Amsterdam), John Tucker (Swansea, co-chair),
Peter van Emde Boas (Amsterdam), Klaus Weihrauch (Hagen).
* Sponsors: BLC, KGS, WDA (further sponsors to be confirmed).
* For further information visit http://www.illc.uva.nl/CiE/ and
http://www.cs.swansea.ac.uk/cie06/, or email the organisers:
cie06 at swansea.ac.uk.
THIRD INTERNATIONAL WORKSHOP ON TERM GRAPH REWRITING (TERMGRAPH 2006)
1 April 2006, Vienna, Austria
Co-located with ETAPS'06
Call for Papers
* Term graph rewriting is concerned with the representation of
functional expressions as graphs and the evaluation of these
expressions by rule-based graph transformation. Topics of interest
range from theoretical questions to practical implementation
issues. It includes such different lines as the modelling of (finite
or infinitary) first-order term rewriting by (acyclic or cyclic)
graph rewriting, interaction nets and sharing graphs for
Levy-optimal reduction in the lambda calculus, rewrite calculi on
cyclic higher-order term graphs for the semantics and analysis of
functional programs, graph reduction implementations of functional
programming languages, and automated reasoning and symbolic
computation systems working on shared structures.
* Deadline for submission: 7 January, 2006
* For more information see Web page
SIXTH INTERNATIONAL ANDREI ERSHOV MEMORIAL CONFERENCE
PERSPECTIVES OF SYSTEM INFORMATICS (PSI 2006)
27-30 June 2006, Novosibirsk, Akademgorodok, Russia
Preliminary Call for Papers
* Aims and scope:
The conference is held to honor the 75th anniversary of academician
Andrei Ershov (1931-1988) and his outstanding contributions towards
advancing informatics. The aim of the conference is to provide a
forum for the presentation and in-depth discussion of advanced research
directions in computer science. For a developing science, it is
important to work out consolidating ideas, concepts and models.
Movement in this direction is another aim of the conference. Improvement
of the contacts and exchange of ideas between researchers from the East
and West are further goals.
* Conference topics include:
- Foundations of Program and System Development and Analysis:
specification, validation, and verification techniques; program
analysis, transformation and synthesis; semantics, logic and
formal models of programs; partial evaluation, mixed computation,
abstract interpretation; compiler construction; theorem proving
and model checking; concurrency theory; modeling and analysis of
real-time and hybrid systems; computer models and algorithms for
- Programming Methodology and Software Engineering:
object-oriented, aspect-oriented, component-based and generic
programming; programming by contract; program and system construction
for parallel and distributed computing; constraint programming;
multi-agent technology; system re-engineering and reuse; integrated
programming environments; software architectures; software
development and testing; model-driven system/software development;
agile software development; tools for software engineering;
program understanding and visualization.
- Information Technologies:
data models; database and information systems; knowledge-based
systems and knowledge engineering; ontologies and semantic Web;
digital libraries,collections and archives, Web publishing;
peer-to-peer data management.
* Program Committee: Scott W. Ambler, Ambysoft Inc., Toronto;
Egidio Astesiano, Univ. Genova; Janis Barzdins, Univ. Latvia, Riga;
Frederic Benhamou, Univ. Nantes; Stefan Brass, Univ. Halle;
Ed Brinksma, Univ. Twente; Kim Bruce, Pomona College, California;
Mikhail Bulyonkov, IIS SB RAS, Novosibirsk; Albertas Caplinskas, IMI,
Vilnius; Sung-Deok Cha, KAIST, Taejon; Gabriel Ciobanu, Inst. Comp.
Sc. RA, Iasi; Paul C. Clements, Carnegie-Mellon Univ.; Miklos Csuroes,
Univ. Montreal; Serge Demeyer, Univ. of Antwerp; Alexander Dikovsky,
Univ. Nantes; Javier Esparza, Univ. Stuttgart; Jean Claude Fernandez,
Univ. J. Fourier, Grenoble; Chris George, UNU/ IIST, Macau; Ivan Golosov,
Intel, Novosibirsk; Jan Friso Groote, Eindhoven Univ. of Technology;
Alan Hartman, IBM Haifa Research Lab.; Victor Ivannikov, IPS RAS,
Moscow; Victor Kasyanov, IIS SB RAS, Novosibirsk; Joost-Pieter Katoen,
RWTH Aachen Univ.; Alexander Kleschev, IACP RAS, Vladivostok;
Nikolay Kolchanov, ICiG, Novosibirsk; Gregory Kucherov, INRIA/LORIA,
Nancy; Johan Lilius, Abo Akademi Iniv. Turku; Dominique Mery, Univ.
Henri Poincare, Nancy; Torben Mogensen, Univ. Copenhagen; Bernhard
Moeller, Univ. Augsburg; Hanspeter Moessenboeck, JK Univ. Linz;
Peter Mosses, Univ. Wales, Swansea; Ron Morrison, St Andrews Univ.;
Peter Mueller, ETH Zurich; Fedor Murzin, IIS SB RAS, Novosibirsk;
Valery Nepomniaschy, IIS SB RAS; Nikolaj Nikitchenko, Nat. Univ. Kiev;
Jose R. Parama, Univ. A Coruna; Francesco Parisi-Presicce, GM Univ.,
Virginia; Wojciech Penczek, Inst. Comp. Sci., Warsaw; Jaan Penjam,
Tallinn Tech. Univ.; Peter Pepper, Tech. Univ. Berlin; Alexander
Petrenko, IPS RAS, Moscow; Jaroslav Pokorny, Charles U., Prague;
Wolfgang Reisig, Tech. Univ. Berlin; Viktor Sabelfeld, Univ. Karlsruhe;
Timos Sellis, Nation. Tech. Univ. Athens; Alexander Semenov, Intel,
Novosibirsk; Klaus-Dieter Schewe, Massey Univ; David Schmidt, Kansas
State Univ.; Sibylle Schupp, Chalmers Univ. Tech.; Nikolay Shilov,
IIS SB RAS, Novosibirsk; Alexander Tomilin, IPS RAS, Moscow; Enn Tyugu,
Inst. Cybernetics, Tallinn; Alexander L. Wolf, Univ. Colorado at Boulder;
Tatyana Yakhno, Dokuz Eylul Univ., Izmir; Wang Yi, Uppsala Univ.
* Conference Proceedings: A book of extended abstracts of invited and
accepted talks will be available at the conference. The full versions
of the papers presented at the conference will be published by
Springer-Verlag in the LNCS series after the conference.
* Submission instructions can be found on the conference web site
* Important dates:
January 23, 2006: submission deadline of extended abstracts
April 7, 2006: notification of acceptance
June27-30, 2006: the conference dates
September 1, 2006: final papers due
COMPUTER AIDED VERIFICATION (CAV 2006)
18th International Conference
Call for Papers
Seattle, Washington, August 16-21, 2006
* Aims and Scope: CAV'06 is the 18th in a series dedicated to the
advancement of the theory and practice of computer-assisted formal
analysis methods for hardware and software systems. This year, CAV
is part of the 4th International Federated Logic Conference (FLoC
2006), which includes CAV and five other conferences/symposia.
* Topics of interest include: algorithms and tools for verifying
models and implementations; hardware verification techniques;
program analysis and software verification; modeling and
specification formalisms; deductive, compositional, and abstraction
techniques for verification; testing and runtime analysis based on
verification technology; applications and case studies; verification
in industrial practice.
* Special Symposium: The first day of CAV is traditionally a tutorial
day. This year, the tutorial will be replaced with a special
symposium entitled "25 Years of Model Checking".
* Affiliated workshops:
- BMC'06: 4th International Workshop on Bounded Model Checking
- TV'06: Multithreading in Hardware and Software: Formal
Approaches to Design and Verification
- SMT-COMP'06: 2nd Satisfiability Modulo Theories tools competition
- ACL2'06: 6th International Workshop on the ACL2 Theorem Prover
and its Applications
- GDV'06: 3rd International Workshop on Games in Design and
- V&D'06: 1st International Workshop on Verification on Debugging
- Verified Software: Tools, Techniques, and Experiments
* Submission: There are two categories of submissions: regular papers
(not to exceed 13 pages) and tool presentations (not to exceed 4
pages). Information concerning the procedure for submissions will
be available on the conference home page:
* Submission Deadline: January 27, 2006 (firm)
* Program Committee: Thomas Ball (Microsoft) (Co-chair), Clark Barrett
(NYU), Karthik Bhargavan (Microsoft), Per Bjesse (Synopsys), Ahmed
Bouajjani (Univ. Paris 7), Randy Bryant (CMU), Rance Cleaveland
(Univ. Maryland), Werner Damm (Univ. Oldenberg), Ganesh
Gopalakrishnan (Univ. Utah), Steve German (IBM Research), Patrice
Godefroid (Bell Labs), Mike Gordon (Univ. Cambridge), Orna Grumberg
(Technion), Holger Hermanns (Saarland Univ.), Ranjit Jhala (UC San
Diego), Robert Jones (Intel) (Co-chair), Roope Kaivola (Intel), Ken
McMillan (Cadence), Tom Melham (Oxford Univ.), Corina Pasareanu
(NASA Ames), Amir Pnueli (NYU), Thomas Reps (Univ. Wisconsin),
Sanjit Seshia (UC Berkeley), Prasad Sistla (Univ. Illinois -
Chicago), Fabio Somenzi (Univ. Colorado).
ESSLLI 2006 STUDENT SESSION
July 31 - August 11, Malaga, Spain
1st Call for Papers
* We are pleased to announce the Student Session of the 18th European
Summer School in Logic, Language and Information (ESSLLI), which will
be held July 31 - August 11, in Malaga, Spain. We invite papers for oral
and poster presentation from the areas of Logic, Language and Computation.
* The aim of the Student Session is to provide students with the
opportunity to present their work in progress and get feedback from
senior researchers and fellow-students.
* The ESSLLI Student Session invites students at any level, undergraduates
as well as graduates, to submit a full paper, no longer than 7 pages
(including references). Papers should be submitted with clear indication
of the selected modality of presentation, i.e. oral or poster. Accepted
papers will be published in the Student Session Proceedings.
* Papers should describe original, unpublished work, complete or in
progress, that demonstrates insight, creativity and promise. Previously
published papers should not be submitted.
* The preferred format of submission is PDF. All submissions must be
accompanied by a plain text identification page, and sent to
katrenko at science.uva.nl.
* For more information about the Student Session, and for the technical
details concerning submission, please visit our website at
You may also contact one of the chairs:
Janneke Huitink, j.huitink at phil.ru.nl
Sophia Katrenko, katrenko at science.uva.nl
* Important dates:
Deadline for Submission: February 1st, 2006
Notification of authors: April 1st, 2006
Proceedings Deadline: May 1st, 2006
ESSLLI: July 31 - August 11, 2006
ACKERMANN AWARD 2006 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
Call for nominations
* The Ackermann Award will be presented to the recipients at the
annual conference of the EACSL (CSL'06).
* The jury is entitled to give more than one award per year.
* The first Ackermann Award was presented at CSL'05. The 2005 recipients
- Mikolaj Bojanczyk
- Konstantin Korovin
- Nathan Segerlind
* Eligible for the 2006 Ackermann Award are PhD dissertations in topics
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution
between 1.1.2004 and 31.12. 2005.
* The deadline for submission is 31.1.2006.
* Submission details are available at
* The award consists of
- a diploma,
- an invitation to present the thesis at the CSL conference,
- the publication of the abstract of the thesis and the laudation
in the CSL proceedings,
- travel support to attend the conference.
* The jury consists of seven members:
- The president of EACSL, J. Makowsky (Haifa);
- The vice-president of EACSL, D. Niwinski (Warsaw);
- One member of the LICS organizing committee, S. Abramnsky (Oxford);
- B. Courcelle (Bordeaux);
- E. Graedel (Aachen);
- M. Hyland (Cambridge);
- A. Razborov (Moscow and Princeton).
JOURNAL: LOGICAL METHODS IN COMPUTER SCIENCE (LMCS)
* Dear Colleague:
We are writing to inform you about the progress of the open-access,
online journal "Logical Methods in Computer Science," which has
recently benefited from a freshly designed web site, see:
* In the first year of its existence, the journal received 75
submissions: 21 were accepted and 22 declined (the rest are still in
the editorial process). The first issue is complete, and we
anticipate that will be three in all by the end of the calendar year.
Our eventual aim is to publish four issues per year. We also publish
Special Issues: to date, three are in progress, devoted to
selected papers from LICS 2004, CAV 2005 and LICS 2005.
* The average turn-around from submission to publication has been
7 months. This comprises a thorough refereeing and revision process:
every submission is refereed in the normal way by two or more
referees, who apply high standards of quality.
* We would encourage you to submit your best papers to Logical Methods
in Computer Science, and to encourage your colleagues to do so too.
There is a flier and a leaflet containing basic information about the
new journal on the homepage; we would appreciate your posting
and distributing them, or otherwise publicising the journal. We would
also appreciate any suggestions you may have on how we may improve the
* Yours Sincerely,
Dana S. Scott (editor-in-chief)
Gordon D. Plotkin and Moshe Y. Vardi (managing editors)
Jiri Adamek (executive editor)
JOURNAL: ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (ENTCS)
* Dear Colleagues,
One of the minor inconveniences that Hurricane Katrina caused has
been the temporary failure of the Tulane email servers, both
university-wide and within the math department. The latter hosted the
ENTCS Macro Home Page, so progress on publishing ENTCS volumes has
been hindered since the hurricane.
* I am happy to announce that the ENTCS Macro Home now has its own,
separate web host, which can be found at
Please point your browser at this page, where you will find
detailed instructions on how to prepare proposals for publishing
material in ENTCS, as well as instructions about how to prepare
files both for preliminary, hard copy versions of proceedings for
limited distribution at meetings, as well as how to prepare the
final versions of papers for publication online at ScienceDirect.
* While ENTCS production has been hampered over the past month or so,
it has now been restarted, and publication of ENTCS issues and
volumes is now proceeding as usual, with minimal delays.
* As usual, if you have any problems or questions about the ENTCS
macros, or about ENTCS in general, please let me know.
* Best regards,
Mike Mislove, Managing Editor ENTCS, michael.mislove at gmail.com
VACANCY: MAITRE DE CONFERENCES POSITION,
UNIVERSITY OF SAVOIE, CHAMBERY, FRANCE
* A "Maitre de ConfÃ©rences" position will be available for the Logic group
of the maths department of the University of Savoie in Chambery.
This position is destinated to reinforce our group.
* The themes of research we are looking for are thus
- either the ones that have always be present in Chambery such as
*proof theory* and *lambda caculus*
- or the new ones corresponding to discrete mathematics such as the
combinatorics of, for example, words or the discrete plane, the discrete
geometry and the general theory of coding.
* The teaching assigments will be those of a maitre de confÃ©rences with
lessons in "mathematical tools for computer science". For example, the
person we are looking for will be in charge of courses as "data bases"
or "Maths for computer science". The courses should be given in French.
* Two conditions are necessary to get this position
- Be accepted on the so called "liste de qualification aux fonctions de
Maitre de ConfÃ©rences"
- Speak French reasonnably fluently.
* This position is not yet official but, since it should appear officially
only around February, we would like to have contact with possible
candidates much before.
* If you are interested by this position, please contact
- either laurent.vuillon at univ-savoie.fr
- or rene.david at univ-savoie.fr
* For more informations on our laboratory visit www.lama.univ-savoie.fr
For more informations on our university visit www.univ-savoie.fr
Rene David and Laurent Vuillon
More information about the Elsnet-list