Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Seddighin, Saeed
24  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Location-Sensitive String Problems in MPC:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Gilbert, Jacob ; Hajiaghayi, MohammadTaghi ; Saleh, Hamed. - p. 101-111 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Improved Sublinear Time Algorithm for Longest Increasing Su..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Mitzenmacher, Michael ; Seddighin, Saeed - p. 1934-1947 , 2021
Link: https://doi.org/10.1137/..
 
?
3

String Matching with Wildcards in the Massively Parallel Co..:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Hajiaghayi, MohammadTaghi ; Saleh, Hamed ; Seddighin, Saeed. - p. 275-284 , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

Improved sublinear time algorithm for longest increasing su..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Mitzenmacher, Michael ; Seddighin, Saeed - p. 1934-1947 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Improved dynamic algorithms for longest increasing subseque..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Kociumaka, Tomasz ; Seddighin, Saeed - p. 640-653 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Improved algorithms for edit distance and LCS : beyond w..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Boroujeni, Mahdi ; Seddighin, Masoud ; Seddighin, Saeed - p. 1601-1620 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

Dynamic algorithms for LIS and distance to monotonicity:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Mitzenmacher, Michael ; Seddighin, Saeed - p. 671-684 , 2020
Link: https://dl.acm.org/doi/1..
 
?
8

Approximating LCS in linear time : beating the [MATH HER..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Hajiaghayi, MohammadTaghi ; Seddighin, Masoud ; Seddighin, Saeed. - p. 1181-1200 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Approximation Algorithms for LCS and LIS with Truly Improve..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Rubinstein, Aviad ; Seddighin, Saeed ; Song, Zhao. - p. 1121-1145 , 2019
Link: https://doi.org/10.1109/..
 
?
10

Optimal Strategies of Blotto Games : Beyond Convexity:

, In: Proceedings of the 2019 ACM Conference on Economics and Computation,
Behnezhad, Soheil ; Blum, Avrim ; Derakhshan, Mahsa... - p. 597-616 , 2019
Link: https://dl.acm.org/doi/1..
 
?
11

Massively parallel approximation algorithms for edit distan..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Hajiaghayi, MohammadTaghi ; Seddighin, Saeed ; Sun, Xiaorui - p. 1654-1672 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

1+ε approximation of tree edit distance in quadratic time:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Boroujeni, Mahdi ; Ghodsi, Mohammad ; Hajiaghayi, MohammadTaghi. - p. 709-720 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

Computing Stackelberg Equilibria of Large General-Sum Games:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Blum, Avrim ; Haghtalab, Nika ; Hajiaghayi, MohammadTaghi. - p. 168-182 , 2019
Link: https://doi.org/10.1007/..
 
?
14

Improved MPC Algorithms for Edit Distance and Ulam Distance:

, In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures,
Boroujeni, Mahdi ; Seddighin, Saeed - p. 31-40 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

Spatio-Temporal Games Beyond One Dimension:

, In: Proceedings of the 2018 ACM Conference on Economics and Computation,
Behnezhad, Soheil ; Derakhshan, Mahsa ; Hajiaghayi, Mohammadtaghi. - p. 411-428 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15