Seguir
Saeed Seddighin
Saeed Seddighin
Dirección de correo verificada de ttic.edu - Página principal
Título
Citado por
Citado por
Año
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
1812018
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
102*2018
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
982021
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
852016
Faster and simpler algorithm for optimal strategies of Blotto game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
632017
Stochastic k-server: How should Uber work?
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin
arXiv preprint arXiv:1705.05755, 2017
53*2017
Approximation algorithms for LCS and LIS with truly improved running times
A Rubinstein, S Seddighin, Z Song, X Sun
SIAM Journal on Computing, FOCS19-276-FOCS19-331, 2023
462023
Quantum meets fine-grained complexity: Sublinear time quantum algorithms for string problems
F Le Gall, S Seddighin
Algorithmica 85 (5), 1251-1286, 2023
432023
Fair allocation of indivisible goods: Improvement
M Ghodsi, MT Hajiaghayi, M Seddighin, S Seddighin, H Yami
Mathematics of Operations Research 46 (3), 1038-1053, 2021
422021
Revenue Maximization for Selling Multiple Correlated Items. arxiv report, 2015
MH Bateni, S Dehghani, MT Hajiaghayi, S Seddighin
40*
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
392018
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
382019
Learning complexity of simulated annealing
A Blum, C Dan, S Seddighin
International conference on artificial intelligence and statistics, 1540-1548, 2021
352021
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
352019
Improved MPC algorithms for edit distance and Ulam distance
M Boroujeni, S Seddighin
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 31-40, 2019
292019
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
272018
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
232020
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
212019
Fair allocation of indivisible goods: Beyond additive valuations
M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami
Artificial Intelligence 303, 103633, 2022
202022
Improved dynamic algorithms for longest increasing subsequence
T Kociumaka, S Seddighin
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
192021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20