Aviad Rubinstein

activity

20122024

most citedHitting the High Notes: Subset Selection for Maximizing Expected Order Statistics

8 citations · 39 across the 16 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2016★ 4 cited

Detecting communities is hard, and counting them is even harder

Aviad Rubinstein

We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph $G = (V, E)$ , a subset $S \subseteq V$ is an $(α, β)$ -…

cs.CC2014★ 7 cited

On Simplex Pivoting Rules and Complexity Theory

Ilan Adler, Christos Papadimitriou, Aviad Rubinstein

We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a…