Context

IRIF (CNRS and Université de Paris), Paris, France, is seeking strong candidates for master internships in all areas of Foundations of Computer Science.

IRIF (Institute for Research in Foundations of Computer Science) is a joint laboratory of the CNRS (French National Center for Scientific Research) and Université de Paris created in 2016 as the merger of the previous laboratories LIAFA and PPS. Currently, it hosts about 90 permanent faculty members, 40 non-permanent full-time researchers, and 50 Ph.D. students.

The research conducted at IRIF is based on the study and understanding of the foundations of all areas of computer science. Such research work relies on mathematical concepts developed and studied within it, but it also contributes directly to mathematics. Typical areas include but are not limited to: algorithms, their design and analysis, automata theory and applications, combinatorics, complex systems, complexity, computational formalisms, distributed computation, foundations of programming languages, interactive proof assistants, graph theory and its algorithms, logic, networks, quantum computing, software development, systems modeling and verification. For further information about IRIF please see our presentation of IRIF.


Description of master internships at IRIF

Master internships last a few months, and maximum six months, usually from February-March to August-September. Master internships at IRIF are research internships and can be pursued in the context of validating a research master program, such as the LMFI or the MPRI.

Master internships at IRIF are remunerated with a “gratification” of €3.90/hour.


How to apply

A student interested in doing a master internship at IRIF can contact an IRIF member. It is advised to contact IRIF as soon as possible, preferably several months before the expected start of the internship.

Ideally, the contact should be the researcher you would like to work with. It can also be the head of the thematic group or head of the pole corresponding to your scientific interests (see the presentation of IRIF). Please avoid multiplying the contacts (alternatively, contact all concerned persons with a single e-mail so as they are aware of this).

The candidate should join a CV, and is advised to give as much information as possible (such as transcripts of her/his marks for the bachelor and master program). If selected, the candidate will have to establish a three-party internship convention between their university, themself, and Université de Paris.


Specific Openings

Below is a list of specific openings for master internships at IRIF. The list can be updated regularly.
To add an opening, please contact couteau@irif.fr.

Fast Secure Computation Meets Linear-Time Encodable Codes

A master internship is available in the Algorithms and Complexity group, on a topic related to cryptography, secure computation, and coding theory. The project deals with the construction of new linear-time encodable codes to be used in cryptographic protocols for secure computation. The internship will be supervised by Geoffroy Couteau (CNRS research scientist, couteau@irif.fr). For more information, please refer to the internship description, or send a mail to Geoffroy Couteau. This master internship might be continued as a PhD.

Distributed Recoloring with Extra Colors

A master internship is available in the Distributed Computing group, on a topic related to graph recoloring. The recoloring problem is as follows: we are provided a graph and two colorings alpha and beta. A step corresponds to changing the color of a node such that the new coloring is still proper. The question is now to figure out if there exists a sequence of steps to go from alpha to beta, and if so, how short the sequence can be. For distributed recoloring, the goal is to parallelize the steps, and decentralize the computation of the sequence. We now accept that an independent set of nodes gets updated at each step, instead of just one. We also work on a distributed model (the LOCAL model) where nodes need to look at its neighborhood at some distance to produce its own sequence of updates. The question becomes “how much of your neighborhood do you need to know about to be able to produce a parallel sequence of recoloring steps?” In the general settings, the problem is too hard to be solved. In some configurations, the addition of extra colors is necessary to be able to have a solution. In DISC 2018, we published results on several settings (for example, trees and grids with one extra color). This paper brings a lot of open questions. The goal of this internship would be to work on the distributed recoloring for some settings. One of the global goal would be to understand the added value of extra colors in some settings (making the problem solvable, or reducing the need of communications to find a solution). For more information, contact Mikaël Rabie rabie@irif.fr.

A Principled Investigation of the Lottery Ticket Hypothesisfor Deep Neural Networks

A master internship is available in the Algorithms and Complexity group, on a topic related to optimization and deep learning. The project consists of both theoretical and experimental work, and involves designing and testing new algorithms for sparsifying deep neural networks.

For more information, please refer to the internship description or e-mail Adrian Vladu adrian.vladu@irif.fr.

Improved Algorithms for Combinatorial Discrepancy

A master internship is available in the Algorithms and Complexity group, on a topic related to convex geometry and optimization. The project consists of desinging new and improved algorithms for problems involving combinatorial discrepancy.

For more information, please refer to the internship description or e-mail Adrian Vladu adrian.vladu@irif.fr.

Implementing differentiable programming out of linear logic

A master internship is available in the preuves, programmes et systèmes pole, on a topic related to differentiable programming, linear logic and deep learning. The project deals with the implementation of a differentiable programming framework in a pure functional programming style. The internship will be supervised by Michele Pagani (pagani@irif.fr). For more information, please refer to the internship description, or send a mail to Michele Pagani. This master internship might be continued as a PhD.

Information per time unit in timed systems

This internship is available in ASV (Automata, structure and verification) pole, is related to two starting research projects and can be continued in a PhD thesis. It concerns measuring information content and transmitting cyber-physical data. More details and contacts here.

Timed distances

This internship is available in ASV (Automata, structure and verification) pole, is related to two starting research projects and can be continued in a PhD thesis. It concerns the approximated verification of cyber-physical systems and its geometrical foundation. More details and contacts here.

Learning hybrid automata

This internship is available in ASV (Automata, structure and verification) pole, is related to a starting Franco-Japanese research projects and can be continued in a PhD thesis. Its aim is to find new approaches to machine learning of cyber-physical systems. More details and contacts here.

Internship openings in the theory and algorithmics of graphs group (multiple openings)

We welcome master students to do their stage on almost any area of graph theory. If interested, then write to reza@irif.fr for a meeting and discussion after which we may find a suitable supervisor.

For particular subject of focus in the theory and algorithmics of graphs group see: https://www.irif.fr/~hosigra and https://distancia.lis-lab.fr