Sepehr Assadi
- A. Aggarwal, R. J. Anderson, and M. Kao. Parallel depth- first search in general directed graphs. SIAM J. Comput., 19(2):397-409, 1990. Google Scholar
Digital Library
- S. Assadi and S. Khanna. Randomized composable coresets for matching and vertex cover. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, pages 3-12, 2017. Google ScholarDigital Library
- S. Assadi, S. Khanna, Y. Li, and G. Yaroslavtsev. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1345-1364, 2016. Google ScholarDigital Library
- G. E. Blelloch. Some sequential algorithms are almost always parallel. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, page 141, 2017. Google ScholarDigital Library
- K. Censor-Hillel, E. Fischer, G. Schwartzman, and Y. Vasudev. Fast distributed algorithms for testing graph properties. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, pages 43-56, 2016.Google Scholar
- B. Feldkord and F. Meyer auf der Heide. The mobile server problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, pages 313-319, 2017. Google ScholarDigital Library
- O. Fischer, S. Gershtein, and R. Oshman. On the multiparty communication complexity of testing triangle-freeness. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 111-120, 2017. Google ScholarDigital Library
- S. Guha, Y. Li, and Q. Zhang. Distributed partial clustering. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, pages 143-152, 2017. Google ScholarDigital Library
- S. Har-Peled, P. Indyk, S. Mahabadi, and A. Vakilian. Towards tight bounds for the streaming set cover problem. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pages 371-383, 2016. Google ScholarDigital Library
- Z. Huang and P. Peng. Dynamic graph stream algorithms in o(n) space. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pages 18:1-18:16, 2016.Google Scholar
- P. Indyk. Beyond P vs. NP: quadratic-time hardness for big data problems. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, page 1, 2017. Google ScholarDigital Library
- A. McGregor and H. T. Vu. Better streaming algorithms for the maximum coverage problem. In 20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy, pages 22:1-22:18, 2017.Google Scholar
Index Terms
- SPAA 2017 Review
Index terms have been assigned to the content through auto-classification.
Comments