dblp.uni-trier.dewww.uni-trier.de

Jean-Louis Lassez Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
55EEJean-Louis Lassez, Ryan A. Rossi, Kumar Jeev: Ranking Links on the Web: Search and Surf Engines. IEA/AIE 2008: 199-208
54EEJean-Louis Lassez, Ryan A. Rossi, Stephen J. Sheel, Srinivas Mukkamala: Signature based intrusion detection using latent semantic analysis. IJCNN 2008: 1068-1074
2007
53EEJean-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
52 Jean-Louis Lassez: Le théorème de Perron Frobenius est-il vraiment nécessaire? BDA 2007
51EEJohn W. Stamey, Jean-Louis Lassez, Daniel Boorn, Ryan A. Rossi: Client-side dynamic metadata in web 2.0. SIGDOC 2007: 155-161
2006
50EEJean-Louis Lassez, Tayfun Karadeniz, Srinivas Mukkamala: Zoomed Clusters. ICONIP (2) 2006: 824-830
2005
49EETayfun Karadeniz, Jean-Louis Lassez, Stephen J. Sheel: Developing a pyramid structure for managing web-centric documents. SIGDOC 2005: 80-84
2004
48 Kumar Jeev, Jean-Louis Lassez: Symbolic Stochastic Systems. MSV/AMCS 2004: 321-328
2003
47EEAxel E. Bernal, Karen Hospevian, Tayfun Karadeniz, Jean-Louis Lassez: Similarity Based Classification. IDA 2003: 187-197
46EEVijay Chandru, Jean-Louis Lassez: Qualitative Theorem Proving in Linear Constraints. Verification: Theory and Practice 2003: 395-406
1999
45 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
44EEAlexander 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
43 Tien Huynh, Catherine Lassez, Jean-Louis Lassez: Practical Issues on the Projection of Polyhedral Sets. Ann. Math. Artif. Intell. 6(4): 295-315 (1992)
42 Jean-Louis Lassez, Michael J. Maher: On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reasoning 9(3): 373-379 (1992)
41 Jean-Louis Lassez, Ken McAloon: A Canonical Form for Generalized Linear Constraints. J. Symb. Comput. 13(1): 1-24 (1992)
1991
40EEJean-Louis Lassez: From LP to LP: Programming with Constraints. DBPL 1991: 257-283
39EEJean-Louis Lassez, Michael J. Maher, Kim Marriott: Elimination of Negation in Term Algebras. MFCS 1991: 1-16
38 Jean-Louis Lassez: From LP to LP: Programming with Constraints. TACS 1991: 420-446
37 Jean-Louis Lassez, Ken McAloon: A Constraint Sequent Calculus. WCLP 1991: 33-43
36 Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. WCLP 1991: 73-87
35 Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez: Practical tools for reasoning about linear constraints. Fundam. Inform. 15(3-4): 357-380 (1991)
1990
34EETien Huynh, Catherine Lassez, Jean-Louis Lassez: Fourier Algorithm Revisited. ALP 1990: 117-131
33EEJean-Louis Lassez: Parametric queries, linear constraints and variable elimination. DISCO 1990: 164-173
32EETien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez: Reasoning About Linear Constraints Using Parametric Queries. FSTTCS 1990: 1-20
31 Jean-Louis Lassez, Ken McAloon: A Constraint Sequent Calculus LICS 1990: 52-61
30EEJean-Louis Lassez: Querying Constraints. PODS 1990: 288-298
29 Kim Marriott, Lee Naish, Jean-Louis Lassez: Most Specific Logic Programs. Ann. Math. Artif. Intell. 1: (1990)
1989
28 Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP 1989: 37-51
27EEJean-Louis Lassez, Ken McAloon: Independence of Negative Constraints. TAPSOFT, Vol.1 1989: 19-27
1988
26 Jean-Louis Lassez, Ken McAloon: Applications of a Canonical Form of Gerneralized Linear Constraints. FGCS 1988: 703-710
25 Kim Marriott, Lee Naish, Jean-Louis Lassez: Most Specific Logic Programs. ICLP/SLP 1988: 909-923
24 Jean-Louis Lassez: From Unification to Constraints. SPLT 1988: 543-
23 Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Unification Revisited Foundations of Deductive Databases and Logic Programming. 1988: 587-625
1987
22EEJoxan Jaffar, Jean-Louis Lassez: From Unification to Constraints. LP 1987: 1-18
21 Joxan Jaffar, Jean-Louis Lassez: Constraint Logic Programming. POPL 1987: 111-119
20 Jean-Louis Lassez, Kim Marriott: Explicit Representation of Terms Defined by Counter Examples. J. Autom. Reasoning 3(3): 301-317 (1987)
1986
19EEJean-Louis Lassez, Kim Marriott: Explicit Representation of Terms Defined by Counter Examples. FSTTCS 1986: 96-107
18 Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Unification Revisited. Foundations of Logic and Functional Programming 1986: 67-113
17 Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. ICLP 1986: 223-241
16 Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: Logic Programming Language Scheme. Logic Programming: Functions, Relations, and Equations 1986: 441-467
15 Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: Comments on "General Failure of Logic Programs". J. Log. Program. 3(2): 115-118 (1986)
14 T. Y. Chen, Jean-Louis Lassez, Graeme S. Port: Maximal Unifiable Subsets and Minimal Nonunifiable Subsets. New Generation Comput. 4(2): 133-152 (1986)
1985
13 Jean-Louis Lassez, Michael J. Maher: Optimal Fixedpoints of Logic Programs. Theor. Comput. Sci. 39: 15-25 (1985)
1984
12 Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: A Theory of Complete Logic Programs with Equality. FGCS 1984: 175-184
11 David A. Wolfram, Michael J. Maher, Jean-Louis Lassez: A Unified Treatment of Resolution Strategies for Logic Programs. ICLP 1984: 263-276
10 Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher: A Theory of Complete Logic Programs with Equality. J. Log. Program. 1(3): 211-223 (1984)
9 Jean-Louis Lassez, Michael J. Maher: Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci. 29: 167-184 (1984)
1983
8 Jean-Louis Lassez, Michael J. Maher: The Denotational Semantics of Horn Clauses as a Production System. AAAI 1983: 229-231
7 Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd: Completeness of the Negation as Failure Rule. IJCAI 1983: 500-506
1982
6 Joxan Jaffar, Jean-Louis Lassez: Reasoning about Array Segments. ECAI 1982: 62-66
5 Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg: Fixed Point Theorems and Semantics: A Folk Tale. Inf. Process. Lett. 14(3): 112-116 (1982)
1981
4EEJean-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)
3 V. L. Nguyen, Jean-Louis Lassez: A Dual Problem to Least Fixed Points. Theor. Comput. Sci. 16: 211-221 (1981)
1979
2 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)
1975
1EEJean-Louis Lassez: Prefix codes, trees and automata. Inf. Sci. 8(2): 155-171 (1975)

