- Theory of Computation (TOC) Seminars - Algorithms and Complexity Seminars - Cryptography and Information Security (CIS) Seminars - Theory of Distributed Systems (TDS) Seminars - Cryptography and Information Security Reading Group - Algori…
Protein language models (PLMs) have emerged as transformative tools for understanding and interpreting protein sequences, enabling advances in structure prediction, functional annotation, and variant effect assessment directly from sequence…
Algorithms and Complexity Seminars Schedule Wednesday, March 30, 2022: Ewin Tang: Optimal Learning of Quantum Hamiltonians From High-Temperature Gibbs States Wednesday, March 2, 2022: Sepehr Assadi : Deterministic Graph Coloring in the Stre…
Abstract: The design and analysis of algorithms requires appropriate models -- models that capture reality, yet are algorithmically usable; general, yet analyzable. The wireless setting has proved most challenging in this regard. We first e…
This talk is about the role of distributed algorithm theory in the increasingly important wireless network setting. It presents three big ideas refined from my ten years of experience working on this topic. The first idea is that distribute…
The Linear Ordering Principle (LOP) is a total search problem that generalizes the task of finding the minimum element of a given order to settings in which the order need not be total. Building on this, Korten and Pitassi (FOCS 2024) intro…
Optimization problems on random instances frequently appear in statistics and theoretical computer science, and many of them appear to be hard to solve with efficient algorithms. The Linear Ordering Principle (LOP) is a total search problem…