Mathematical theory of program correctness. - Jacobus W. de Bakker; Arie de Bruin; Jeffrey Zucker (Prentice Hall, 1980)

Goto Statements: Semantics and Deduction Systems. - Arie de Bruin (Acta Informatica, 1981)

A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract). - Job Zwiers; Arie de Bruin; Willem P. de Roever (Logic of Programs, 1983)

On the Existence of Cook Semantics. - Arie de Bruin (SIAM J. Comput., 1984)

The Denotational Semantics of Dynamic Networks of Processes. - Arie de Bruin; A. P. Wim Böhm (ACM Trans. Program. Lang. Syst., 1985)

A simulation tool for the performance evaluation of parallel branch and bound algorithms. - Arie de Bruin; Alexander H. G. Rinnooy Kan; Harry W. J. M. Trienekens (Math. Program., 1988)

Continuation Semantics for PROLOG with Cut. - Arie de Bruin; Erik P. de Vink (TAPSOFT, Vol.1, 1989)

Retractions in Comparing Prolog Semantics (Extended Abstract). - Arie de Bruin; Erik P. de Vink (MFCS, 1990)

Another View on the SSS* Algorithm. - Wim Pijls; Arie de Bruin (SIGAL International Symposium on Algorithms, 1990)

Searching Informed Game Trees. - Wim Pijls; Arie de Bruin (ISAAC, 1992)

Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands. - J. W. de Bakker; Franck van Breugel; Arie de Bruin (MFCS, 1993)

SSS*-Like Algorithms in Constrained Memory. - Wim Pijls; Arie de Bruin (J. Int. Comput. Games Assoc., 1993)

Solution Trees as a Basis for Game-Tree Search. - Arie de Bruin; Wim Pijls; Aske Plaat (J. Int. Comput. Games Assoc., 1994)

Best-First Fixed-Depth Game-Tree Search in Practice. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (IJCAI, 1995)

Asynchronous Parallel Branch and Bound and Anomalies. - Arie de Bruin; Gerard A. P. Kindervater; Harry W. J. M. Trienekens (IRREGULAR, 1995)

Syntax and Semantics of Procol. - Roel van der Goot; Arie de Bruin (MFCS, 1995)

Exploiting Graph Properties of Game Trees. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (AAAI/IAAI, Vol. 1, 1996)

Towards an abstract parallel branch and bound machine. - Arie de Bruin; Gerard A. P. Kindervater; Harry W. J. M. Trienekens (Solving Combinatorial Optimization Problems in Parallel, 1996)

Trends in Game Tree Search. - Arie de Bruin; Wim Pijls (SOFSEM, 1996)

Best-First Fixed-Depth Minimax Algorithms. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (Artif. Intell., 1996)

Formalizing a Design Technique for Distributed Programs. - Mark Polman; Maarten van Steen; Arie de Bruin (PDSE, 1997)

Kahn's Fixed-Point Characterization for Linear Dynamic Networks. - Shan-Hwei Nienhuys-Cheng; Arie de Bruin (SOFSEM, 1997)

A Theory of Game Trees, Based on Solution Trees. - Wim Pijls; Arie de Bruin (SOFSEM, 1997)

A Structured Design Technique for Distributed Programs. - Mark Polman; Maarten van Steen; Arie de Bruin (COMPSAC, 1998)

Linear Dynamic Kahn Networks are Deterministic. - Arie de Bruin; Shan-Hwei Nienhuys-Cheng (Theor. Comput. Sci., 1998)

Game tree algorithms and solution trees. - Wim Pijls; Arie de Bruin (Theor. Comput. Sci., 2001)

Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents. - Arie de Bruin; Gerard A. P. Kindervater; Tjark Vredeveld; Albert P. M. Wagelmans (Constraints An Int. J., 2003)

Distributed simulation in industry - a survey: part 1 - the COTS vendors. - Csaba Attila Boer; Arie de Bruin; Alexander Verbraeck (WSC, 2006)

Distributed simulation in industry - a survey: part 2 - experts on distributed simulation. - Csaba Attila Boer; Arie de Bruin; Alexander Verbraeck (WSC, 2006)

Distributed simulation in industry - a survey Part 3 - the HLA standard in industry. - Csaba Attila Boer; Arie de Bruin; Alexander Verbraeck (WSC, 2008)

A survey on distributed simulation in industry. - Csaba Attila Boer; Arie de Bruin; Alexander Verbraeck (J. Simulation, 2009)

A New Paradigm for Minimax Search. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2014)

SSS* = Alpha-Beta + TT. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2014)

Nearly Optimal Minimax Tree Search? - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2014)

Best-First and Depth-First Minimax Search in Practice. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2015)

A Minimax Algorithm Better Than Alpha-beta?: No and Yes. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2017)