default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Hajiaghayi
MohammadTaghi Hajiaghayi – Mohammad Taghi Hajiaghayi – محمد تقی حاجی آقائی
Person information
- unicode name: محمد تقی حاجی آقائی
- affiliation: University of Maryland at College Park, Computer Science Department, College Park, MD, USA
- affiliation (PhD 2005): Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, USA
- affiliation (former): AT&T Labs, Florham Park, NJ, USA
- affiliation (former): Carnegie Mellon University, Department of Computer Science, Pittsburgh, PA, USA
- affiliation (former): University of Waterloo, Department of Computer Science, ON, Canada
- affiliation (former): Sharif University of Technology, Department of Computer Engineering, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j102]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. SIAM J. Comput. 53(6): 1641-1662 (2024)- [c211]Mohammad Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei, Suho Shin:
Regret Analysis of Repeated Delegated Choice. AAAI 2024: 9757-9764 - [c210]Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. AAAI 2024: 9901-9908 - [c209]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication. ICALP 2024: 80:1-80:19 - [c208]Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
A Dynamic Algorithm for Weighted Submodular Cover Problem. ICML 2024 - [c207]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski, Max Springer:
Dynamic Metric Embedding into lp Space. ICML 2024 - [c206]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Online Sampling and Decision Making with Low Entropy. IJCAI 2024: 4080-4088 - [c205]Mohammad Hajiaghayi
, Dariusz R. Kowalski, Jan Olkowski:
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? PODC 2024: 321-331 - [c204]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
2-Approximation for Prize-Collecting Steiner Forest. SODA 2024: 669-693 - [c203]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. SODA 2024: 3485-3533 - [c202]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Power of Posted-price Mechanisms for Prophet Inequalities. SODA 2024: 4580-4604 - [c201]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: 293-295 - [c200]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Prize-Collecting Steiner Tree: A 1.79 Approximation. STOC 2024: 1641-1652 - [i113]Simina Brânzei, MohammadTaghi Hajiaghayi, Reed Phillips, Suho Shin, Kun Wang:
Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting. CoRR abs/2402.08547 (2024) - [i112]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Prize-Collecting Steiner Tree: A 1.79 Approximation. CoRR abs/2405.03792 (2024) - [i111]Mohammad Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed? CoRR abs/2405.04762 (2024) - [i110]MohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei, Suho Shin:
Ad Auctions for LLMs via Retrieval Augmented Generation. CoRR abs/2406.09459 (2024) - [i109]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski, Max Springer:
Dynamic Metric Embedding into ℓp Space. CoRR abs/2406.17210 (2024) - [i108]Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
A Dynamic Algorithm for Weighted Submodular Cover Problem. CoRR abs/2407.10003 (2024) - [i107]Ilya Hajiaghayi, MohammadTaghi Hajiaghayi, Gary Peng, Suho Shin:
Gains-from-Trade in Bilateral Trade with a Broker. CoRR abs/2410.17444 (2024) - [i106]MohammadTaghi Hajiaghayi, Shayan Chashm Jahan, Mohammad Sharifi, Suho Shin, Max Springer:
Fairness and Efficiency in Online Class Matching. CoRR abs/2410.19163 (2024) - 2023
- [j101]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Fast and Simple Solutions of Blotto Games. Oper. Res. 71(2): 506-516 (2023) - [j100]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70(5): 34:1-34:18 (2023) - [c199]Kiarash Banihashem, Mohammad Hajiaghayi, Max Springer:
Optimal Sparse Recovery with Decision Stumps. AAAI 2023: 6745-6752 - [c198]MohammadTaghi Hajiaghayi, Max Springer:
Analysis of a Learning Based Algorithm for Budget Pacing. AAMAS 2023: 2709-2711 - [c197]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. ICML 2023: 1660-1691 - [c196]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. ICML 2023: 17218-17242 - [c195]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Non-monotone Submodular Maximization. NeurIPS 2023 - [c194]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins:
Bandit Social Learning under Myopic Behavior. NeurIPS 2023 - [c193]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Max Springer:
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. NeurIPS 2023 - [c192]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering. NeurIPS 2023 - [c191]MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski:
Brief Announcement: Improved Consensus in Quantum Networks. PODC 2023: 286-289 - [c190]José Correa, Andrés Cristi, Paul Duetting, MohammadTaghi Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. EC 2023: 490-510 - [c189]Suho Shin, Keivan Rezaei, MohammadTaghi Hajiaghayi:
Delegating to Multiple Agents. EC 2023: 1081-1126 - [c188]AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong:
Massively Parallel Tree Embeddings for High Dimensional Spaces. SPAA 2023: 77-88 - [c187]Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin:
Location-Sensitive String Problems in MPC. SPAA 2023: 101-111 - [c186]Jacob Gilbert, MohammadTaghi Hajiaghayi:
Brief Announcement: Regular and Dyck Languages in MPC. SPAA 2023: 113-116 - [c185]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - [i105]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR abs/2302.04229 (2023) - [i104]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins:
Bandit Social Learning: Exploration under Myopic Behavior. CoRR abs/2302.07425 (2023) - [i103]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Max Springer:
Optimal Sparse Recovery with Decision Stumps. CoRR abs/2303.04301 (2023) - [i102]MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin:
Delegating to Multiple Agents. CoRR abs/2305.03203 (2023) - [i101]MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Fault-Tolerant Consensus in Quantum Networks. CoRR abs/2305.10618 (2023) - [i100]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. CoRR abs/2305.15192 (2023) - [i99]José Correa, Andrés Cristi, Paul Dütting, Mohammad Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. CoRR abs/2305.15566 (2023) - [i98]MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. CoRR abs/2305.16081 (2023) - [i97]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. CoRR abs/2306.00959 (2023) - [i96]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
2-Approximation for Prize-Collecting Steiner Forest. CoRR abs/2309.05172 (2023) - [i95]MohammadTaghi Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei, Suho Shin:
Regret Analysis of Repeated Delegated Choice. CoRR abs/2310.04884 (2023) - [i94]Kiarash Banihashem, Mohammad Taghi Hajiaghayi, Suho Shin, Max Springer:
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. CoRR abs/2310.19025 (2023) - [i93]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Non-monotone Submodular Maximization. CoRR abs/2311.03685 (2023) - [i92]Soheil Feizi, MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin:
Online Advertisements with LLMs: Opportunities and Challenges. CoRR abs/2311.07601 (2023) - [i91]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair Polylog-Approximate Low-Cost Hierarchical Clustering. CoRR abs/2311.12501 (2023) - [i90]Seyed A. Esmaeili, MohammadTaghi Hajiaghayi, Suho Shin:
Replication-proof Bandit Mechanism Design. CoRR abs/2312.16896 (2023) - 2022
- [j99]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303: 103633 (2022) - [j98]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): 1341-1367 (2022) - [c184]Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi:
Generalized Stochastic Matching. AAAI 2022: 10008-10015 - [c183]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. AISTATS 2022: 11581-11597 - [c182]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS 2022: 686-697 - [c181]Giorgi Kvernadze, Putu Ayu G. Sudyanti, Nishan Subedi, Mohammad Hajiaghayi:
Two is Better Than One: Dual Embeddings for Complementary Product Recommendations. ICKG 2022: 131-140 - [c180]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-Round Tree Contraction. ITCS 2022: 83:1-83:23 - [c179]Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani:
Online Algorithms for the Santa Claus Problem. NeurIPS 2022 - [c178]MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. SPAA 2022: 23-33 - [c177]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Improved communication complexity of fault-tolerant consensus. STOC 2022: 488-501 - [i89]MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Improved Communication Complexity of Fault-Tolerant Consensus. CoRR abs/2203.12912 (2022) - [i88]MohammadTaghi Hajiaghayi, Max Springer:
Analysis of a Learning Based Algorithm for Budget Pacing. CoRR abs/2205.13330 (2022) - [i87]MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. CoRR abs/2205.14101 (2022) - [i86]Marina Knittel, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. CoRR abs/2205.14198 (2022) - [i85]Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi:
Generalized Stochastic Matching. CoRR abs/2205.14717 (2022) - [i84]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Optimal Algorithms for Free Order Multiple-Choice Secretary. CoRR abs/2207.10703 (2022) - [i83]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR abs/2209.07524 (2022) - [i82]MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Debmalya Panigrahi, Max Springer:
Online Algorithms for the Santa Claus Problem. CoRR abs/2210.07333 (2022) - [i81]Giorgi Kvernadze, Putu Ayu G. Sudyanti, Nishan Subedi, Mohammad Hajiaghayi:
Two Is Better Than One: Dual Embeddings for Complementary Product Recommendations. CoRR abs/2211.14982 (2022) - 2021
- [j97]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. J. ACM 68(3): 19:1-19:41 (2021) - [j96]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46(3): 1038-1053 (2021) - [c176]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: 5277-5285 - [c175]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. AAAI 2021: 5355-5362 - [c174]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: 54:1-54:20 - [c173]MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun:
String Matching with Wildcards in the Massively Parallel Computation Model. SPAA 2021: 275-284 - [i80]MohammadTaghi Hajiaghayi, Marina Knittel:
Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees. CoRR abs/2101.04818 (2021) - [i79]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. CoRR abs/2106.00508 (2021) - [i78]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-round Tree Contraction. CoRR abs/2111.01904 (2021) - 2020
- [j95]Behzad Ghazanfari, Fatemeh Afghah, Mohammad Taghi Hajiaghayi:
Inverse Feature Learning: Feature Learning Based on Representation Learning of Error. IEEE Access 8: 132937-132949 (2020) - [j94]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. Commun. ACM 63(10): 97-105 (2020) - [j93]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): 896-926 (2020) - [j92]Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx:
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. 49(2): 318-364 (2020) - [j91]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814: 74-85 (2020) - [j90]Haipeng Chen, Mohammad Taghi Hajiaghayi, Sarit Kraus, Anshul Sawant, Edoardo Serra, V. S. Subrahmanian, Yanhai Xiong:
PIE: A Data-Driven Payoff Inference Engine for Strategic Security Applications. IEEE Trans. Comput. Soc. Syst. 7(1): 42-57 (2020) - [c172]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. AISTATS 2020: 3717-3727 - [c171]MohammadTaghi Hajiaghayi, Marina Knittel:
Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees. AAMAS 2020: 1864-1866 - [c170]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi:
Approximate Maximum Matching in Random Streams. SODA 2020: 1773-1785 - [c169]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic matching with few queries: (1-ε) approximation. STOC 2020: 1111-1124 - [i77]Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin:
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. CoRR abs/2002.11342 (2020) - [i76]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR abs/2002.11880 (2020) - [i75]Behzad Ghazanfari, Fatemeh Afghah, MohammadTaghi Hajiaghayi:
Inverse Feature Learning: Feature learning based on Representation Learning of Error. CoRR abs/2003.03689 (2020) - [i74]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR abs/2003.07285 (2020) - [i73]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR abs/2007.07027 (2020)
2010 – 2019
- 2019
- [j89]Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - [j88]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): 1304-1325 (2019) - [j87]Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Silvio Lattanzi:
Introduction to the Special Issue for SPAA'17. ACM Trans. Parallel Comput. 6(3): 10:1 (2019) - [c168]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Online Pandora's Boxes and Bandits. AAAI 2019: 1885-1892 - [c167]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. EC 2019: 597-616 - [c166]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA 2019: 15:1-15:14 - [c165]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - [c164]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. FOCS 2019: 1637-1649 - [c163]MohammadAmin Ghiasi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, Hadi Yami:
On the Efficiency and Equilibria of Rich Ads. IJCAI 2019: 301-307 - [c162]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: 481-490 - [c161]Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Computing Stackelberg Equilibria of Large General-Sum Games. SAGT 2019: 168-182 - [c160]Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching on Uniformly Sparse Graphs. SAGT 2019: 357-373 - [c159]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. SODA 2019: 1055-1068 - [c158]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. SODA 2019: 1181-1200 - [c157]MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun:
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. SODA 2019: 1654-1672 - [c156]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. SODA 2019: 2855-2874 - [c155]Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
1+ε approximation of tree edit distance in quadratic time. STOC 2019: 709-720 - [c154]Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. STOC 2019: 997-1008 - [c153]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC 2019: 36:1-36:3 - [i72]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. CoRR abs/1901.03744 (2019) - [i71]