Saeed Seddighin
Orcid: 0000-0002-3951-7096
According to our database1,
Saeed Seddighin
authored at least 56 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.
Artif. Intell., February, 2024
2023
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems.
Algorithmica, May, 2023
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
2022
Artif. Intell., 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
IEEE Trans. Parallel Distributed Syst., 2021
J. ACM, 2021
CoRR, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Theor. Comput. Sci., 2020
CoRR, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
Math. Oper. Res., 2019
J. Artif. Intell. Res., 2019
CoRR, 2019
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond.
CoRR, 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.
Algorithmica, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2016
CoRR, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Australas. J Comb., 2014
Proceedings of the 23rd International World Wide Web Conference, 2014
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014