Abstract: A transmitter Alice may wish to  reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie.

Abstract: For more than 3 decades now, it is well understood that several desirable security properties of systems can be cast in terms of information flows.

Abstract: An optimization problem is said to be fixed parameter tractable if there is some parameter k independent of the input size n, such that the problem can be solved in O(f(k).n^c) time, where c is a constant, and f is an arbitrary function

Abstract: In this talk, we shall look at logics over words. It is known that first order logic (FO) with an order relation, <, defines exactly the set of all aperiodic regular languages.

Abstract: We consider approximation algorithms for the sparsest cut graph partitioning problem.