References

1

R.E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Art. Intell. 27 (1985), 97-109.

2

V. Kumar and V. N. Rao. Scalable parallel formulations of depth-first search. In: Kumar, Gopalakrishnan, Kanal (eds.), Parallel Algorithms for Machine Intelligence and Vision, Springer-Verlag (1990), 1-41.

3

A. Reinefeld and V. Schnecke. AIDA* - Asynchronous Parallel IDA*. Procs. 10 Canadian Conf. on Art. Intell. AI'94, (May 1994), Banff, Canada, Morgan Kaufman, 295-302.

4

A. Reinefeld and V. Schnecke. Work-load balancing in highly parallel depth-first search. Procs. Scalable High Perf. Comp. Conf. SHPCC'94, Knoxville, Te, 773-780.