We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...