Saeed Seddighin

According to our database, Saeed Seddighin authored at least 56 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.

Masoud Seddighin, Saeed Seddighin

Artif. Intell., February, 2024

2023

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems.

François Le Gall, Saeed Seddighin

Algorithmica, May, 2023

Fast and Simple Solutions of Blotto Games.

Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin

Oper. Res., March, 2023

Location-Sensitive String Problems in MPC.

Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

On Complexity of 1-Center in Various Metrics.

Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin

Proceedings of the Approximation, 2023

2022

Dynamic Subset Sum with Truly Sublinear Processing Time.

Hamed Saleh, Saeed Seddighin

CoRR, 2022

Fair allocation of indivisible goods: Beyond additive valuations.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

Artif. Intell., 2022

3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time.

Masoud Seddighin, Saeed Seddighin

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Improved MPC Algorithms for Edit Distance and Ulam Distance.

Mahdi Boroujeni, Mohammad Ghodsi, Saeed Seddighin

IEEE Trans. Parallel Distributed Syst., 2021

Fair Allocation of Indivisible Goods: Improvement.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

Math. Oper. Res., 2021

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.

Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin

J. ACM, 2021

Optimal Space and Time for Streaming Pattern Matching.

Tung Mai, Anup B. Rao, Ryan A. Rossi, Saeed Seddighin

CoRR, 2021

Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem.

Michael Mitzenmacher, Saeed Seddighin

CoRR, 2021

Improved dynamic algorithms for longest increasing subsequence.

Tomasz Kociumaka, Saeed Seddighin

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

String Matching with Wildcards in the Massively Parallel Computation Model.

MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Improved Sublinear Time Algorithm for Longest Increasing Subsequence.

Michael Mitzenmacher, Saeed Seddighin

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.

Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Learning Complexity of Simulated Annealing.

Avrim Blum, Chen Dan, Saeed Seddighin

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable.

Sina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua Teng

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Covering orthogonal polygons with sliding <i>k</i>-transmitters.

Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi

Theor. Comput. Sci., 2020

Erdös-Szekeres Partitioning Problem.

Michael Mitzenmacher, Saeed Seddighin

CoRR, 2020

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS.

Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin

CoRR, 2020

Dynamic algorithms for LIS and distance to monotonicity.

Michael Mitzenmacher, Saeed Seddighin

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case.

Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.

AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin

Math. Oper. Res., 2019

Fair Allocation of Indivisible Goods to Asymmetric Agents.

Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami

J. Artif. Intell. Res., 2019

Massively Parallel Algorithms for String Matching with Wildcards.

MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun

CoRR, 2019

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems.

Mahdi Boroujeni, Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Saeed Seddighin

CoRR, 2019

MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond.

MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin, Cliff Stein

CoRR, 2019

1+<i>ε</i> approximation of tree edit distance in quadratic time.

Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Improved MPC Algorithms for Edit Distance and Ulam Distance.

Mahdi Boroujeni, Saeed Seddighin

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Approximating LCS in Linear Time: Beating the √n Barrier.

MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.

MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computing Stackelberg Equilibria of Large General-Sum Games.

Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Approximation Algorithms for LCS and LIS with Truly Improved Running Times.

Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Optimal Strategies of Blotto Games: Beyond Convexity.

Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Fast algorithms for knapsack via convolution and prediction.

MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.

Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Frugal Auction Design for Set Systems: Vertex Cover and Knapsack.

Mohammad Taghi Hajiaghayi, Mohammad Reza Khani, Saeed Seddighin

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Fair Allocation of Indivisible Goods: Improvements and Generalizations.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Spatio-Temporal Games Beyond One Dimension.

Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Greedy Algorithms for Online Survivable Network Design.

Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Fair Allocation of Indivisible Goods: Improvement and Generalization.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

CoRR, 2017

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.

Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin

Algorithmica, 2017

Stochastic k-Server: How Should Uber Work?.

Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.

Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

A Study of Compact Reserve Pricing Languages.

MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

From Duels to Battefields: Computing Equilibria of Blotto and Other Games.

Mahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin

CoRR, 2016

Price of Competition and Dueling Games.

Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, Saeed Seddighin

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.

Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Forming external behaviors by leveraging internal opinions.

AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Revenue Maximization for Selling Multiple Correlated Items.

MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin

Proceedings of the Algorithms - ESA 2015, 2015

2014

Some bounds for the signed edge domination number of a graph.

Saieed Akbari, Hossein Esfandiari, E. Barzegary, Saeed Seddighin

Australas. J Comb., 2014

How effectively can we form opinions?

AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod

Proceedings of the 23rd International World Wide Web Conference, 2014

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).

Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Covering Orthogonal Polygons with Sliding k-Transmitters.

Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014