Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . . + rm = c1 + . . . + cn. We consider the set (R, C) of non-negative m
We investigate the end spaces of infinite dual graphs. We show that there exists a natural homeomorphism between the end spaces of a graph and its dual, and that this homeomorphis...
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
We derive area limit laws for the various symmetry classes of staircase polygons on the square lattice, in a uniform ensemble where, for fixed perimeter, each polygon occurs with ...
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...