| * | 2007 |
|---|
| 21 | EE | René Schott,
Jean-Claude Spehner:
Erratum for "Shuffle of Words and Araucaria Trees".
Fundam. Inform. 81(4): 485-490 (2007) |
| 2006 |
|---|
| 20 | EE | René Schott,
Jean-Claude Spehner:
Shuffle of Words and Araucaria Trees.
Fundam. Inform. 74(4): 579-601 (2006) |
| 2004 |
|---|
| 19 | EE | René Schott,
Jean-Claude Spehner:
On the Minimal Automaton of the Shuffle of Words and Araucarias.
MCU 2004: 316-327 |
| 18 | EE | René Schott,
Jean-Claude Spehner:
Two optimal parallel algorithms on the commutation class of a word.
Theor. Comput. Sci. 324(1): 107-131 (2004) |
| 2000 |
|---|
| 17 | EE | Pierre Kauffmann,
Jean-Claude Spehner:
The Construction of Delaunay Diagrams by Lob Reduction.
JCDCG 2000: 205-216 |
| 1999 |
|---|
| 16 | EE | Dominique Schmitt,
Jean-Claude Spehner:
Angular Properties of Delaunay Diagrams in Any Dimension.
Discrete & Computational Geometry 21(1): 17-36 (1999) |
| 1998 |
|---|
| 15 | EE | Bruno Adam,
Pierre Kauffmann,
Dominique Schmitt,
Jean-Claude Spehner:
A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane.
CCCG 1998 |
| 14 | | Dominique Schmitt,
Jean-Claude Spehner:
Order-k Voronoi Diagrams, k-Sections, and k-Sets.
JCDCG 1998: 290-304 |
| 1997 |
|---|
| 13 | | Bruno Adam,
Pierre Kauffmann,
Dominique Schmitt,
Jean-Claude Spehner:
An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane.
CCCG 1997 |
| 1996 |
|---|
| 12 | EE | Jean-Denis Fouks,
Jean-Claude Spehner:
Meta-Resolution: An Algorithmic Formalisation.
Theor. Comput. Sci. 166(1&2): 147-172 (1996) |
| 1995 |
|---|
| 11 | EE | Michel F. Sanner,
Arthur J. Olson,
Jean-Claude Spehner:
Fast and Robust Computation of Molecular Surfaces.
Symposium on Computational Geometry 1995: C6-C7 |
| 1994 |
|---|
| 10 | | Jean-Claude Spehner:
A Bijection Between Cliques in Graphs and Factorizations in Free Monoids.
Theor. Comput. Sci. 134(1): 209-223 (1994) |
| 1993 |
|---|
| 9 | | Dominique Schmitt,
Jean-Claude Spehner:
On Equiangularity of Delaunay Diagrams in Every Dimension.
CCCG 1993: 346-351 |
| 1991 |
|---|
| 8 | | Jean-Claude Spehner:
Merging in Maps and in Pavings.
Theor. Comput. Sci. 86(2): 205-232 (1991) |
| 1990 |
|---|
| 7 | | Mounir Elbaz,
Jean-Claude Spehner:
Construction of Voronoi Diagrams in the Plane by Using Maps.
Theor. Comput. Sci. 77(3): 331-343 (1990) |
| 1988 |
|---|
| 6 | EE | Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume).
ICALP 1988: 547-560 |
| 5 | | Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire.
Theor. Comput. Sci. 60: 341-381 (1988) |
| 1986 |
|---|
| 4 | EE | Jean-Claude Spehner:
Un Algorithme Determinant les Melanges de Deux Mots.
ICALP 1986: 387-396 |
| 3 | | Jean-Claude Spehner:
Le Calcul Rapide des Melanges de Deux Mots.
Theor. Comput. Sci. 47(3): 171-203 (1986) |
| 2 | | Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Mot dans un Texte.
Theor. Comput. Sci. 48(3): 35-52 (1986) |
| 1985 |
|---|
| 1 | | Jean-Claude Spehner:
Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht.
Theor. Comput. Sci. 39: 171-188 (1985) |
