index - Institut de Recherche en Informatique Fondamentale Access content directly

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

488

FULL-TEXT

843

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS