default search action
Bertrand Le Saëc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [c8]Brahim Hamid, Bertrand Le Saëc, Mohamed Mosbah:
Distributed Local 2-Connectivity Test of Graphs and Applications. ISPA 2007: 195-207 - 2004
- [j11]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Orthogonal drawings based on the stratification of planar graphs. Discret. Math. 276(1-3): 43-57 (2004) - 2002
- [c7]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Wagner's Theorem on Realizers. ICALP 2002: 1043-1053 - [c6]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Optimal Area Algorithm for Planar Polyline Drawings. WG 2002: 35-46 - 2001
- [c5]Jean-François Delesse, Bertrand Le Saëc, Gérard Vignoles:
An efficient data structure for random walk algorithms in faceted porous media. Symposium on Solid Modeling and Applications 2001: 301 - 2000
- [j10]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Orthogonal Drawings Based On The Stratification Of Planar Graphs. Electron. Notes Discret. Math. 5: 35-37 (2000) - [j9]Jean-Christophe Gonzato, Bertrand Le Saëc:
On modelling and rendering ocean scenes. Comput. Animat. Virtual Worlds 11(1): 27-37 (2000)
1990 – 1999
- 1997
- [c4]Jean-Christophe Gonzato, Bertrand Le Saëc:
A phenomenological model of coastal scenes based on physical considerations. Computer Animation and Simulation 1997: 137-148 - [c3]Philippe Blasi, Bertrand Le Saëc, Gérard Vignoles:
Application of Rendering Techniques to Monte-Carlo Physcal Simulation of Gas Diffusion. Rendering Techniques 1997: 297-308 - 1996
- [j8]Bertrand Le Saëc, Igor Litovsky, Bruno Patrou:
A More Efficient Notion of Zigzag Stability. RAIRO Theor. Informatics Appl. 30(3): 181-194 (1996) - 1995
- [j7]Do Long Van, Bertrand Le Saëc, Igor Litovsky:
Characterizations of Rational omega-Languages by Means of Right Congruences. Theor. Comput. Sci. 143(1): 1-21 (1995) - 1994
- [c2]Bertrand Le Saëc, Igor Litovsky:
On the Minimization Prolem for Omega-Automata. MFCS 1994: 504-514 - 1993
- [j6]Philippe Blasi, Bertrand Le Saëc, Christophe Schlick:
A Rendering Algorithm for Discrete Volume Density Objects. Comput. Graph. Forum 12(3): 201-210 (1993) - [j5]Do Long Van, Bertrand Le Saëc, Igor Litovsky:
Stability for the Zigzag Submonoids. Theor. Comput. Sci. 108(2): 237-249 (1993) - 1992
- [j4]Bertrand Le Saëc, Igor Litovsky:
Rebootable and suffix-closed omega-power languages. RAIRO Theor. Informatics Appl. 26: 45-58 (1992) - [j3]Do Long Van, Bertrand Le Saëc, Igor Litovsky:
On coding morphisms for zigzag codes. RAIRO Theor. Informatics Appl. 26: 565-580 (1992) - 1991
- [j2]Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. 1(3): 291-314 (1991) - [c1]Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS 1991: 141-151 - 1990
- [j1]Bertrand Le Saëc:
Saturating right congruences. RAIRO Theor. Informatics Appl. 24: 545-559 (1990)
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-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint