Follow
Saeed Seddighin
Title
Cited by
Cited by
Year
Fair allocation of indivisible goods: Improvements and generalizations
M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami
Proceedings of the 2018 ACM Conference on Economics and Computation, 539-556, 2018
1332018
Approximating edit distance in truly subquadratic time: Quantum and mapreduce
M Boroujeni, S Ehsani, M Ghodsi, MT HajiAghayi, S Seddighin
Journal of the ACM (JACM) 68 (3), 1-41, 2021
642021
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
AM Ahmadinejad, S Dehghani, MT Hajiaghay, B Lucier, H Mahini, ...
Thirtieth AAAI Conference on Artificial Intelligence, 2016
612016
Fair allocation of indivisible goods to Asymmertic Agents
M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami
Proceedings of the 2018 ACM Conference on Economics and Computation, 539-556, 2018
53*2018
Faster and simpler algorithm for optimal strategies of Blotto game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
Thirty-first AAAI conference on artificial intelligence, 2017
452017
Stochastic k-server: How should uber work?
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin
arXiv preprint arXiv:1705.05755, 2017
34*2017
Revenue Maximization for Selling Multiple Correlated Items. arxiv report, 2015
MH Bateni, S Dehghani, MT Hajiaghayi, S Seddighin
34*
Approximation algorithms for LCS and LIS with truly improved running times
A Rubinstein, S Seddighin, Z Song, X Sun
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
312019
Approximating lcs in linear time: Beating the barrier
MT Hajiaghayi, M Seddighin, S Seddighin, X Sun
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
292019
Massively parallel approximation algorithms for edit distance and longest common subsequence
MT Hajiaghayi, S Seddighin, X Sun
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
242019
From battlefields to elections: Winning strategies of blotto and auditing games
S Behnezhad, A Blum, M Derakhshan, MT HajiAghayi, M Mahdian, ...
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
172018
Optimal strategies of blotto games: Beyond convexity
S Behnezhad, A Blum, M Derakhshan, MT Hajiaghayi, CH Papadimitriou, ...
Proceedings of the 2019 ACM Conference on Economics and Computation, 597-616, 2019
162019
Fast algorithms for knapsack via convolution and prediction
MH Bateni, MT Hajiaghayi, S Seddighin, C Stein
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
162018
Improved MPC algorithms for edit distance and Ulam distance
M Boroujeni, M Ghodsi, S Seddighin
IEEE Transactions on Parallel and Distributed Systems 32 (11), 2764-2776, 2021
152021
Dynamic algorithms for LIS and distance to monotonicity
M Mitzenmacher, S Seddighin
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
152020
Learning complexity of simulated annealing
A Blum, C Dan, S Seddighin
International conference on artificial intelligence and statistics, 1540-1548, 2021
112021
Improved algorithms for edit distance and LCS: beyond worst case
M Boroujeni, M Seddighin, S Seddighin
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
112020
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
RH Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ...
International Symposium on Parameterized and Exact Computation, 159-171, 2014
112014
Spatio-temporal games beyond one dimension
S Behnezhad, M Derakhshan, M Hajiaghayi, S Seddighin
Proceedings of the 2018 ACM Conference on Economics and Computation, 411-428, 2018
102018
Improved sublinear time algorithm for longest increasing subsequence
M Mitzenmacher, S Seddighin
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
92021
The system can't perform the operation now. Try again later.
Articles 1–20