index - Institut de Recherche en Informatique Fondamentale

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

493

FULL-TEXT

846

 

Open Access

88 %

 

KEY WORDS

Decision problems Accessible model category Observational equivalence Complexity Type theory Proof assistant Distributed decision Broadcasting Dependent type theory Lower bounds Distributed systems Denotational semantics Graph algorithms Circular proofs Automata Catégories supérieures Smart contracts Consensus Non-wellfounded proofs Denotational Semantics Rewriting Approximation algorithms Communication complexity Shared memory Intersection types Fixed points Union types Software Package Installation Polygraphs Noncrossing partitions Conference Sequent calculus Combinatorial model category CONGEST Temporal path Subtyping Theory of computation Category theory Proof nets Combinatorial maps Monoid Topology Directed homotopy Dynamical analysis of Algorithms Categorical semantics Lambda calculus Automaton groups Graph search Graph theory Coinduction Linear logic Clustering Approximation Algorithms Décision distribuée Coq Signed graphs Classical logic Geometry of interaction Lambda-Calculus Distributed Computing Formal verification Verification Distributed graph algorithms Cluster complex Algorithm Opetopic set Decidability Formal methods Directed path Linear Logic Polynomial functor Curry-Howard Proof assistants Diameter Eccentricity Distance Labeling Call-by-value Semantics Distributed algorithms Cut elimination Coloring Exponential modalities Combinatorial topology Opetope Authentication Regular languages Reverse mathematics Réécriture Reachability Symbolic dynamics Proof theory Quantum algorithms Reduction operators Transducers BFS Concurrency Distributed verification Cryptography Theory of computation → Graph algorithms analysis Separation

 

COLLABORATIONS