On the relationship between prefix-codes, trees, and automata. - Jean-Louis Lassez (1973)

Prefix codes, trees and automata. - Jean-Louis Lassez (Inf. Sci., 1975)

A correspondence on strongly prefix codes (Corresp.). - Jean-Louis Lassez (IEEE Trans. Inf. Theory, 1975)

Circular codes and synchronization. - Jean-Louis Lassez (Int. J. Parallel Program., 1976)

Evaluation of length and level for simple program schemes. - Jean-Louis Lassez; Dirk van der Knijff (COMPSAC, 1979)

A Clarification of the Comparison Between Some Measures of Software Science. - Dirk van der Knijff; Jean-Louis Lassez (Inf. Process. Lett., 1979)

A critical examination of software science. - Jean-Louis Lassez; Dirk van der Knijff; John Shepherd 001; Catherine Lassez (J. Syst. Softw., 1981)

A Dual Problem to Least Fixed Points. - V. L. Nguyen; Jean-Louis Lassez (Theor. Comput. Sci., 1981)

Reasoning about Array Segments. - Joxan Jaffar; Jean-Louis Lassez (ECAI, 1982)

Fixed Point Theorems and Semantics: A Folk Tale. - Jean-Louis Lassez; V. L. Nguyen; Liz Sonenberg (Inf. Process. Lett., 1982)

Evaluating the effect of inter-programmer communication: levels on productivity by varying programming team structure. - John W. Bailey; Ken Christensen 001; Helmut Krcmar; Jean-Louis Lassez; Vincent Y. Shen; Scott N. Woodfield (ACM SIGSOFT Softw. Eng. Notes, 1982)

The Denotational Semantics of Horn Clauses as a Production System. - Jean-Louis Lassez; Michael J. Maher (AAAI, 1983)

Completeness of the Negation as Failure Rule. - Joxan Jaffar; Jean-Louis Lassez; John W. Lloyd (IJCAI, 1983)

A Unified Treatment of Resolution Strategies for Logic Programs. - David A. Wolfram; Michael J. Maher; Jean-Louis Lassez (ICLP, 1984)

A Theory of Complete Logic Programs with Equality. - Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher (J. Log. Program., 1984)

Closures and Fairness in the Semantics of Programming Logic. - Jean-Louis Lassez; Michael J. Maher (Theor. Comput. Sci., 1984)

Optimal Fixedpoints of Logic Programs. - Jean-Louis Lassez; Michael J. Maher (Theor. Comput. Sci., 1985)

Logic Programming Language Scheme. - Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher (Logic Programming: Functions, Relations, and Equations, 1986)

Unification Revisited. - Jean-Louis Lassez; Michael J. Maher; Kim Marriott (Foundations of Logic and Functional Programming, 1986)

Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. - Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher (ICLP, 1986)

Comments on "General Failure of Logic Programs". - Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher (J. Log. Program., 1986)

Maximal Unifiable Subsets and Minimal Nonunifiable Subsets. - T. Y. Chen; Jean-Louis Lassez; Graeme S. Port (New Gener. Comput., 1986)

PROLOG - II as an instance of the logic programming language scheme. - Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher (Formal Description of Programming Concepts, 1987)

From Unification to Constraints. - Joxan Jaffar; Jean-Louis Lassez (LP, 1987)

Constraint Logic Programming. - Joxan Jaffar; Jean-Louis Lassez (POPL, 1987)

Explicit Representation of Terms Defined by Counter Examples. - Jean-Louis Lassez; Kim Marriott (J. Autom. Reason., 1987)

Unification Revisited - Jean-Louis Lassez; Michael J. Maher; Kim Marriott (Foundations of Deductive Databases and Logic Programming., 1988)

Applications of a Canonical Form of Gerneralized Linear Constraints. - Jean-Louis Lassez; Ken McAloon (FGCS, 1988)

From Unification to Constraints. - Jean-Louis Lassez (SPLT, 1988)

Simplification and Elimination of Redundant Linear Arithmetic Constraints. - Jean-Louis Lassez; Tien Huynh; Ken McAloon (NACLP, 1989)

Independence of Negative Constraints. - Jean-Louis Lassez; Ken McAloon (TAPSOFT, Vol.1, 1989)

Fourier Algorithm Revisited. - Tien Huynh; Catherine Lassez; Jean-Louis Lassez (ALP, 1990)

Parametric queries, linear constraints and variable elimination. - Jean-Louis Lassez (DISCO, 1990)

Reasoning About Linear Constraints Using Parametric Queries. - Tien Huynh; Leo Joskowicz; Catherine Lassez; Jean-Louis Lassez (FSTTCS, 1990)

A Constraint Sequent Calculus - Jean-Louis Lassez; Ken McAloon (LICS, 1990)

Querying Constraints. - Jean-Louis Lassez (PODS, 1990)

Most Specific Logic Programs. - Kim Marriott; Lee Naish; Jean-Louis Lassez (Ann. Math. Artif. Intell., 1990)

From LP to LP: Programming with Constraints. - Jean-Louis Lassez (DBPL, 1991)

Elimination of Negation in Term Algebras. - Jean-Louis Lassez; Michael J. Maher; Kim Marriott (MFCS, 1991)

Practical tools for reasoning about linear constraints. - Tien Huynh; Leo Joskowicz; Catherine Lassez; Jean-Louis Lassez (Fundam. Informaticae, 1991)

Practical Issues on the Projection of Polyhedral Sets. - Tien Huynh; Catherine Lassez; Jean-Louis Lassez (Ann. Math. Artif. Intell., 1992)

On Fourier's Algorithm for Linear Arithmetic Constraints. - Jean-Louis Lassez; Michael J. Maher (J. Autom. Reason., 1992)

A Canonical Form for Generalized Linear Constraints. - Jean-Louis Lassez; Ken McAloon (J. Symb. Comput., 1992)

Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. - Alexander Brodsky 001; Catherine Lassez; Jean-Louis Lassez; Michael J. Maher (J. Autom. Reason., 1999)

Qualitative Theorem Proving in Linear Constraints. - Vijay Chandru; Jean-Louis Lassez (Verification: Theory and Practice, 2003)

Similarity Based Classification. - Axel E. Bernal; Karen Hospevian; Tayfun Karadeniz; Jean-Louis Lassez (IDA, 2003)

Symbolic Stochastic Systems. - Kumar Jeev; Jean-Louis Lassez (MSV/AMCS, 2004)

Developing a pyramid structure for managing web-centric documents. - Tayfun Karadeniz; Jean-Louis Lassez; Stephen J. Sheel (SIGDOC, 2005)

Zoomed Clusters. - Jean-Louis Lassez; Tayfun Karadeniz; Srinivas Mukkamala (ICONIP (2), 2006)

Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame. - Jean-Louis Lassez; Ryan A. Rossi; Axel E. Bernal (AINA Workshops (1), 2007)

Le théorème de Perron Frobenius est-il vraiment nécessaire? - Jean-Louis Lassez (BDA, 2007)

Client-side dynamic metadata in web 2.0. - John W. Stamey; Jean-Louis Lassez; Daniel Boorn; Ryan A. Rossi (SIGDOC, 2007)

Ranking Links on the Web: Search and Surf Engines. - Jean-Louis Lassez; Ryan A. Rossi; Kumar Jeev (IEA/AIE, 2008)

Signature based intrusion detection using latent semantic analysis. - Jean-Louis Lassez; Ryan A. Rossi; Stephen J. Sheel; Srinivas Mukkamala (IJCNN, 2008)

Solving Systems of Linear Inequalities. - Jean-Louis Lassez (CoRR, 2019)