Vahab Mirrokni

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

2017 · arXiv (Cornell University)

As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets. For massive inputs, several …

ATLAS: Learning to Optimally Memorize the Context at Test Time

2025 · arXiv (Cornell University)

Transformers have been established as the most popular backbones in sequence modeling, mainly due to their effectiveness in in-context retrieval tasks and the ability to learn at scale. Their quadratic memory and time complexity, however, …