2 citations · 7 across the 16 of their papers we have counts for
3 papers · 1 filter
Entrywise Approximate Laplacian Solving
Jingbang Chen, Mehrdad Ghadiri, Hoai-An Nguyen +2
We study the escape probability problem in random walks over graphs. Given vertices, and , the problem asks for the probability that a random walk starting at will hi…
Improving the Bit Complexity of Communication for Distributed Convex Optimization
Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan +3
We consider the communication complexity of some fundamental convex optimization problems in the point-to-point (coordinator) and blackboard communication models. We strengthen kno…
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
Emile Anand, Jan van den Brand, Mehrdad Ghadiri +1
Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression w…