The newly founded Algorithms & Complexity research group is dedicated to advancing theoretical computer science by exploring fundamental problems in algorithms, computational complexity, and related areas. The group’s research spans a broad spectrum, including algorithmic game theory, resource allocation, sublinear algorithms, data streaming, low-distortion metric embeddings, distributed algorithms, and computational learning theory. By leveraging mathematical and algorithmic insights, the group addresses emerging challenges in big data analysis, optimization, and data-driven decision-making. Their focus includes both foundational research and real-world applications across various domains.