On Thursday, Simon Meierhans—a member of Kyng's team— presented a new almost-linear-time algorithm at the Annual ACM Symposium on Theory of Computing (STOC 2024) in Vancouver.

We propose an ℓ₁-penalized algorithm for fitting high-dimensional generalized linear mixed models (GLMMs). GLMMs can be viewed as an extension of generalized linear models for clustered observations.

In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the ϵ-constraint method to produce a complete set ...

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...

The ETH Zurich researchers have since refined their approach and developed further almost-linear-time algorithms. For example, the first algorithm was still focused on fixed, static networks whose ...