3 citations · 4 across the 3 of their papers we have counts for
6 papers
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization
Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler +2
This paper presents significantly improved deterministic algorithms for some of the key problems in the area of distributed graph algorithms, including network decomposition, hitti…
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
We describe a simple deterministic round distributed algorithm for approximation of minimum weighted dominating set on graph…
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates
Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari +4
This paper presents efficient distributed algorithms for a number of fundamental problems in the area of graph sparsification: We provide the first deterministic distributed algori…
On the VC-dimension of half-spaces with respect to convex sets
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow +1
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that f…
On Statistical Learning of Simplices: Unmixing Problem Revisited
Amir Najafi, Saeed Ilchi, Amir H. Saberi +3
We study the sample complexity of learning a high-dimensional simplex from a set of points uniformly sampled from its interior. Learning of simplices is a long studied problem in c…
On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs
M. Abdolmaleki, J. P. Hutchinson, S. Gh. Ilchi +2
A graph is called uniquely k-list colorable (ULC) if there exists a list of colors on its vertices, say , each of size , such that…