O. Svensson

activity

20232025

most citedCould ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants

36 citations · 36 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

Nearly Tight Sample Complexity for Matroid Online Contention Resolution

Moran Feldman, Ola Svensson, Rico Zenklusen

Due to their numerous applications, in particular in Mechanism Design, Prophet Inequalities have experienced a surge of interest. They describe competitive ratios for basic stoppin…

cs.DS2023

An Analysis of $D^{α}$ seeding for $k$ -means

Etienne Bamas, Sai Ganesh Nagarajan, Ola Svensson

One of the most popular clustering algorithms is the celebrated $D^{α}$ seeding algorithm (also know as $k$ -means++ when $α = 2$ ) by Arthur and Vassilvitskii (2007), who showed that it…

Nearly Tight Sample Complexity for Matroid Online Contention Resolution

An Analysis of Dα seeding for k-means

An Analysis of $D^{α}$ seeding for $k$ -means