default search action
Richard J. Lorentz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j11]Mark H. M. Winands, Richard Lorentz, Matej Guid:
Advances in Computer Games 2017. J. Int. Comput. Games Assoc. 39(3-4): 205-209 (2017) - [j10]Richard Lorentz:
Invader wins eighth Amazons gold medal. J. Int. Comput. Games Assoc. 39(3-4): 228-229 (2017) - [j9]Richard Lorentz:
Wanderer wins Breakthrough tournament. J. Int. Comput. Games Assoc. 39(3-4): 230-232 (2017) - [c10]Richard J. Lorentz, Teofilo Erin Zosa IV:
Machine Learning in the Game of Breakthrough. ACG 2017: 140-150 - 2016
- [j8]Richard Lorentz:
Using evaluation functions in Monte-Carlo Tree Search. Theor. Comput. Sci. 644: 106-113 (2016) - [c9]Andrew Isaac, Richard Lorentz:
Using Partial Tablebases in Breakthrough. Computers and Games 2016: 1-10 - 2015
- [j7]Richard J. Lorentz:
Advances in Computer Games Conference 2015: Report on Day 2. J. Int. Comput. Games Assoc. 38(3): 188-189 (2015) - [c8]Richard Lorentz:
Early Playout Termination in MCTS. ACG 2015: 12-19 - 2013
- [j6]Richard J. Lorentz:
Conference Report Day 3. J. Int. Comput. Games Assoc. 36(4): 235-236 (2013) - [j5]Richard J. Lorentz:
INVADER Wins Amazons Tournament. J. Int. Comput. Games Assoc. 36(4): 238-239 (2013) - [c7]Richard Lorentz, Therese Horey:
Programming Breakthrough. Computers and Games 2013: 49-59 - 2012
- [j4]Richard J. Lorentz:
CASTRO Wins Havannah Tournament. J. Int. Comput. Games Assoc. 35(1): 58 (2012) - 2011
- [j3]Richard J. Lorentz:
Experiments with Monte-Carlo Tree Search in the Game of Havannah. J. Int. Comput. Games Assoc. 34(3): 140-149 (2011) - [c6]Richard J. Lorentz:
An MCTS Program to Play EinStein Würfelt Nicht! ACG 2011: 52-59 - 2010
- [c5]Richard J. Lorentz:
Improving Monte-Carlo Tree Search in Havannah. Computers and Games 2010: 105-115
2000 – 2009
- 2008
- [c4]Richard J. Lorentz:
Amazons Discover Monte-Carlo. Computers and Games 2008: 13-24 - 2004
- [c3]Akop Karapetyan, Richard Lorentz:
Generating an Opening Book for Amazons. Computers and Games 2004: 161-174 - 2002
- [c2]Henry Avetisyan, Richard J. Lorentz:
Selective Search in an Amazons Program. Computers and Games 2002: 123-141 - 2000
- [c1]Richard J. Lorentz:
Creating Difficult Instances of the Post Correspondence Problem. Computers and Games 2000: 214-228
1990 – 1999
- 1994
- [b1]Richard J. Lorentz:
Recursive algorithms. Ablex series in computational science, Ablex Publishing Corporation 1994, ISBN 978-0-89391-913-9, pp. I-XIII, 1-192
1980 – 1989
- 1984
- [j2]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
- [j1]Richard J. Lorentz, David B. Benson:
Deterministic and Nondeterministic Flowchart Interpretations. J. Comput. Syst. Sci. 27(3): 400-433 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: