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

Improved maximin guarantees for subadditive and fractionall..:

Seddighin, Masoud ; Seddighin, Saeed
Artificial Intelligence.  327 (2024)  - p. 104049 , 2024
Link: https://doi.org/10.1016/..
 
?
2

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..
 
?
3

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

Rubinstein, Aviad ; Seddighin, Saeed ; Song, Zhao.
SIAM Journal on Computing.  , 2023
Link: https://doi.org/10.1137/..
 
?
4

Quantum Meets Fine-Grained Complexity: Sublinear Time Quant..:

Le Gall, François ; Seddighin, Saeed
Algorithmica.  85 (2022)  5 - p. 1251-1286 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Fair allocation of indivisible goods: Beyond additive valua..:

Ghodsi, Mohammad ; HajiAghayi, MohammadTaghi ; Seddighin, Masoud..
Artificial Intelligence.  303 (2022)  - p. 103633 , 2022
Link: https://doi.org/10.1016/..
 
?
6

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..
 
?
7

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..
 
?
8

Approximating Edit Distance in Truly Subquadratic Time: Qua..:

Boroujeni, Mahdi ; Ehsani, Soheil ; Ghodsi, Mohammad..
Journal of the ACM.  68 (2021)  3 - p. 1-41 , 2021
Link: https://doi.org/10.1145/..
 
?
9

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..
 
?
10

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/..
 
?
11

Improved MPC Algorithms for Edit Distance and Ulam Distance:

Boroujeni, Mahdi ; Ghodsi, Mohammad ; Seddighin, Saeed
IEEE Transactions on Parallel and Distributed Systems.  32 (2021)  11 - p. 2764-2776 , 2021
Link: https://doi.org/10.1109/..
 
?
12

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..
 
?
13

Covering orthogonal polygons with sliding k-transmitters:

Mahdavi, Salma Sadat ; Seddighin, Saeed ; Ghodsi, Mohammad
Theoretical Computer Science.  815 (2020)  - p. 163-181 , 2020
Link: https://doi.org/10.1016/..
 
?
14

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..
 
?
15

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..
 
1-15