Let Tn 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 Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
For Dyck paths (nonnegative symmetric) random walks, the location of the first maximum within the first sojourn is studied. Generating functions and explicit resp. asymptotic expre...
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...