8 citations · 17 across the 9 of their papers we have counts for
4 papers · 1 filter
Stable and Online Algorithms for Random Matrix Discrepancy
Eren C. Kızıldağ, Shuangping Li
We study the average-case matrix discrepancy problem: given independent normalized Gaussian orthogonal ensemble matrices and a fixed margin , find…
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
Abhishek Dhawan, Nhi U. Dinh, Eren C. Kızıldağ +2
We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within e…
Sharp Online Hardness for Large Balanced Independent Sets
Abhishek Dhawan, Eren C. Kızıldağ, Neeladri Maitra
We study the algorithmic problem of finding large -balanced independent sets in dense random bipartite graphs; an independent set is -balanced if a proportion of its vert…
Optimal Hardness of Online Algorithms for Large Independent Sets
David Gamarnik, Eren C. Kızıldağ, Lutz Warnke
We study the algorithmic problem of finding a large independent set in the Erd{ö}s-Rényi random graph . For constant and , the largest independent set has si…