0 Abstract. In this paper we derive an implementation of so-called flexible arrays; a flexible array is an array whose size can be changed by adding or removing elements at either end. By representing flexible arrays by so-called Braun trees, we are able to implement all array operations with logarithmic -in the size of the arraytime complexity. Braun trees can be conveniently defined in a recu...

We present two time-e cient state space algorithms for searching minimax trees. Because they are based on SSS* and Dual*, both dominate Alpha-Beta on a node count basis. Moreover, one of them is always faster in searching random trees, even when the leaf node evaluation time is negligible. The fast execution time is attributed to the recursive nature of our algorithms and to their e cient data ...

Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An n-ary Huffman tree is a connected, cycle-lacking graph where each vertex can have either n “children” vertices connecting to it, or 0 children. Vertices with 0 children are called leaves. We let hn(q) represent the total number of n-a...

We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in random trees of logarithmic height. The approach is simple but gives very precise estimates for expected width, central moments of the width, and almost sure convergence. It is widely applicable to random trees of logarithmic height, including...

Limit laws are proven by the contraction method for random vectors of a recursive nature as they arise as parameters of combinatorial structures such as random trees or recursive algorithms, where we use the Zolotarev metric. In comparison to previous applications of this method, a general transfer theorem is derived which allows us to establish a limit law on the basis of the recursive structu...

This paper explores the practical potential for enhancing code reuse in functional languages by leveraging techniques and experiences from object-oriented programming. Since data types in typed functional languages do not support adding new variants, programming techniques derived from the object-oriented Visitor pattern can be readily applied to recursive functions on trees in functional langu...

In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-nding problem. This observation gives us a non-recursive algorithm for nding minimum-cost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler than the previous recursive algorithms.

Limit laws are proven by the contraction method for random vectors of a recursive nature as they arise as parameters of combinatorial structures such as random trees or recursive algorithms, where we use the Zolotarev metric. In comparison to previous applications of this method, a general transfer theorem is derived which allows us to establish a limit law on the basis of the recursive structu...

Limit laws are proven by the contraction method for random vectors of a recursive nature as they arise as parameters of combinatorial structures such as random trees or recursive algorithms, where we use the Zolotarev metric. In comparison to previous applications of this method a general transfer theorem is derived, which allows to establish a limit law on the basis of the recursive structure ...

We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ordered set of possibly infinite labeled trees. The nonstructural ordering on trees is the one introduced by Amadio and Cardelli for subtyping with recursive types. The structural ordering compares only trees with common shape. A ...