1 citations · 1 across the 10 of their papers we have counts for
3 papers · 1 filter
Optimal Algorithms for Free Order Multiple-Choice Secretary
Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta +1
Suppose we are given integer and boxes labeled by an adversary, each containing a number chosen from an unknown distribution. We have to choose an orde…
Adaptive Massively Parallel Algorithms for Cut Problems
MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski +1
We study the Weighted Min Cut problem in the Adaptive Massively Parallel Computation (AMPC) model. In 2019, Behnezhad et al. [3] introduced the AMPC model as an extension of the Ma…
Improved Communication Complexity of Fault-Tolerant Consensus
MohammadTaghi HajiAghayi, Dariusz R. Kowalski, Jan Olkowski
Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the…