The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
This note provides exact formulæ for the mean and variance of the cost of top-down recursive mergesort. These formulæ improve upon earlier results of Flajolet and Golin. Key wor...
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...