11 citations · 29 across the 22 of their papers we have counts for
33 papers
Competitive Random-Order Correlation k-Clustering
Mahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman +2
Correlation clustering has been extensively studied over the last two decades in many different computational models owing to its wide-ranging practical applications. The goal is t…
The Head Complexity of Boolean Functions in Single-Layer Attention
Rajmohan Rajaraman, Ravi Sundaram, Amanuel Tesfaye
What can a single layer of self-attention compute? We study head complexity: the minimum number of attention heads required to compute a function in a one-layer attention-only mode…
One-way Communication Complexity of Minimum Vertex Cover in General Graphs
Mahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman
We study the communication complexity of the Minimum Vertex Cover (MVC) problem on general graphs within the \(k\)-party one-way communication model. Edges of an arbitrary \(n\)-ve…
Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries
Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim
Over the years, there has been extensive work on fully dynamic algorithms for classic graph problems that admit greedy solutions. Examples include vertex coloring, maximal…
Competitive Capacitated Online Recoloring
Rajmohan Rajaraman, Omer Wasim
In this paper, we revisit the online recoloring problem introduced recently by Azar et al. In online recoloring, there is a fixed set of vertices and an initial coloring $c…
Scheduling Splittable Jobs on Configurable Machines
Matthew Casey, Rajmohan Rajaraman, David Stalfa
Motivated by deep neural network applications, we study the problem of scheduling splittable jobs (e.g., neural network inference tasks) on configurable machines (e.g., multi-insta…