Search the dblp DataBase

Publications of Author

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