Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
In this paper we consider a long string of SISO systems which in the limit becomes a scalar infinite spatially invariant system. We compare the LQR control for long-but-finite str...