1 citations · 2 across the 7 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
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…
cs.DS2025★ 1 cited
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…
math.ST2025
Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements
Eren C. Kızıldağ
In this paper, we investigate the sample complexity of recovering tensors with low symmetric rank from symmetric rank-one measurements. This setting is particularly motivated by th…