O
Olivier Raynaud
Researcher at Blaise Pascal University
Publications - 34
Citations - 492
Olivier Raynaud is an academic researcher from Blaise Pascal University. The author has contributed to research in topics: Bit array & Family of sets. The author has an hindex of 9, co-authored 34 publications receiving 469 citations. Previous affiliations of Olivier Raynaud include University of Auvergne & University of Montpellier.
Papers
More filters
Journal ArticleDOI
A fast algorithm for building lattices
Lhouari Nourine,Olivier Raynaud +1 more
TL;DR: This algorithm can be used to compute the Galois (concept) lattice, the maximal antichains lattice or the Dedekind‐MacNeille completion of a partial order, without increasing time complexity.
Journal ArticleDOI
A fast incremental algorithm for building lattices
Lhouari Nourine,Olivier Raynaud +1 more
TL;DR: An incremental algorithm to compute the covering graph of the lattice generated by a family B of subsets of a totally ordered set X which improves the complexity of the previous algorithms which is roughly in O(Min(|X|, |B|)3.|F|).
Journal ArticleDOI
Encoding of Multiple Inheritance Hierarchies and Partial Orders
TL;DR: This paper provides a correct algorithm for partial orders based on simple encoding, improving the algorithm of Krall, Vitek, and Horspool (1997), and shows that finding an optimal simple encoding is an NP‐hard problem.
Book ChapterDOI
Counting of moore families for n=7
TL;DR: This paper introduces a counting strategy for determining the number of Moore families for n=7 and gives the exact value : 14 087 648 235 707 352 472.
Book ChapterDOI
A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests
Olivier Raynaud,Eric Thierry +1 more
TL;DR: The algorithm is simple, it computes the bit-vector encoding very quickly and gives good results for the size of the encoding, in particular, the best bounds known for the encoding sizes of some benchmarks presented in [9].