The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
—We consider the application of switch-and-stay transmit diversity (SSTD) to a three-node cooperative diversity system with decode-and-forward relaying. The basic idea of SSTD ge...
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...