Humanity has long enjoyed making lists. All children delight in their new-found ability to
count 1, 2, 3, etc., and it is a profound revelation that this process can be carried out …

1. Introduction Consider a graph on the set of triangulations of a convex polygon with n
sides, wherein two triangulations are considered adjacent if (and only if) one can be …

Generating random binary trees - A survey Page 1 INFORMATION SCIENCES • r6~TiONa L
jOURNAl. ELSEVIER Information Sciences 115 (1999) 123 136 Generating random binary …

In this paper we extend a technique introduced in [14] for dynamic matrix functions. We
present dynamic algorithms for computing matrix determinant and matrix adjoint over …

Let Tn denote the set of triangulations of a convex polygon K with n sides. We study the
random walk on Tn whose transitions are flips of one of the n-3 internal diagonals of the …

We revisit tree compression with top trees (Bille et al.[2]), and present several improvements
to the compressor and its analysis. By significantly reducing the amount of information stored …

Trees are useful entities allowing to model data structures and hierarchical relationships in
networked decision systems ubiquitously. An ordered tree is a rooted tree where the order of …

An O (n3) algorithm is described to count triangulations of a simple polygon with n vertices.
This algorithm is used to construct an O (n4) algorithm to generate triangulations of a simple …

Let T n denote the set of triangulations of a convex polygon K with n sides. We study
functions that measure very natural``geometric''features of a triangulation τ∈ T n, for …

Recent advances in Automated Theorem Proving have shown the effectiveness of
leveraging a (large) language model that generates tactics (ie proof steps) to search through …