Richard E. Korf

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Joseph Kelly Barker

> Home > Persons > Richard E. Korf

Publications

2015
[c71]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/BarkerK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/BarkerK15
Joseph Kelly Barker, Richard E. Korf:
Limitations of Front-To-End Bidirectional Heuristic Search. AAAI 2015: 1086-1092
2012
[c65]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/BarkerK12a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/BarkerK12a
Joseph Kelly Barker, Richard E. Korf:
Solving Dots-And-Boxes. AAAI 2012: 414-419
[c64]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/BarkerK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/BarkerK12
Joseph Kelly Barker, Richard E. Korf:
Solving Peg Solitaire with Bidirectional BFIDA. AAAI 2012: 420-426
2011
[c61]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/BarkerK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/BarkerK11
Joseph Kelly Barker, Richard E. Korf:
Solving 4x5 Dots-And-Boxes. AAAI 2011: 1756-1757

a service of

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.