default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArie de Bruin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i5]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
A Minimax Algorithm Better Than Alpha-beta?: No and Yes. CoRR abs/1702.03401 (2017)- 2015
- [i4]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First and Depth-First Minimax Search in Practice. CoRR abs/1505.01603 (2015) - 2014
- [i3]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
A New Paradigm for Minimax Search. CoRR abs/1404.1515 (2014) - [i2]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
SSS* = Alpha-Beta + TT. CoRR abs/1404.1517 (2014) - [i1]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Nearly Optimal Minimax Tree Search? CoRR abs/1404.1518 (2014)
2000 – 2009
- 2009
- [j12]Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck
:
A survey on distributed simulation in industry. J. Simulation 3(1): 3-16 (2009) - 2008
- [c21]Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck:
Distributed simulation in industry - a survey Part 3 - the HLA standard in industry. WSC 2008: 1094-1102 - 2006
- [c20]Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck:
Distributed simulation in industry - a survey: part 1 - the COTS vendors. WSC 2006: 1053-1060 - [c19]Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck:
Distributed simulation in industry - a survey: part 2 - experts on distributed simulation. WSC 2006: 1061-1068 - 2003
- [j11]Arie de Bruin, Gerard A. P. Kindervater, Tjark Vredeveld, Albert P. M. Wagelmans:
Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents. Constraints An Int. J. 8(2): 209-218 (2003) - 2001
- [j10]Wim Pijls, Arie de Bruin:
Game tree algorithms and solution trees. Theor. Comput. Sci. 252(1-2): 197-215 (2001)
1990 – 1999
- 1998
- [j9]Arie de Bruin, Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks are Deterministic. Theor. Comput. Sci. 195(1): 3-32 (1998) - [c18]Wim Pijls, Arie de Bruin:
Game Tree Algorithms and Solution Trees. Computers and Games 1998: 195-204 - [c17]Mark Polman, Maarten van Steen, Arie de Bruin:
A Structured Design Technique for Distributed Programs. COMPSAC 1998: 308-315 - 1997
- [c16]Mark Polman, Maarten van Steen, Arie de Bruin:
Formalizing a Design Technique for Distributed Programs. PDSE 1997: 150-161 - [c15]Shan-Hwei Nienhuys-Cheng, Arie de Bruin:
Kahn's Fixed-Point Characterization for Linear Dynamic Networks. SOFSEM 1997: 513-522 - [c14]Wim Pijls, Arie de Bruin:
A Theory of Game Trees, Based on Solution Trees. SOFSEM 1997: 539-546 - 1996
- [j8]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First Fixed-Depth Minimax Algorithms. Artif. Intell. 87(1-2): 255-293 (1996) - [j7]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First Fixed-Depth Minimax Algorithms. J. Int. Comput. Games Assoc. 19(4): 247 (1996) - [c13]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Exploiting Graph Properties of Game Trees. AAAI/IAAI, Vol. 1 1996: 234-239 - [c12]Arie de Bruin, Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks Are Deterministic. MFCS 1996: 242-254 - [c11]Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens:
Towards an abstract parallel branch and bound machine. Solving Combinatorial Optimization Problems in Parallel 1996: 145-170 - [c10]Arie de Bruin, Wim Pijls:
Trends in Game Tree Search. SOFSEM 1996: 255-274 - 1995
- [c9]Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin:
Best-First Fixed-Depth Game-Tree Search in Practice. IJCAI 1995: 273-281 - [c8]Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens:
Asynchronous Parallel Branch and Bound and Anomalies. IRREGULAR 1995: 363-377 - [c7]Roel van der Goot, Arie de Bruin:
Syntax and Semantics of Procol. MFCS 1995: 509-518 - 1994
- [j6]Arie de Bruin, Wim Pijls, Aske Plaat:
Solution Trees as a Basis for Game-Tree Search. J. Int. Comput. Games Assoc. 17(4): 207-219 (1994) - 1993
- [j5]Wim Pijls, Arie de Bruin:
SSS*-Like Algorithms in Constrained Memory. J. Int. Comput. Games Assoc. 16(1): 18-30 (1993) - [c6]J. W. de Bakker, Franck van Breugel, Arie de Bruin:
Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands. MFCS 1993: 252-261 - 1992
- [c5]Wim Pijls, Arie de Bruin:
Searching Informed Game Trees. ISAAC 1992: 332-341 - 1990
- [c4]Arie de Bruin, Erik P. de Vink:
Retractions in Comparing Prolog Semantics (Extended Abstract). MFCS 1990: 180-186 - [c3]Wim Pijls, Arie de Bruin:
Another View on the SSS* Algorithm. SIGAL International Symposium on Algorithms 1990: 211-220
1980 – 1989
- 1989
- [c2]Arie de Bruin, Erik P. de Vink:
Continuation Semantics for PROLOG with Cut. TAPSOFT, Vol.1 1989: 178-192 - 1988
- [j4]Arie de Bruin, Alexander H. G. Rinnooy Kan, Harry W. J. M. Trienekens:
A simulation tool for the performance evaluation of parallel branch and bound algorithms. Math. Program. 42(1-3): 245-271 (1988) - 1985
- [j3]Arie de Bruin, A. P. Wim Böhm:
The Denotational Semantics of Dynamic Networks of Processes. ACM Trans. Program. Lang. Syst. 7(4): 656-679 (1985) - 1984
- [j2]Arie de Bruin:
On the Existence of Cook Semantics. SIAM J. Comput. 13(1): 1-13 (1984) - 1983
- [c1]Job Zwiers, Arie de Bruin, Willem P. de Roever:
A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract). Logic of Programs 1983: 513-527 - 1981
- [j1]Arie de Bruin:
Goto Statements: Semantics and Deduction Systems. Acta Informatica 15: 385-424 (1981) - 1980
- [b1]Jacobus W. de Bakker, Arie de Bruin, Jeffrey Zucker:
Mathematical theory of program correctness. Prentice-Hall international series in computer science, Prentice Hall 1980, ISBN 978-0-13-562132-5, pp. I-XV, 1-505
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 01:48 CEST 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
