| 2010 | ||
|---|---|---|
| j6 | Wim Pijls, Henk Post: Note on "A new bidirectional algorithm for shortest paths". European Journal of Operational Research 207(2): 1140-1141 (2010) | |
| 2009 | ||
| j5 | Wim Pijls, Henk Post: A new bidirectional search algorithm with shortened postprocessing. European Journal of Operational Research 198(2): 363-369 (2009) | |
| 2003 | ||
| c10 | ||
| c9 | Walter A. Kosters, Wim Pijls, Viara Popova: Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI. MLDM 2003: 284-292 | |
| 2001 | ||
| j4 | Wim Pijls: Some Properties Related to Mercator Projection. The American Mathematical Monthly 108(6): 537-543 (2001) | |
| j3 | Wim Pijls, Arie de Bruin: Game tree algorithms and solution trees. Theor. Comput. Sci. 252(1-2): 197-215 (2001) | |
| 2000 | ||
| j2 | ||
| c8 | ||
| 1998 | ||
| c7 | Wim Pijls, Arie de Bruin: Game Tree Algorithms and Solution Trees. Computers and Games 1998: 195-204 | |
| 1997 | ||
| c6 | ||
| 1996 | ||
| j1 | Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: Best-First Fixed-Depth Minimax Algorithms. Artif. Intell. 87(1-2): 255-293 (1996) | |
| c5 | Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: Exploiting Graph Properties of Game Trees. AAAI/IAAI, Vol. 1 1996: 234-239 | |
| c4 | ||
| 1995 | ||
| c3 | Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: Best-First Fixed-Depth Game-Tree Search in Practice. IJCAI 1995: 273-281 | |
| 1992 | ||
| c2 | ||
| 1990 | ||
| c1 | Wim Pijls, Arie de Bruin: Another View on the SSS* Algorithm. SIGAL International Symposium on Algorithms 1990: 211-220 | |
| 1 | Arie de Bruin | |
| 2 | Walter A. Kosters | |
| 3 | Aske Plaat | |
| 4 | Viara Popova | |
| 5 | Henk Post | |
| 6 | Rob Potharst | |
| 7 | Jonathan Schaeffer |
Colors in the list of coauthors
Last update Sat May 25 07:59:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page