( en | de | ru )

 

Disambiguation of "de Bruin, Arie"

Author of the publication

copydeleteadd this publication to your clipboard
Kahn's Fixed-Point Characterization for Linear Dynamic Networks.

, and . SOFSEM, volume 1338 of Lecture Notes in Computer Science, page 513-522. Springer, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Bruin

Jan Hendrik Bruinier

Arie Nabrings

Arie Hartog

Arie Klerk

 

Other publications of authors with the same name

Best-First and Depth-First Minimax Search in Practice., , , and . CoRR, (2015)Another View on the SSS* Algorithm., and . SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 211-220. Springer, (1990)SSS*-Like Algorithms in Constrained Memory., and . J. Int. Comput. Games Assoc., 16 (1): 18-30 (1993)Towards an abstract parallel branch and bound machine., , and . Solving Combinatorial Optimization Problems in Parallel, volume 1054 of Lecture Notes in Computer Science, page 145-170. Springer, (1996)Best-First Fixed-Depth Minimax Algorithms., , , and . Artif. Intell., 87 (1-2): 255-293 (1996)Formalizing a Design Technique for Distributed Programs., , and . PDSE, page 150-161. IEEE Computer Society, (1997)Distributed simulation in industry - a survey: part 2 - experts on distributed simulation., , and . WSC, page 1061-1068. IEEE Computer Society, (2006)Trends in Game Tree Search., and . SOFSEM, volume 1175 of Lecture Notes in Computer Science, page 255-274. Springer, (1996)A Minimax Algorithm Better Than Alpha-beta?: No and Yes., , , and . CoRR, (2017)A simulation tool for the performance evaluation of parallel branch and bound algorithms., , and . Math. Program., 42 (1-3): 245-271 (1988)