Saeed Seddighin

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 73

Top Topics

Greedy Algorithms

Simulated Annealing

Top Venues

Publications

Masoud Seddighin, Saeed Seddighin
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem. Artif. Intell. 327 (2024)
Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin
Location-Sensitive String Problems in MPC. SPAA (2023)
François Le Gall, Saeed Seddighin
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. Algorithmica 85 (5) (2023)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin
Fast and Simple Solutions of Blotto Games. Oper. Res. 71 (2) (2023)
Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin
On Complexity of 1-Center in Various Metrics. APPROX/RANDOM (2023)
Masoud Seddighin, Saeed Seddighin
3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. ITCS (2022)
Masoud Seddighin, Saeed Seddighin
Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem. AAAI (2022)
Hamed Saleh, Saeed Seddighin
Dynamic Subset Sum with Truly Sublinear Processing Time. CoRR (2022)
François Le Gall, Saeed Seddighin
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. ITCS (2022)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303 (2022)
Michael Mitzenmacher, Saeed Seddighin
Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem. CoRR (2021)
Michael Mitzenmacher, Saeed Seddighin
Improved Sublinear Time Algorithm for Longest Increasing Subsequence. SODA (2021)
MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun
String Matching with Wildcards in the Massively Parallel Computation Model. SPAA (2021)
Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin
On Complexity of 1-Center in Various Metrics. CoRR (2021)
Avrim Blum, Chen Dan, Saeed Seddighin
Learning Complexity of Simulated Annealing. AISTATS (2021)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46 (3) (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)
Tung Mai, Anup B. Rao, Ryan A. Rossi, Saeed Seddighin
Optimal Space and Time for Streaming Pattern Matching. CoRR (2021)
Sina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua Teng
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. AAAI (2021)
Tomasz Kociumaka, Saeed Seddighin
Improved dynamic algorithms for longest increasing subsequence. STOC (2021)
Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun
Approximation Algorithms for LCS and LIS with Truly Improved Running Times. CoRR (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)
Mahdi Boroujeni, Mohammad Ghodsi, Saeed Seddighin
Improved MPC Algorithms for Edit Distance and Ulam Distance. IEEE Trans. Parallel Distributed Syst. 32 (11) (2021)
Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. SODA (2020)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR (2020)
Michael Mitzenmacher, Saeed Seddighin
Erdös-Szekeres Partitioning Problem. CoRR (2020)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. CoRR (2020)
Michael Mitzenmacher, Saeed Seddighin
Dynamic algorithms for LIS and distance to monotonicity. STOC (2020)
Avrim Blum, Chen Dan, Saeed Seddighin
Learning Complexity of Simulated Annealing. CoRR (2020)
Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi
-transmitters. Theor. Comput. Sci. 815 (2020)
Tomasz Kociumaka, Saeed Seddighin
Improved Dynamic Algorithms for Longest Increasing Subsequence. CoRR (2020)
François Le Gall, Saeed Seddighin
Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems. 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)
Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin
Computing Stackelberg Equilibria of Large General-Sum Games. SAGT (2019)
Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun
Approximation Algorithms for LCS and LIS with Truly Improved Running Times. FOCS (2019)
Mahdi Boroujeni, Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems. CoRR (2019)
Mahdi Boroujeni, Saeed Seddighin
Improved MPC Algorithms for Edit Distance and Ulam Distance. SPAA (2019)
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 (2019)
Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin
Computing Stackelberg Equilibria of Large General-Sum Games. CoRR (2019)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
Approximating LCS in Linear Time: Beating the √n Barrier. SODA (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)
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)
Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin
approximation of tree edit distance in quadratic time. STOC (2019)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin
Optimal Strategies of Blotto Games: Beyond Convexity. EC (2019)
MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. SODA (2019)
Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. CoRR (2018)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA (2018)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC (2018)
Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. SODA (2018)
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein
Fast Algorithms for Knapsack via Convolution and Prediction. CoRR (2018)
Mohammad Taghi Hajiaghayi, Mohammad Reza Khani, Saeed Seddighin
Frugal Auction Design for Set Systems: Vertex Cover and Knapsack. EC (2018)
Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Spatio-Temporal Games Beyond One Dimension. EC (2018)
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein
Fast algorithms for knapsack via convolution and prediction. STOC (2018)
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin
Greedy Algorithms for Online Survivable Network Design. ICALP (2018)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. AAAI (2017)
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. CoRR (2017)
Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR (2017)
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin
Stochastic k-Server: How Should Uber Work? CoRR (2017)
Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica 77 (4) (2017)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS (2017)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods: Improvement and Generalization. CoRR (2017)
MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin
A Study of Compact Reserve Pricing Languages. AAAI (2017)
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin
Stochastic k-Server: How Should Uber Work?. ICALP (2017)
Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin
Price of Competition and Dueling Games. CoRR (2016)
Mahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin
From Duels to Battefields: Computing Equilibria of Blotto and Other Games. CoRR (2016)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. CoRR (2016)
Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. ICALP (2016)
AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. AAAI (2016)
Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, Saeed Seddighin
Price of Competition and Dueling Games. ICALP (2016)
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands. CoRR (2015)
AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod
Forming external behaviors by leveraging internal opinions. INFOCOM (2015)
MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin
Revenue Maximization for Selling Multiple Correlated Items. ESA (2015)
Saieed Akbari, Hossein Esfandiari, E. Barzegary, Saeed Seddighin
Some bounds for the signed edge domination number of a graph. Australas. J Comb. 58 (2014)
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). IPEC (2014)
Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi
Covering Orthogonal Polygons with Sliding k-Transmitters. CCCG (2014)
AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod
How effectively can we form opinions? WWW (Companion Volume) (2014)
MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin
Revenue Maximization for Selling Multiple Correlated Items. CoRR (2014)