default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Claude Spehner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner:
Separation by Convex Pseudo-Circles. Discret. Comput. Geom. 65(4): 1199-1231 (2021)
2010 – 2019
- 2014
- [c12]Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner:
Separation by Convex Pseudo-Circles. SoCG 2014: 444 - 2013
- [j14]Dominique Schmitt, Jean-Claude Spehner:
Araucaria Trees: Construction and Grafting Theorems. Fundam. Informaticae 123(4): 417-445 (2013) - 2011
- [j13]Wael El Oraiby, Dominique Schmitt, Jean-Claude Spehner:
Centroid Triangulations from k-Sets. Int. J. Comput. Geom. Appl. 21(6): 635-659 (2011)
2000 – 2009
- 2007
- [j12]René Schott, Jean-Claude Spehner:
Erratum for "Shuffle of Words and Araucaria Trees". Fundam. Informaticae 81(4): 485-490 (2007) - 2006
- [j11]René Schott, Jean-Claude Spehner:
Shuffle of Words and Araucaria Trees. Fundam. Informaticae 74(4): 579-601 (2006) - [c11]Dominique Schmitt, Jean-Claude Spehner:
k-set polytopes and order-k Delaunay diagrams. ISVD 2006: 173-185 - 2004
- [j10]René Schott, Jean-Claude Spehner:
Two optimal parallel algorithms on the commutation class of a word. Theor. Comput. Sci. 324(1): 107-131 (2004) - [c10]René Schott, Jean-Claude Spehner:
On the Minimal Automaton of the Shuffle of Words and Araucarias. MCU 2004: 316-327 - 2000
- [c9]René Schott, Jean-Claude Spehner:
Two Optimal Parallel Algorithms on the Commutation Class of a Word. Words, Languages & Combinatorics 2000: 403-419 - [c8]Pierre Kauffmann, Jean-Claude Spehner:
The Construction of Delaunay Diagrams by Lob Reduction. JCDCG 2000: 205-216
1990 – 1999
- 1999
- [j9]Dominique Schmitt, Jean-Claude Spehner:
Angular Properties of Delaunay Diagrams in Any Dimension. Discret. Comput. Geom. 21(1): 17-36 (1999) - 1998
- [c7]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 - [c6]Dominique Schmitt, Jean-Claude Spehner:
Order-k Voronoi Diagrams, k-Sections, and k-Sets. JCDCG 1998: 290-304 - 1997
- [c5]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
- [j8]Jean-Denis Fouks, Jean-Claude Spehner:
Meta-Resolution: An Algorithmic Formalisation. Theor. Comput. Sci. 166(1&2): 147-172 (1996) - 1995
- [c4]Michel F. Sanner, Arthur J. Olson, Jean-Claude Spehner:
Fast and Robust Computation of Molecular Surfaces. SCG 1995: C6-C7 - 1994
- [j7]Jean-Claude Spehner:
A Bijection Between Cliques in Graphs and Factorizations in Free Monoids. Theor. Comput. Sci. 134(1): 209-223 (1994) - 1993
- [c3]Dominique Schmitt, Jean-Claude Spehner:
On Equiangularity of Delaunay Diagrams in Every Dimension. CCCG 1993: 346-351 - 1991
- [j6]Jean-Claude Spehner:
Merging in Maps and in Pavings. Theor. Comput. Sci. 86(2): 205-232 (1991) - 1990
- [j5]Mounir Elbaz, Jean-Claude Spehner:
Construction of Voronoi Diagrams in the Plane by Using Maps. Theor. Comput. Sci. 77(3): 331-343 (1990)
1980 – 1989
- 1988
- [j4]Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire. Theor. Comput. Sci. 60: 341-381 (1988) - [c2]Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume). ICALP 1988: 547-560 - 1986
- [j3]Jean-Claude Spehner:
Le Calcul Rapide des Melanges de Deux Mots. Theor. Comput. Sci. 47(3): 171-203 (1986) - [j2]Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Mot dans un Texte. Theor. Comput. Sci. 48(3): 35-52 (1986) - [c1]Jean-Claude Spehner:
Un Algorithme Determinant les Melanges de Deux Mots. ICALP 1986: 387-396 - 1985
- [j1]Jean-Claude Spehner:
Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht. Theor. Comput. Sci. 39: 171-188 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
