6

An Old SubQuadratic Algorithm for Finding Extremal Sets
–
 1994

9

Opportunistic algorithms for eliminating supersets
–
 1991

9

Finding extremal sets in less than quadratic time
–
 1993

4

A Simple SubQuadratic Algorithm for Computing the Subset Partial Order
–
 1995

127

Dynamic Perfect Hashing: Upper and Lower Bounds
–
 1990

2447

The Design and Analysis of Computer Algorithms
–
 1974

357

Three partition refinement algorithms
–
 1987

2

A fast bitparallel algorithm for computing the subset partial order
–
 1999

533

Typesetting Concrete Mathematics
–
 1989

1

Lezigzagraphic order (avec un application), forthcoming
–
 1995

2

Fully Dynamic Algorithms for Maintaining Extremal Sets in A Family of Sets
–
 1995

2

Fast sequential and parallel algorithms for finding extremal sets
–
 1996

15

Algorithms for subset testing and finding maximal sets
–
 1992

5

A Fast Algorithm for Building the Hasse Diagram of a Galois Lattice
–
 2000

4

Algorithms for Finding Matrix Models of Propositional Calculi
–
 1991

1

A Fast Bitwise Algorithm for Computing the Subset Partial Order
–
 1995

4

Private Communication
–

6

Chu spaces, formal concepts, and domains
–

14

Generating Frequent Itemsets Incrementally: Two Novel Approaches Based on Galois Lattice Theory
–
 2002
