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

491

FULL-TEXT

852

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS