Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...