| 2008 | ||
|---|---|---|
| c36 | Jean-Louis Lassez, Ryan A. Rossi, Kumar Jeev: Ranking Links on the Web: Search and Surf Engines. IEA/AIE 2008: 199-208 | |
| c35 | Jean-Louis Lassez, Ryan A. Rossi, Stephen J. Sheel, Srinivas Mukkamala: Signature based intrusion detection using latent semantic analysis. IJCNN 2008: 1068-1074 | |
| 2007 | ||
| c34 | Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal: Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame. AINA Workshops (1) 2007: 745-751 | |
| c33 | ||
| c32 | John W. Stamey, Jean-Louis Lassez, Daniel Boorn, Ryan A. Rossi: Client-side dynamic metadata in web 2.0. SIGDOC 2007: 155-161 | |
| 2006 | ||
| c31 | ||
| 2005 | ||
| c30 | Tayfun Karadeniz, Jean-Louis Lassez, Stephen J. Sheel: Developing a pyramid structure for managing web-centric documents. SIGDOC 2005: 80-84 | |
| 2004 | ||
| c29 | ||
| 2003 | ||
| c28 | Vijay Chandru, Jean-Louis Lassez: Qualitative Theorem Proving in Linear Constraints. Verification: Theory and Practice 2003: 395-406 | |
| c27 | Axel E. Bernal, Karen Hospevian, Tayfun Karadeniz, Jean-Louis Lassez: Similarity Based Classification. IDA 2003: 187-197 | |
| 1999 | ||
| j18 | Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher: Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. J. Autom. Reasoning 23(1): 83-104 (1999) | |
| 1995 | ||
| c26 | Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher: Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. PODS 1995: 54-65 | |
| 1992 | ||
| j17 | Tien Huynh, Catherine Lassez, Jean-Louis Lassez: Practical Issues on the Projection of Polyhedral Sets. Ann. Math. Artif. Intell. 6(4): 295-315 (1992) | |
| j16 | Jean-Louis Lassez, Michael J. Maher: On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reasoning 9(3): 373-379 (1992) | |
| j15 | Jean-Louis Lassez, Ken McAloon: A Canonical Form for Generalized Linear Constraints. J. Symb. Comput. 13(1): 1-24 (1992) | |
| 1991 | ||
| j14 | Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez: Practical tools for reasoning about linear constraints. Fundam. Inform. 15(3-4): 357-380 (1991) | |
| c25 | ||
| c24 | Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Elimination of Negation in Term Algebras. MFCS 1991: 1-16 | |
| c23 | ||
| c22 | ||
| c21 | Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. WCLP 1991: 73-87 | |
| 1990 | ||
| j13 | Kim Marriott, Lee Naish, Jean-Louis Lassez: Most Specific Logic Programs. Ann. Math. Artif. Intell. 1: 303-338 (1990) | |
| c20 | ||
| c19 | Jean-Louis Lassez: Parametric queries, linear constraints and variable elimination. DISCO 1990: 164-173 | |
| c18 | Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez: Reasoning About Linear Constraints Using Parametric Queries. FSTTCS 1990: 1-20 | |
| c17 | ||
| c16 | ||
| 1989 | ||
| c15 | Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP 1989: 37-51 | |
| c14 | ||
| 1988 | ||
| p2 | Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Unification Revisited. Foundations of Deductive Databases and Logic Programming. 1988: 587-625 | |
| c13 | Jean-Louis Lassez, Ken McAloon: Applications of a Canonical Form of Gerneralized Linear Constraints. FGCS 1988: 703-710 | |
| c12 | ||
| c11 | ||
| 1987 | ||
| j12 | Jean-Louis Lassez, Kim Marriott: Explicit Representation of Terms Defined by Counter Examples. J. Autom. Reasoning 3(3): 301-317 (1987) | |
| c10 | ||
| c9 | ||
| 1986 | ||
| j11 | Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: Comments on "General Failure of Logic Programs". J. Log. Program. 3(2): 115-118 (1986) | |
| j10 | T. Y. Chen, Jean-Louis Lassez, Graeme S. Port: Maximal Unifiable Subsets and Minimal Nonunifiable Subsets. New Generation Comput. 4(2): 133-152 (1986) | |
| p1 | Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: Logic Programming Language Scheme. Logic Programming: Functions, Relations, and Equations 1986: 441-467 | |
| c8 | Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Unification Revisited. Foundations of Logic and Functional Programming 1986: 67-113 | |
| c7 | Jean-Louis Lassez, Kim Marriott: Explicit Representation of Terms Defined by Counter Examples. FSTTCS 1986: 96-107 | |
| c6 | Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. ICLP 1986: 223-241 | |
| 1985 | ||
| j9 | Jean-Louis Lassez, Michael J. Maher: Optimal Fixedpoints of Logic Programs. Theor. Comput. Sci. 39: 15-25 (1985) | |
| 1984 | ||
| j8 | Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: A Theory of Complete Logic Programs with Equality. J. Log. Program. 1(3): 211-223 (1984) | |
| j7 | Jean-Louis Lassez, Michael J. Maher: Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci. 29: 167-184 (1984) | |
| c5 | Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: A Theory of Complete Logic Programs with Equality. FGCS 1984: 175-184 | |
| c4 | David A. Wolfram, Michael J. Maher, Jean-Louis Lassez: A Unified Treatment of Resolution Strategies for Logic Programs. ICLP 1984: 263-276 | |
| 1983 | ||
| c3 | Jean-Louis Lassez, Michael J. Maher: The Denotational Semantics of Horn Clauses as a Production System. AAAI 1983: 229-231 | |
| c2 | Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd: Completeness of the Negation as Failure Rule. IJCAI 1983: 500-506 | |
| 1982 | ||
| j6 | Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg: Fixed Point Theorems and Semantics: A Folk Tale. Inf. Process. Lett. 14(3): 112-116 (1982) | |
| c1 | ||
| 1981 | ||
| j5 | Jean-Louis Lassez, D. van der Knijff, John Shepherd, Catherine Lassez: A critical examination of software science. Journal of Systems and Software 2(2): 105-112 (1981) | |
| j4 | V. L. Nguyen, Jean-Louis Lassez: A Dual Problem to Least Fixed Points. Theor. Comput. Sci. 16: 211-221 (1981) | |
| 1979 | ||
| j3 | D. van der Knijff, Jean-Louis Lassez: A Clarification of the Comparison Between Some Measures of Software Science. Inf. Process. Lett. 8(5): 241-243 (1979) | |
| 1976 | ||
| j2 | Jean-Louis Lassez: Circular codes and synchronization. International Journal of Parallel Programming 5(2): 201-208 (1976) | |
| 1975 | ||
| j1 | ||
Colors in the list of coauthors
Last update Mon May 20 07:33:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page