![]() | ![]() |
| 2010 | ||
|---|---|---|
| 7 | Richard J. Lorentz: Improving Monte-Carlo Tree Search in Havannah. Computers and Games 2010: 105-115 | |
| 2008 | ||
| 6 | Richard J. Lorentz: Amazons Discover Monte-Carlo. Computers and Games 2008: 13-24 | |
| 2002 | ||
| 5 | Henry Avetisyan, Richard J. Lorentz: Selective Search in an Amazons Program. Computers and Games 2002: 123-141 | |
| 2000 | ||
| 4 | Richard J. Lorentz: Creating Difficult Instances of the Post Correspondence Problem. Computers and Games 2000: 214-228 | |
| 1994 | ||
| 3 | Richard J. Lorentz: Recursive algorithms. Ablex Publishing Corporation 1994: I-XIII, 1-192 | |
| 1984 | ||
| 2 | Michael G. Main, Richard J. Lorentz: An O(n log n) Algorithm for Finding All Repetitions in a String. J. Algorithms 5(3): 422-432 (1984) | |
| 1983 | ||
| 1 | Richard J. Lorentz, David B. Benson: Deterministic and Nondeterministic Flowchart Interpretations. J. Comput. Syst. Sci. 27(3): 400-433 (1983) | |
| 1 | Henry Avetisyan | [5] |
| 2 | David B. Benson | [1] |
| 3 | Michael G. Main | [2] |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page