Design and Analysis of Algorithms and Data Structures involves the development of computer algorithms and data organization methods for fundamental, real-world problems. Research in this area focuses on designing solutions that are efficient in their usage of resources such as time and space as well as on exploring computational limits. Of particular interest to the group are search and optimization problems defined over discrete geometric entities (points, lines, polygons, polyhedra, etc.),<br>Computational Logic, Type Theory, Foundations of Mechanized Reasoning involves the investigation of computational and mathematical properties of logical formalisms and algebraic theories that provide the foundations for specification and programming languages. Our work further extends to the use of such formalisms and theories in mechanizing reasoning in mathematics and about software, <br>Security and Privacy is concerned with the behaviors of software and computing systems when under attacks, along with mechanisms to prevent, detect, or mitigate the impact of attacks. Specific systems and areas of investigation include system software, emulators and virtual machines, mobile code, and privacy and integrity of communication content and metadata. Methods involved include formal analysis of source and executable code, dynamic testing and instrumentation of executables, virtualization and fault isolation techniques, cryptographic protocols and security proofs, and machine learning and AI applications to these problems,