J.-L. Lassez

2.2k total citations · 1 hit paper
11 papers, 1.1k citations indexed

About

J.-L. Lassez is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, J.-L. Lassez has authored 11 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 2 papers in Information Systems. Recurrent topics in J.-L. Lassez's work include Logic, programming, and type systems (6 papers), Logic, Reasoning, and Knowledge (5 papers) and Software Engineering Research (2 papers). J.-L. Lassez is often cited by papers focused on Logic, programming, and type systems (6 papers), Logic, Reasoning, and Knowledge (5 papers) and Software Engineering Research (2 papers). J.-L. Lassez collaborates with scholars based in Australia and United States. J.-L. Lassez's co-authors include Joxan Jaffar, Michael J. Maher, Ea Sonenberg, Kim Marriott and John Shepherd and has published in prestigious journals such as Information Sciences, Theoretical Computer Science and Journal of Systems and Software.

In The Last Decade

J.-L. Lassez

9 papers receiving 873 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Constraint logic programming

1987 834 citations Joxan Jaffar, J.-L. Lassez profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
J.-L. Lassez Australia	7	785	434	428	185	123	11	1.1k
Thom Frühwirth Germany	14	586 0.7×	379 0.9×	177 0.4×	161 0.9×	60 0.5×	69	781
Spiro Michaylov United States	10	382 0.5×	328 0.8×	173 0.4×	99 0.5×	58 0.5×	21	595
Ilkka Niemelä Finland	19	1.6k 2.1×	318 0.7×	543 1.3×	179 1.0×	61 0.5×	74	1.9k
Stephen N. Zilles United States	8	812 1.0×	404 0.9×	270 0.6×	236 1.3×	94 0.8×	13	1.1k
A. N. Habermann United States	12	572 0.7×	486 1.1×	253 0.6×	154 0.8×	50 0.4×	31	1.1k
Alan Snyder United States	9	864 1.1×	501 1.2×	213 0.5×	189 1.0×	72 0.6×	22	1.2k
Enrico Giunchiglia Italy	19	972 1.2×	253 0.6×	325 0.8×	109 0.6×	39 0.3×	71	1.1k
Helmut Simonis Ireland	11	366 0.5×	471 1.1×	193 0.5×	135 0.7×	124 1.0×	40	816
Roberto Sebastiani Italy	18	620 0.8×	181 0.4×	491 1.1×	280 1.5×	34 0.3×	53	896
Lakhdar Saïs France	13	347 0.4×	392 0.9×	250 0.6×	64 0.3×	119 1.0×	58	647

Countries citing papers authored by J.-L. Lassez

Since Specialization

Citations

This map shows the geographic impact of J.-L. Lassez's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by J.-L. Lassez with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J.-L. Lassez more than expected).

Fields of papers citing papers by J.-L. Lassez

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J.-L. Lassez. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by J.-L. Lassez. The network helps show where J.-L. Lassez may publish in the future.

Co-authorship network of co-authors of J.-L. Lassez

This figure shows the co-authorship network connecting the top 25 collaborators of J.-L. Lassez. A scholar is included among the top collaborators of J.-L. Lassez based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with J.-L. Lassez. J.-L. Lassez is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

11 of 11 papers shown

1.

Lassez, J.-L., et al.. (2005). Evaluation of length and level for simple program schemes. se 5. 688–694.

2.

Lassez, J.-L. & Kim Marriott. (1987). Explicit representation of terms defined by counter examples. Journal of Automated Reasoning. 3(3). 45 indexed citations

3.

Jaffar, Joxan & J.-L. Lassez. (1987). Constraint logic programming. 111–119. 834 indexed citations breakdown →

4.

Lassez, J.-L., et al.. (1986). Maximal unifiable subsets and minimal nonunifiable subsets. New Generation Computing. 4(2). 133–152. 9 indexed citations

5.

Lassez, J.-L. & Michael J. Maher. (1985). Optimal fixedpoints of logic programs. Theoretical Computer Science. 39. 15–25. 18 indexed citations

6.

Lassez, J.-L. & Michael J. Maher. (1984). Closures and fairness in the semantics of programming logic. Theoretical Computer Science. 29(1-2). 167–184. 62 indexed citations

7.

Lassez, J.-L. & Michael J. Maher. (1983). The denotational semantics of horn clauses as a production system. National Conference on Artificial Intelligence. 229–231. 5 indexed citations

8.

Lassez, J.-L., et al.. (1982). Fixed point theorems and semantics: a folk tale. Information Processing Letters. 14(3). 112–116. 78 indexed citations

9.

Lassez, J.-L., et al.. (1981). A critical examination of software science. Journal of Systems and Software. 2(2). 105–112. 23 indexed citations

10.

Lassez, J.-L., et al.. (1979). A clarification of the comparison between some measures of software science. Information Processing Letters. 8(5). 241–243. 2 indexed citations

11.

Lassez, J.-L.. (1975). Prefix codes, trees, and automata. Information Sciences. 8(2). 155–171.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact