| 1997 | ||
|---|---|---|
| c11 | ||
| 1991 | ||
| j9 | ||
| j8 | Laurent Siklóssy, Eduard Tulp: The Space Reduction Method: A Method to Reduce the Size of Search Spaces. Inf. Process. Lett. 38(4): 187-192 (1991) | |
| 1989 | ||
| c10 | Laurent Siklóssy: After 24 Years in AI: Some Lessons. Artificial Intelligence in Higher Education 1989: 159-167 | |
| 1988 | ||
| c9 | ||
| 1985 | ||
| j7 | Leonardo Lesmo, Pietro Torasso, Laurent Siklóssy: Semantic and pragmatic processing in FIDO: A flexible interface for data-base operations. Inf. Syst. 10(2): 219-238 (1985) | |
| 1982 | ||
| c8 | Laurent Siklóssy, Jean-Louis Laurière: Removing Restrictions in the Relational Data Base Model: An Application of Problem Solving Techniques. AAAI 1982: 310-313 | |
| 1981 | ||
| j6 | Laurent Siklóssy: Efficient Query Evaluation in Relational Data Bases with Missing Values. Inf. Process. Lett. 13(4/5): 160-163 (1981) | |
| 1977 | ||
| j5 | Jack T. Baldwin, Laurent Siklóssy: An Unobtrusive Computer Monitor for Multi-Step Problem Solving. International Journal of Man-Machine Studies 9(3): 349-362 (1977) | |
| c7 | Clive Dawson, Laurent Siklóssy: The Role of Preprocessing in Problem Solving Systems. IJCAI 1977: 465-471 | |
| 1975 | ||
| j4 | Laurent Siklóssy, John W. Roach: Model Verification and Improvement Using DISPROVER. Artif. Intell. 6(1): 41-52 (1975) | |
| c6 | ||
| 1974 | ||
| c5 | Laurent Siklóssy, J. Dreussi: Simulation of executing robots in imperfectly known environments. AFIPS National Computer Conference 1974: 1054 | |
| c4 | Laurent Siklóssy, John W. Roach: Collaborative Problem-Solving Between Optimistic and Pessimistic Problem Solvers. IFIP Congress 1974: 814-817 | |
| 1973 | ||
| j3 | Laurent Siklóssy, A. Rich, Vesko Marinov: Breadth-First Search: Some Surprising Results. Artif. Intell. 4(1): 1-27 (1973) | |
| c3 | Laurent Siklóssy, John W. Roach: Proving the Impossible is Impossible is Possible: Disproofs Based on Hereditary Partitions. IJCAI 1973: 383-387 | |
| c2 | Laurent Siklóssy, J. Dreussi: An Efficient Robot Planner which Generates Its Own Procedures. IJCAI 1973: 423-430 | |
| 1972 | ||
| j2 | Laurent Siklóssy: Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack. Inf. Process. Lett. 1(4): 149-152 (1972) | |
| 1971 | ||
| c1 | ||
| 1970 | ||
| j1 | ||
| 1 | Marc Ayel | |
| 2 | Jack T. Baldwin | |
| 3 | Clive Dawson | |
| 4 | J. Dreussi | |
| 5 | Jean-Louis Laurière | |
| 6 | Leonardo Lesmo | |
| 7 | Vesko Marinov | |
| 8 | A. Rich | |
| 9 | John W. Roach | |
| 10 | D. Sykas | |
| 11 | Pietro Torasso | |
| 12 | Eduard Tulp |
Colors in the list of coauthors
Last update Mon May 20 17:16:38 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page