default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Luc Rémy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j14]Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy:
On the number of balanced words of given length and height over a two letter alphabet. Discret. Math. Theor. Comput. Sci. 12(3): 41-62 (2010)
2000 – 2009
- 2007
- [j13]Y.-F. S. Pétermann, Jean-Luc Rémy:
On the Cohen-Olivier algorithm for computing ζ(s): Error analysis in the real case for an arbitrary precision. Adv. Appl. Math. 38(1): 54-70 (2007) - 2005
- [j12]Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli:
Linear segmentation of discrete curves into blurred segments. Discret. Appl. Math. 151(1-3): 122-137 (2005) - 2003
- [j11]Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli:
Detection of the discrete convexity of polyominoes. Discret. Appl. Math. 125(1): 115-133 (2003) - [j10]Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli:
Segmentation of Discrete Curves into Fuzzy Segments. Electron. Notes Discret. Math. 12: 372-383 (2003) - 2001
- [j9]Y.-F. S. Pétermann, Jean-Luc Rémy, Ilan Vardi:
Discrete Derivatives of Sequences. Adv. Appl. Math. 27(Issues): 562-584 (2001) - 2000
- [c10]Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli:
Detection of the Discrete Convexity of Polyominoes. DGCI 2000: 491-504
1990 – 1999
- 1997
- [j8]Laurent Alonso, Jean-Luc Rémy, René Schott:
A Linear-Time Algorithm for the Generation of Trees. Algorithmica 17(2): 162-183 (1997) - [j7]Laurent Alonso, Jean-Luc Rémy, René Schott:
Uniform Generation of a Schröder Tree. Inf. Process. Lett. 64(6): 305-308 (1997) - 1993
- [j6]Marisa Navarro
, Fernando Orejas, Jean-Luc Rémy:
Contextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications. Acta Informatica 30(2): 147-180 (1993) - [e1]Michaël Rusinowitch, Jean-Luc Rémy:
Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings. Lecture Notes in Computer Science 656, Springer 1993, ISBN 3-540-56393-8 [contents] - 1990
- [c9]Wadoud Bousdira, Jean-Luc Rémy:
On Sufficient Completeness of Conditional Specifications. CTRS 1990: 272-286
1980 – 1989
- 1988
- [c8]Wadoud Bousdira, Jean-Luc Rémy:
Hierarchical Contextual Rewriting with Several Levels. STACS 1988: 193-206 - 1987
- [c7]Wadoud Bousdira, Jean-Luc Rémy:
Hierarchical Contextual Rewriting with Several Levels. CTRS 1987: 15-30 - [c6]Wadoud Bousdira, Jean-Luc Rémy:
REVEUR4: A Laboratory for Conditional Rewriting. CTRS 1987: 253-257 - [c5]Wadoud Bousdira, Jean-Luc Rémy:
REVEUR4: A Laboratory for Conditional Rewriting. STACS 1987: 472-473 - 1985
- [j5]Jean-Luc Rémy:
Un Procédé Itératif de Dénombrement D'arbres Binaires et Son Application A Leur Génération Aléatoire. RAIRO Theor. Informatics Appl. 19(2): 179-195 (1985) - [c4]Hantao Zhang, Jean-Luc Rémy:
Contextual Rewriting. RTA 1985: 46-62 - 1984
- [c3]Jean-Luc Rémy, Hantao Zhang:
REVEUR 4: A System for Validating Conditional Algebraic Specifications of Abstract Data Types. ECAI 1984: 373-382 - 1983
- [c2]Jean-Luc Rémy:
Specifications of Errors in Data Types using Conditional Axioms. ADT 1983 - [c1]Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Rémy:
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems. IJCAI 1983: 909-915 - 1982
- [j4]Jean-Luc Rémy, Paulo A. S. Veloso:
Comparing data type specifications via their normal forms. Int. J. Parallel Program. 11(3): 141-153 (1982) - 1981
- [j3]Jean-Luc Rémy, Paulo A. S. Veloso:
An economical method for comparing data type specifications. ACM SIGPLAN Notices 16(5): 39-42 (1981) - 1980
- [j2]Jean-Luc Rémy:
Construction, Évaluation et Amélioration Systématiques de Structures de Données. RAIRO Theor. Informatics Appl. 14(1): 83-118 (1980)
1970 – 1979
- 1979
- [j1]Manfred Broy, Martin Wirsing, Jean-Pierre Finance, Alain Quéré, Jean-Luc Rémy:
Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence. Inf. Process. Lett. 8(5): 224-229 (1979)
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 2025-01-09 12:56 CET 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:
