Internships 2017/2018

Submit an internship offer

  1. Test
    Testing test
    Wiki test
  2. Formally Secure Compilation
    Catalin Hritcu, Inria Paris
    2.4, 2.36.1, 2.7.2, 2.30
  3. Service Problems within Highly Dynamic Distributed Systems
    Franck Petit and Swan Dubois, LIP6, UPMC Sorbonne Université, Paris
    Distributed algorithms on networks, Distributed algorithms on shared memory
  4. Cryptanalysis of Symmetric Primitives in the Post-Quantum World
    María Naya Plasencia - Inria Paris
    2.13.2, 2.34.2
  5. Reliable networks, partition discovering and binary trees
    Élie de Panafieu, Anne Bouillard, Fabien Mathieu, LINCS, 23 avenue d'Italie (Paris)
    2.29.1
  6. Modélisation de calcul quantique d'ordre supérieur
    Benoit Valiron et Michele Pagani - IRIF (Universite Paris 7)
  7. Étude de la sémantique de Isabelle/HOL
    Benoit Valiron et Burkhart Wolff - LRI, Univ. Paris Sud
  8. Compilation d'oracle pour calcul quantique
    Benoit Valiron - LRI - Univ. Paris Saclay
  9. Generating Counterexamples for Lean
    Jasmin Blanchette - Amsterdam
  10. Fairness in multi-stage decision making
    Patrick Loiseau (LIG, Grenoble)
  11. Development of adversarial classifiers using Bayesian games
    Patrick Loiseau (LIG, Grenoble)
  12. DASH: Data-Aware Scheduling at Higher scale
    Guillaume Aupy - Inria Bordeaux
    2.18.2, 2.11.1 (Lect 1-4), 2.24.1
  13. Verification of equivalence-based properties: the case of stateful protocols
    David Baelde & Stéphanie Delaune, ENS Cachan ou IRISA (Rennes)
  14. Verifiable Secret Sharing on the Red Belly Blockchain
    Vincent Gramoli
  15. Audit the transparency mechanisms provided by social media advertising platforms
    Oana Goga
  16. Build a platform for increasing the transparency of social media advertising
    Oana Goga (LIG, Grenoble)
  17. Assessing the trustworthiness of online identities
    Oana Goga (LIG, Grenoble)
  18. Characterization of NP or PSPACE with polynomial ODE Continuous time Analog machines and models of computation.
    Olivier Bournez, LIX, Ecole Polytechnique
  19. Randomness and Continuous Time Dynamical Systems. Kolmogorov Complexity and Analog Models of Computation
    Olivier Bournez, LIX, Ecole Polytechnique
  20. Turing Neural Computer, Differential Neural Computer, Neural Stack Machine, Neural Network Pushdown Automata etc. . .. Some recent models from Deep Learning from a Computability and Complexity Theory Perspective.
    Olivier Bournez, LIX, Ecole Polytechnique
  21. Vérification automatisée de structures de données réparties pour des processeurs multicœur
    Loïg Jezequel (Université de Nantes) et Corentin Travers (ENSEIRB-MATMECA, Bordeaux) - Le stage se déroulera au LS2N, à Nantes
  22. Influence and Diffusion-Aware Group Recommendation in Social Media
    Bogdan Cautis, Silviu Maniu (LRI -Univ. Paris-Sud)
  23. Type System for complexity analysis of Java programs.
    Emmanuel Hainry and Romain Péchoux
  24. Quantitative types for the atomic lambda-calculus
    Delia Kesner - Univ Paris-Diderot
  25. Automatic Theorem Proving in Coq
    Valentin Blot - Chantal Keller
    2.7.1, 2.7.2, 2.5.1
  26. Cryptanalyse de schémas multivariés
    Renaud Dubois, Olivier Bernard & Sylvain Lachartre - Thales Communications & Security
    2.13.1
  27. Amélioration d'un schéma de signature post-quantique
    Thomas Prest & Olivier Bernard - Thales Communications & Security
    2.12.1
  28. Private Set Intersection
    Ange Martinelli, Aurelien Dupin & Emeline Hufschmitt - Thales Communications & Security
    2.12.1 - 2.30
  29. SNACC (SyNchronous Abstract Contractual Components) design language
    Sebti Mouelhi - ECE Paris
  30. Leverage Data Patrimony
    Bendris Meriem - Dassault Systemes corporate research
  31. Categorical Design
    Cedric Adam - Dassault Système Corporate research
  32. Deep Interactive Object Selection
    Asma REJEBSFAR
  33. Graph Patterns for Data Science
    Philippe Castera - Dassault Systèmes Corporate research
  34. Hybrid Approaches for Recommendation on an Online Platform
    Lubbers niels
  35. Next Generation Design
    Louis Dupont de Dinechin - Dassault Systèmes Corporate research
  36. Exploring New Contact Modes for Motion Generation and Control of Humanoid Robots
    Stéphane CARON - LIRMM/JRL
    1-19
  37. Preuve formelle en calcul réseau
    Pierre Roux et Marc Boyer - ONERA, Toulouse
    2.7.1, 2.7.2
  38. Multiplayer games over graphs with imperfect monitoring
    Patricia Bouyer-Decitre (LSV, Cachan)
    2.20.1 (un peu 2.8.1)
  39. Refining Concurrency for Perfomance
    Petr Kuznetsov, Telecom ParisTech
    2.18.2, 2.3
  40. Native floats in Coq
    Erik Martin-Dorel (IRIT) & Pierre Roux (ONERA) @ Toulouse
    2.7.1, 2.7.2
  41. Encryption for Fine-Grained Access Control
    Michel Abdalla and Hoeteck Wee
    2.12.1, 2.30
  42. Algorithms for Expected-Time Reachability
    Laurent Doyen (LSV, ENS Cachan)
    1.24 - 2.15 - 2.20.1
  43. Graph and Automata Algorithms for Verification
    Laurent Doyen (LSV, ENS Cachan)
    2.8.1 - 1.24 - 2.15
  44. Randomized algorithms for max-cut in graphs
    Louis Esperet - G-SCOP - Grenoble
    2.11(S), 2.11.2, 2.18.2, 2.29.1
  45. Mixed size memory model for the x86 processor
    Luc Maranget – EPI Gallium – Inria Paris
    2.37.1
  46. Verification of Blocking Analyses for Multicore Real-Time Systems
    Björn Brandenburg — Max Planck Institute for Software Systems (Kaiserslautern, Germany)
  47. Causal Graph Dynamics
    Pablo Arrighi - LIF (Marseille) & IXXI (Lyon)
  48. Quantum Walking in a Discrete Geometry
    Pablo Arrighi - LIF (Marseille) & IXXI (Lyon)
  49. Dynamic Clustering: Theory and Practice
    Mauro Sozio - Telecom Paristech (Paris)
    Graph Mining (2-29-2)
  50. Intervalles de Tamari et cartes planaires
    Eric Fusy, LIX, Ecole Polytechnique
    2.10
  51. Simplification parallèle des groupes d’homologie persistante (TDA)
    Julien Tierny - LIP6 UPMC - Paris métro Jussieu (lignes 7 & 10)
    2-39, 2.14.1
  52. Calcul progressif de diagrammes de persistance (TDA)
    Julien Tierny - LIP6 UPMC - Paris métro Jussieu (lignes 7 & 10)
    2-39, 2.14.1
  53. Distances géométriquement discriminantes entre diagrammes de persistance (TDA)
    Julien Tierny - LIP6 UPMC - Paris métro Jussieu (lignes 7 & 10)
    2-39, 2.14.1
  54. Barycentres de Wasserstein pour les diagrammes de persistance (TDA)
    Julien Tierny - LIP6 UPMC - Paris métro Jussieu (lignes 7 & 10)
    2-39, 2.14.1
  55. Diagrammes de persitance out-of-core (TDA)
    Julien Tierny - LIP6 UPMC - Paris métro Jussieu (lignes 7 & 10)
    2-39, 2.14.1
  56. Compression de données avec perte préservant les diagrammes de persistance (TDA)
    Julien Tierny - LIP6 UPMC - Paris métro Jussieu (lignes 7 & 10)
    2-39, 2.14.1
  57. Software security through binary-level analysis
    Sébastien Bardin - CEA Saclay
  58. Discrete systolic inequalities
    Arnaud de Mesmay and Francis Lazarus
    2.38.1
  59. Space of metrics on a combinatorial surface
    Francis Lazarus and Arnaud de Mesmay - GIPSA-Lab, Grenoble
    2.38.1
  60. Identification of DNA in metagenomic samples
    Fabio PARDI, Eric RIVALS - LIRMM, Montpellier
  61. Uniform sampling of timed patterns for cyber-physical systems test generation
    Nicolas Basset, Thao Dang - Verimag, Grenoble
    2.8.2, 2.9.2, 1.24, 1.22
  62. Graphes plongés sur les surfaces: algorithmes pour la génération et le plongement en genre supérieur
    Luca Castelli Aleardi - LIX (Polytechnique)
    2.38.1
  63. Static analysis of fault-tolerant distributed protocols
    Cezara DRAGOI, ENS Paris
  64. Compilation schemes for high-level fault-tolerant distributed protocols
    Cezara DRAGOI ENS Paris
  65. Constant-time compilation and programming
    David Pichardie - ENS Rennes/IRISA/Inria - Rennes
  66. Symbolic derivation of abstract interpreter in Coq
    David Pichardie - ENS Rennes/IRISA/Inria - Rennes
  67. Approximate Learning of Monotone Functions
    Oded Maler and Nicolas Basset, Verimag, Grenoble
  68. Learning Automata over Large Alphabets as an Alternative to Recurrent Neural Networks
    Oded Maler and Nicolas Basset, Verimag, Grenoble
  69. Temporal Data Mining: Learning from Positive Examples
    Oded Maler and Nicolas Basset, Verimag, Grenoble
  70. Correct datatypes for geo-replicated distributed applications
    Nair, Shapiro / LIP6 Regal group
    Concurrency; Proofs of programs ; Algorithmique distribuée
  71. Synchronisation-free mobile gaming
    Paolo Viotti, Marc Shapiro; UPMC-LIP6 Regal group
    Concurrency; Distributed algorithms
  72. Shared, persistent and mutable big-data structures
    Gaël Thomas, Marc Shapiro; UPMC-LIP6 Regal group
    Concurrency; Semantics, languages and algorithms for multicore programming
  73. From an OCaml interpreter to a pretty-big-step inductive semantics in Coq
    Alan Schmitt, Inria Rennes
  74. A Multi Debugger for Hop.js
    Alan Schmitt, Inria Rennes
  75. Competitive ratio of load balancing in the random order arrival model
    UPMC
    2.24.1, 2.11.1
  76. Experimental and theoretical investigations of bijective analysis of online algorithms
    Spyros Angelopoulos
    2.24.1, 2.11.1
  77. Cortical learning
    Petr Kuznetsov, Telecom ParisTech, Denis Sheynikhovich, UPMC
  78. Dynamic Parallelism in Consortium Blockchains
    Petr Kuznetsov, Telecom ParisTech
  79. A changepoint detection algorithm in dimension 2 using pruned dynamic programming
    Vincent Runge - Guillem Rigaill - Michel Koskas. Evry 91000. IBGBI
    2.24.2
  80. Imagerie de diffusion multi-compartiment pour la définition de biomarqueurs d’imagerie de la neuropathie optique inflammatoire
    Olivier Commowick
  81. On Randomness in Scheduling
    Carola Doerr, Fanny Pascual, Thang Nguyen Kim at LIP6, UPMC, Paris 6
    2.24.1: Optimization; 2.24.2 Optimization and Search Heuristics; 2.11.1: Randomized algorithms;
  82. Performance Criteria in Discrete Black-Box Optimization
    Carola Doerr (CNRS, LIP6, UPMC) and Benjamin Doerr (LIX, Ecole Polytechnique)
    2.24.1: Optimization; 2.24.2 Optimization and Search Heuristics; 2.11.1: Randomized algorithms;
  83. FORMALISATION DU COMPORTEMENT D'UNE BLOCKCHAIN
    Pierre-Yves PIRIOU, EDF Chatou
  84. Dynamic Parallelism in Consortium Blockchains
    Petr Kuznetsov, Telecom ParisTech
  85. Méthodes d’apprentissage par Deep Learning pour la segmentation d’images IRM en sclérose en plaques
    Olivier Commowick
  86. Proof Systems for Intuitionistic Non-Normal Modal Logic
    Charles Grellois and Nicola Olivetti – Aix-Marseille Université, LSIS/LIS laboratory
  87. Le diamètre des multiassociaèdres et des accordéoèdres
    Lionel Pournin (Université Paris 13) & Vincent Pilaud (École Polytechnique)
    2-38-1, 2-10
  88. Higher-Order Model-Checking and Linear Logic
    Charles Grellois – Aix-Marseille Université, LSIS (LIS) laboratory
    2.1, 2.2, 2.20.1
  89. Refinement types for modular abstract interpretation
    Jean-Pierre Talpin (@inria.fr) David Pichardie (@ens-rennes.fr) – INRIA/IRISA, Rennes
    2.4, 2.5, 2.6, 2.7, 2.9
  90. The optimal secret key agreement and information inequalities.
    Andrei Romashchenko, Alexander Shen, LIRMM, Montpellier
  91. Verification and Synthesis of Concurrent Programs
    Professor Azadeh Farzan – University of Toronto
  92. Experiments on deliberation based on formal artificial intelligence tools
    Yves Meinard & Olivier Cailloux - LAMSADE, Paris Dauphine
  93. Optimizing minimizers: searching big sequential data
    Gregory Kucherov - LIGM Marne-la-Vallée
    Algorithmics and bioinformatics
  94. Ordinary Differential Equation Solver for Computational Biology
    Jonathan Rouzaud-Cornabas - Inria Beagle - Lyon
  95. Longest chains in Noetherian spaces
    Jean Goubault-Larrecq, Sylvain Schmitz - LSV, ENS Paris-Saclay
    2.9.1
  96. Junior Software and Research Intern @Foodvisor
    Yann Giret - Paris (11ème)
  97. A categorical approach to game semantics
    Clovis Eberhart and Tom Hirschowitz (Chambéry)
    2.2 (2.1, 2.3.1)
  98. Preuves en Coq de Programmes Multi-ML
    Frédéric Gava
  99. Conception d'algorithmes multi-BSP sur les graphes et leur implantation à l'aide d'une extension de OCaml dédiée à la programmation distribuée multi-BSP
    Frédéric Gava
  100. Biochemical computing
    François Fages - Inria Saclay Ile de France
  101. Machine learning models from data
    François Fages - INria Saclay Ile de France
  102. Model reduction by tropical algebra constraint solving
    François Fages - Inria Saclay Ile de France
  103. Positive feedback loops and multistationarity in reaction networks
    Sylvain Soliman
  104. Formal verification of Ocaml's serialisation
    Julien Tesson - Université Paris-est Créteil
  105. Graph matching by SAT solving
    François Fages - INRIA Saclay Ile de France
  106. Cryptographie multivariée et polynômes de permutation
    Gilles Macario-Rat / Orange Chatillon
  107. Quantum Algorithms and Quantum programming models
    Henri Calandra - TOTAL, Centre Technique Jean Feger, Pau
    2.34.1, 2.34.2
  108. Polarized Deduction Modulo Theory : Models and Automated Theorem Proving
    Olivier Hermant - Fontainebleau/Paris
  109. Master internship+Phd : SNACCC (SyNchronous Abstract Contractual Connected Components) design language
    Sebti Mouelhi - ECE Paris
  110. Combinaison de techniques d’abstraction de tableaux pour l’analyse statique
    Valentin Perrelle
    2.6
  111. Vérification de programmes quantiques par interprétation abstraite
    Valentin Perrelle, Sébastien Bardin et Benoît Valrion - CEA Saclay
    2.6 2.34.1
  112. internships2018

  113. Analyse initialisation et retard non initialisé dans Vélus
    Timothy Bourke & Marc Pouzet
    2-23-1 Parallélisme synchrone
  114. Compilation de modèles Lustre multipériodiques vers du code parallèle
    Timothy Bourke & Marc Pouzet
    2-23-1 Parallélisme synchrone
  115. Simulation symbolique et génération de tests pour les programmes synchrones ou hybrides
    Timothy Bourke & Marc Pouzet
    2-23-1 Parallélisme synchrone
  116. Algorithms for Public Transport Networks
    L. Viennot – Paris Diderot
    2.29.2 (Graph mining)
  117. Reliable Fast Stack Unwinding
    Francesco Zappa Nardelli
  118. Stage - Développeur Logiciel - HedgeGuard
    LIBERT Quentin - 75008
  119. erifying replicated data structures: causal consistency
    Constantin Enea - IRIF
    2.9.2, 2.6, 2.8.1, 2.37.1,
  120. Randomized Confluence
    Flavien Breuvart (LIPN) and Claudia Fagian (IRIF)
    1-24
  121. Randomised strategies and 0-1 law
    Flavien Breuvart and Olivier Bodini(LIPN, pARIS13)
  122. λ-theories and computable trees
    Flavien Breuvart (LIPN, Paris 13)
    2.2
  123. Formalisation of Scheduled Types in Coq
    Flavien Breuvart and Micaela Mayero (LIPN, Paris 13)
    2.4, 2.7.2
  124. De-ornamentation
    Didier Rémy - Inria Paris
  125. Dynamic Algorithms in Congestion Management
    Christoph Dürr and Nguyen Kim Thang
    2.24.1
  126. Anonymous and Colored Asynchronous Computability
    Prof. Petr Kuznetsov
  127. Control of Adaptive Systems using Game Theory
    Ocan Sankur, Herve Marchand (Inria Rennes - Irisa)
    2.8.1, 2.8.2, 2.6, 2.9.1, 2.9.2,
  128. Development of a new cryo - electron micr oscopy image analysis approach to conformational variability of biomolecular complexes
    Slavica JONIC, Sorbonne Université, 75005 Paris
  129. Development of a new cryo - electron tomography (cryo - ET) image analysis approach to conformational variability of biomolecular complexes
    Slavica JONIC, Sorbonne Université, 75005 Paris
  130. Advanced Post-Quantum Symmetric Cryptanalysis
    María Naya-Plasencia - Inria, Paris
    2.13.2, 2.34.2
  131. Verification of machine learning models
    Nathanaël Fijalkow, LaBRI (Bordeaux)
    Théorie des automates, Apprentissage, Systèmes Dynamiques, Théorie des jeux, Vérification, Interprétation Abstraite
  132. Mean Field Optimal Control for Multi-Armed Bandit Problems
    Nicolas Gast, Patrick Loiseau (Inria Grenoble)
  133. Development of software for prediction of drug toxicity
    Maria A. Miteva, Directeur de recherche Inserm, Faculté de Pharmacie de Paris, 4 av de l'Observatoire 75270 Paris cedex 06
  134. Towards Efficient Big Data Management with Transient Storage Systems
    Gabriel Antoniu - Inria, Rennes
    2.26.2, 2.37.1
  135. HPC-Big Data convergence at processing level by bridging in-situ/in-transit processing with Big Data analytics
    Alexandru Costan, Gabriel Antoniu - Inria, Rennes
    2.26.2, 2.37.1
  136. Différences sémantiques : théorie, techniques et applications
    David Mentré, Yann Régis-Gianas, at IRIF
  137. Cryptanalysis of Tweakable Block Ciphers
    Gaëtan Leurent - Inria Paris (75012)
    2.13.2
  138. The Formal Semantics and Evolution of the F* Verification System
    Catalin Hritcu, Inria Paris
    2.4, 2.36.1, 2.7.2, 2.7.1, 1.20, 2.2
  139. Gradual Typing for dynamic languages
    Giuseppe Castagna - IRIF
    2_4 Functional programming and type systems
  140. Automated Algorithm Configuration
    Carola Doerr (CNRS, LIP6) and Manuel Lopez-Ibanez (Manchester University, UK)
    2.24.1: Optimization; 2.24.2 Optimization and Search Heuristics; 2.11.1: Randomized algorithms;
  141. programmation vérifiée de fonctions de flot
    Jean-Pierre Talpin, Inria Rennes
  142. Hierarchical Parallelization
    Christophe ALIAS (LIP/ENS de Lyon)
  143. Hardware Compilation: Recover the FIFOs!
    Christophe ALIAS (LIP/ENS de Lyon)
  144. Quantitative types for the atomic lambda-calculus
    Delia Kesner