MohammadTaghi Hajiaghayi
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Hamed Salehonce
- Hsin-Hao Suonce
- Marina Knittelonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Adaptive Massively Parallel Constant-round Tree Contraction | ITCS 2022 | 2022-01-31 |
Claims a constant-round AMPC algorithm for tree contraction, giving O(1/epsilon^2) rounds on trees with max degree ≤ n^epsilon and O(1/epsilon^3) rounds on… | ||
| Parameterized and Promised Streaming | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Promised streaming assumes a bound K on the solution and gets space F(K)·polylog N instead of poly(N). Concrete results: a matching-based insertion algorithm… | ||
| nothing matches | ||