ANR FLITTLA project: Research Engineer position

• Location: Montpellier, France
• Institution: LIRMM
• Duration: 12 months
• Main contact: Andrei Romashchenko, andrei.romashchenko@lirmm.fr

The ANR project FLITTLA invites applications for a Research Engineer to work in the field of information theory and its interaction with computer science at the LIRMM (Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier), France.

Topic

The research will be done in accordance with the research topics of the project FLITTLA (Fundamental Laws of Information Theory through the Lens of Applications).

Context: The project studies the interactions between classical and algorithmic information theories and their applications. The objective of this project is the study of fundamental quantities of algorithmic information theory, such as mutual information and its generalizations. In general, we are interested in the universal constraints for these quantities. We focus on laws of information theory that can be applied to other areas of theoretical computer science, including problems of communication complexity and secret key agreement.

Several relevant publications:

• E. Gürpinar and A. Romashchenko. How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. arXiv:1901.07476
• E. Gürpinar and A. Romashchenko. Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. arXiv.org:2004.13411
• A. Romashchenko and M. Zimand. An operational characterization of mutual information in algorithmic information theory. arXiv:1710.05984
• B. Bauwens, P. Gacs, A. Romashchenko, A Shen. Inequalities for space-bounded Kolmogorov complexity. arXiv:2010.10221
• O. Farras, T. Kaced, S. Martin, C. Padro. Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IEEE Trans. Inf. Theory 66(11): 7088-7100 (2020)
• Laszlo Csirmaz. MINimal Information Theoretical Inequality Prover
• Cheuk Ting LI. Python Symbolic Information Theoretic Inequality Prover
• Raymond W. Yeung and Ying-On Yan. Information Theoretic Inequality Prover

We encourage the candidate to visit the page of the online seminar on algorithmic aspects of information theory.

Location and team

This position is attached to LIRMM, CNRS. The project supervisor is Andrei Romashchenko. Other potential collaborators within the project are Alexander Shen and other project members present at the LIRMM and potentially at the LaBRI and the IRIF.

Starting date and duration

The duration of the contract is 12 months.

Application

The applications should be submitted at emploi.cnrs.fr. The required documents are

• Cover letter with a short description of qualifications and research/programming experience
• CV with the list of publications; you may mention one or two persons who could be contacted for reference letters
• Manuscript of the doctoral thesis (if available)

Feel free to contact andrei.romashchenko@lirmm.fr for further information information.