Coauthor Index

1Axel E. Bernal [47] [53]
2Daniel Boorn [51]
3Alexander Brodsky [44] [45]
4Vijay Chandru (Vijaya Chandru) [46]
5T. Y. Chen [14]
6Karen Hospevian [47]
7Tien Huynh [28] [32] [34] [35] [36] [43]
8Joxan Jaffar [6] [7] [10] [12] [15] [16] [17] [21] [22]
9Kumar Jeev [48] [55]
10Leo Joskowicz [32] [35]
11Tayfun Karadeniz [47] [49] [50]
12D. van der Knijff [2] [4]
13Catherine Lassez [4] [32] [34] [35] [43] [44] [45]
14John W. Lloyd [7]
15Michael J. Maher [8] [9] [10] [11] [12] [13] [15] [16] [17] [18] [23] [39] [42] [44] [45]
16Kim Marriott [18] [19] [20] [23] [25] [29] [39]
17Ken McAloon [26] [27] [28] [31] [36] [37] [41]
18Srinivas Mukkamala [50] [54]
19Lee Naish [25] [29]
20V. L. Nguyen [3] [5]
21Graeme S. Port [14]
22Ryan A. Rossi [51] [53] [54] [55]
23Stephen J. Sheel [49] [54]
24John Shepherd [4]
25Liz Sonenberg [5]
26John W. Stamey [51]
27David A. Wolfram [11]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)