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

492

FULL-TEXT

857

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS