We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
We consider communication over a family of binary-input memoryless output-symmetric channels using lowdensity parity-check codes under message passing decoding. The asymptotic (in ...
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
Vaneet Aggarwal, Amir Bennatan, A. Robert Calderba...