ICFCA 2007:
Clermont-Ferrand, France
Sébastien Ferré:
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.
98-113
Björn Vormbrock:
A Solution of the Word Problem for Free Double Boolean Algebras.
240-270
Tim Becker:
Polynomial Embeddings and Representations.
281-302
Rudolf Wille:
The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices.
303-312
data released under the ODC-BY 1.0 license
