We are currently receiving an exceptionally high volume of support and data correction requests from the community. While we are grateful and happy to process all incoming emails, please assume that it will currently take us at least 8 weeks, if not more, to read and address your request. Most importantly, please refrain from sending your request multiple times. This will not speed up the process and will only complicate and extend the time required to address your issue. Thank you for your understanding.

default search action

combined dblp search
author search
venue search
publication search

ask others

"Best-First Search for Bounded-Depth Trees."

Kevin Rose, Ethan Burns, Wheeler Ruml (2011)

> Home

Details and statistics

DOI: 10.1609/SOCS.V2I1.18206

access: open

type: Conference or Workshop Paper

metadata version: 2023-12-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/socs/RoseBR11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socs/RoseBR11
Kevin Rose, Ethan Burns, Wheeler Ruml:
Best-First Search for Bounded-Depth Trees. SOCS 2011: 134-141

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.

last updated on 2023-12-18 16:58 CET 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, funded, and maintained by:

Schloss Dagstuhl - Leibniz Center for Informatics

Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.