Jean-Luc Rémy

25 papers A* 1A 3Journal 14Unranked 6
YearRankTypeTitle / Venue / Authors
2010 J jnl
On the number of balanced words of given length and height over a two letter alphabet.
Discret. Math. Theor. Comput. Sci.
Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy
2007 J jnl
On the Cohen-Olivier algorithm for computing ζ(s): Error analysis in the real case for an arbitrary precision.
Adv. Appl. Math.
Y.-F. S. Pétermann, Jean-Luc Rémy
2005 J jnl
Linear segmentation of discrete curves into blurred segments.
Discret. Appl. Math.
Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli
2003 J jnl
Detection of the discrete convexity of polyominoes.
Discret. Appl. Math.
Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli
2003 J jnl
Segmentation of Discrete Curves into Fuzzy Segments.
Electron. Notes Discret. Math.
Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli
2001 J jnl
Discrete Derivatives of Sequences.
Adv. Appl. Math.
Y.-F. S. Pétermann, Jean-Luc Rémy, Ilan Vardi
2000 — conf
Detection of the Discrete Convexity of Polyominoes.
DGCI
Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli
1997 J jnl
A Linear-Time Algorithm for the Generation of Trees.
Algorithmica
Laurent Alonso, Jean-Luc Rémy, René Schott
1997 J jnl
Uniform Generation of a Schröder Tree.
Inf. Process. Lett.
Laurent Alonso, Jean-Luc Rémy, René Schott
1993 — ed.
Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings
CTRS
Michaël Rusinowitch, Jean-Luc Rémy
1993 J jnl
Contextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications.
Acta Informatica
Marisa Navarro, Fernando Orejas, Jean-Luc Rémy
1990 — conf
On Sufficient Completeness of Conditional Specifications.
CTRS
Wadoud Bousdira, Jean-Luc Rémy
1988 A conf
Hierarchical Contextual Rewriting with Several Levels.
STACS
Wadoud Bousdira, Jean-Luc Rémy
1987 — conf
Hierarchical Contextual Rewriting with Several Levels.
CTRS
Wadoud Bousdira, Jean-Luc Rémy
1987 — conf
REVEUR4: A Laboratory for Conditional Rewriting.
CTRS
Wadoud Bousdira, Jean-Luc Rémy
1987 A conf
REVEUR4: A Laboratory for Conditional Rewriting.
STACS
Wadoud Bousdira, Jean-Luc Rémy
1985 — conf
Contextual Rewriting.
RTA
Hantao Zhang, Jean-Luc Rémy
1985 J jnl
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.
Jean-Luc Rémy
1984 A conf
REVEUR 4: A System for Validating Conditional Algebraic Specifications of Abstract Data Types.
ECAI
Jean-Luc Rémy, Hantao Zhang
1983 A* conf
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems.
IJCAI
Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Rémy
1983 — conf
Specifications of Errors in Data Types using Conditional Axioms.
ADT
Jean-Luc Rémy
1982 J jnl
Comparing data type specifications via their normal forms.
Int. J. Parallel Program.
Jean-Luc Rémy, Paulo A. S. Veloso
1981 J jnl
An economical method for comparing data type specifications.
ACM SIGPLAN Notices
Jean-Luc Rémy, Paulo A. S. Veloso
1980 J jnl
Construction, Évaluation et Amélioration Systématiques de Structures de Données.
RAIRO Theor. Informatics Appl.
Jean-Luc Rémy
1979 J jnl
Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence.
Inf. Process. Lett.
Manfred Broy, Martin Wirsing, Jean-Pierre Finance, Alain Quéré, Jean-Luc Rémy