MohammadTaghi Hajiaghayi

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 138

Top Venues

Publications

Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
Power of Posted-price Mechanisms for Prophet Inequalities. SODA (2024)
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi
Prize-Collecting Steiner Tree: A 1.79 Approximation. CoRR (2024)
MohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei, Suho Shin
Ad Auctions for LLMs via Retrieval Augmented Generation. CoRR (2024)
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi
2-Approximation for Prize-Collecting Steiner Forest. SODA (2024)
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi
Prize-Collecting Steiner Tree: A 1.79 Approximation. STOC (2024)
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
A Dynamic Algorithm for Weighted Submodular Cover Problem. CoRR (2024)
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski, Max Springer
Space. CoRR (2024)
Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA (2024)
Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. AAAI (2024)
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
Dynamic Algorithms for Matroid Submodular Maximization. SODA (2024)
Simina Brânzei, MohammadTaghi Hajiaghayi, Reed Phillips, Suho Shin, Kun Wang
Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting. CoRR (2024)
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
Dynamic Non-monotone Submodular Maximization. NeurIPS (2023)
Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70 (5) (2023)
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Max Springer
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. NeurIPS (2023)
MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski
Fault-Tolerant Consensus in Quantum Networks. CoRR (2023)
Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC (2023)
Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin
Location-Sensitive String Problems in MPC. SPAA (2023)
José R. Correa, Andrés Cristi, Paul Duetting, MohammadTaghi Hajiaghayi, Jan Olkowski, Kevin Schewior
Trading Prophets. EC (2023)
Soheil Feizi, MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin
Online Advertisements with LLMs: Opportunities and Challenges. CoRR (2023)
MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski
Brief Announcement: Improved Consensus in Quantum Networks. PODC (2023)
Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering. NeurIPS (2023)
Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi
Fair Polylog-Approximate Low-Cost Hierarchical Clustering. CoRR (2023)
Jacob Gilbert, MohammadTaghi Hajiaghayi
Brief Announcement: Regular and Dyck Languages in MPC. SPAA (2023)
AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong
Massively Parallel Tree Embeddings for High Dimensional Spaces. SPAA (2023)
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins
Bandit Social Learning under Myopic Behavior. NeurIPS (2023)
MohammadTaghi Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei, Suho Shin
Regret Analysis of Repeated Delegated Choice. CoRR (2023)
Suho Shin, Keivan Rezaei, MohammadTaghi Hajiaghayi
Delegating to Multiple Agents. EC (2023)
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
Dynamic Algorithms for Matroid Submodular Maximization. CoRR (2023)
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Max Springer
Optimal Sparse Recovery with Decision Stumps. CoRR (2023)
MohammadTaghi Hajiaghayi, Max Springer
Analysis of a Learning Based Algorithm for Budget Pacing. AAMAS (2023)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin
Fast and Simple Solutions of Blotto Games. Oper. Res. 71 (2) (2023)
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins
Bandit Social Learning: Exploration under Myopic Behavior. CoRR (2023)
Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. ICML (2023)
MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. CoRR (2023)
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi
2-Approximation for Prize-Collecting Steiner Forest. CoRR (2023)
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. CoRR (2023)
MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin
Multi-agent Delegated Search. CoRR (2023)
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
Dynamic Non-monotone Submodular Maximization. CoRR (2023)
Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR (2023)
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. ICML (2023)
Seyed A. Esmaeili, MohammadTaghi Hajiaghayi, Suho Shin
Replication-proof Bandit Mechanism Design. CoRR (2023)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier. SIAM J. Comput. 51 (4) (2022)
MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski
Improved Communication Complexity of Fault-Tolerant Consensus. CoRR (2022)
MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh
Adaptive Massively Parallel Algorithms for Cut Problems. CoRR (2022)
MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Debmalya Panigrahi, Max Springer
Online Algorithms for the Santa Claus Problem. CoRR (2022)
Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi
Generalized Stochastic Matching. AAAI (2022)
Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS (2022)
MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su
Adaptive Massively Parallel Constant-Round Tree Contraction. ITCS (2022)
Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR (2022)
Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani
Online Algorithms for the Santa Claus Problem. NeurIPS (2022)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi
Differentially Private Densest Subgraph. AISTATS (2022)
Marina Knittel, John P. Dickerson, MohammadTaghi Hajiaghayi
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. CoRR (2022)
Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi
Generalized Stochastic Matching. CoRR (2022)
MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh
Adaptive Massively Parallel Algorithms for Cut Problems. SPAA (2022)
MohammadTaghi Hajiaghayi, Max Springer
Analysis of a Learning Based Algorithm for Budget Pacing. CoRR (2022)
MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su
Adaptive Massively Parallel Constant-round Tree Contraction. CoRR (2021)
MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun
String Matching with Wildcards in the Massively Parallel Computation Model. SPAA (2021)
Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. ICALP (2021)
MohammadTaghi Hajiaghayi, Marina Knittel
Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees. CoRR (2021)
Fotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. AAAI (2021)
Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. J. ACM 68 (3) (2021)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi
Differentially Private Densest Subgraph. CoRR (2021)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR (2020)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR (2020)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
Stochastic matching with few queries: (1-ε) approximation. STOC (2020)
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. AISTATS (2020)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. CoRR (2020)
MohammadTaghi Hajiaghayi, Marina Knittel
Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees. AAMAS (2020)
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814 (2020)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR (2020)
David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68 (3) (2020)
Behzad Ghazanfari, Fatemeh Afghah, MohammadTaghi Hajiaghayi
Inverse Feature Learning: Feature learning based on Representation Learning of Error. CoRR (2020)
MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin, Cliff Stein
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond. CoRR (2019)
Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani
Stochastic Matching with Few Queries: New Algorithms and Tools. SODA (2019)
Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin
Computing Stackelberg Equilibria of Large General-Sum Games. SAGT (2019)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi
Approximate Maximum Matching in Random Streams. CoRR (2019)
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
Online Pandora's Boxes and Bandits. CoRR (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR (2019)
Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin
Computing Stackelberg Equilibria of Large General-Sum Games. CoRR (2019)
MohammadAmin Ghiasi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, Hadi Yami
On the Efficiency and Equilibria of Rich Ads. IJCAI (2019)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
Approximating LCS in Linear Time: Beating the √n Barrier. SODA (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS (2019)
AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. Math. Oper. Res. 44 (4) (2019)
MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. SODA (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA (2019)
Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
Exponentially Faster Massively Parallel Maximal Matching. CoRR (2019)
MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun
Massively Parallel Algorithms for String Matching with Wildcards. CoRR (2019)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin
Optimal Strategies of Blotto Games: Beyond Convexity. CoRR (2019)
Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani
Stochastic Matching on Uniformly Sparse Graphs. SAGT (2019)
Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC (2019)
Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin
approximation of tree edit distance in quadratic time. STOC (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC (2019)
Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR (2019)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi
Lower bounds for external memory integer sorting via network coding. STOC (2019)
Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
Exponentially Faster Massively Parallel Maximal Matching. FOCS (2019)
MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. SODA (2019)
MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP (2018)
Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani
Stochastic Matching with Few Queries: New Algorithms and Tools. CoRR (2018)
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14 (4) (2018)
Alireza Farhadi, MohammadTaghi Hajiaghayi
On the Complexity of Chore Division. IJCAI (2018)

MohammadTaghi Hajiaghayi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

MohammadTaghi Hajiaghayi