Welcome to the collection of IRIF laboratory - UMR 8243

Institut de Recherche en Informatique Fondamentale (IRIF) is a research unit co-founded by CNRS and Université Paris Cité, as UMR 8243. It results from the merging of the two research units LIAFA and PPS on January 1st, 2016. IRIF hosts one Inria project-team. IRIF is also member of Fondation Sciences Mathématiques de Paris (FSMP), and of three regional programs: Math Innov, Computer Sciences, Quantum Technologies.

The research conducted at IRIF is based on the study and understanding of the foundations of all computer science, in order to provide innovative solutions to the current and future challenges of digital sciences. In particular, IRIF is renown for its contributions to the design and analysis of algorithms, the study of computational and data representation models, the foundations of programming languages, software development, verification, and certification. IRIF also conducts interdisciplinary research taking advantage of its scientific approach.

•This collection contains only publications submitted on the initiative of their authors and is therefore not representative of all IRIF publications. Any statistical study of this collection could only be wrong. However, IRIF encourages its members to regularly deposit their publications in this collection.•

 

 

 

REFERENCES

503

FULL-TEXT

930

 

Open Access

89 %

 

KEY WORDS

Distributed graph algorithms Proof theory Conference Smart contracts Linear logic Vérification Automaton groups Geometry of interaction Broadcasting Approximation algorithms Reduction operators Coloring Eccentricity Complexity Fixed points Theory of computation Cluster complex CONGEST Subtyping Category theory Distributed Computing Distributed systems Polynomial functor Combinatorial topology Cryptography Reverse mathematics Classical logic Consensus Shared memory Diameter Non-wellfounded proofs Distributed algorithms Theory of computation → Graph algorithms analysis Graph search Coinduction Topology Combinatorial model category Sequent calculus Verification Proof assistant Separation Réécriture Reachability Directed path Semantics Transducers Intersection types Monoid Logic in Computer Science csLO Algorithm Communication complexity Formal verification Call-by-value BFS Blockchain Bisimulation Opetope Noncrossing partitions Coverability Temporal path Type theory Categorical semantics Cut elimination Concurrency Automata Formal methods Polygraphs Lower bounds Systèmes distribués Denotational semantics Quantum algorithms Program verification Approximation Algorithms Clustering CCS Concepts Opetopic set Catégories supérieures Regular languages Graph algorithms Proof assistants Decidability Accessible model category Linear Logic Circular proofs Union types Coq Software Package Installation Signed graphs Curry-Howard Rewriting Symbolic dynamics Lambda-calculus Combinatorial maps Authentication Abstract machines Lambda-Calculus Theory of computation → Distributed algorithms Graph theory Lambda calculus Proof nets

 

COLLABORATIONS