Projects per year
Fingerprint
Dive into the research topics where Peter Robinson is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation
Robinson, P. (PI)
7/1/24 → 6/30/28
Project: Research project
-
Communication-Efficient Distributed Algorithms for Modern Networks
Robinson, P. (PI)
Natural Sciences and Engineering Research Council of Canada
1/1/19 → …
Project: Research project
-
Communication-Efficient Distributed Algorithms for Modern Networks
Robinson, P. (PI)
Natural Sciences and Engineering Research Council of Canada
1/1/18 → …
Project: Research project
-
Communication-Efficient Distributed Algorithms for Modern Networks
Robinson, P. (PI)
Natural Sciences and Engineering Research Council of Canada
1/1/18 → …
Project: Research project
-
Algorithmic Foundations of Distributed Large-Scale Graph Processing
Robinson, P. (PI)
1/1/20 → 12/31/23
Project: Research project
-
Sparse Spanners with Small Distance and Congestion Stretches
Busch, C., Kowalski, D. R. & Robinson, P., Jun 17 2024, SPAA 2024 - Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 383-393 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Dynamic Maximal Matching in Clique Networks
Li, M., Robinson, P. & Zhu, X., Jan 2024, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024. Guruswami, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 73. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 287).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
The Message Complexity of Distributed Graph Optimization
Dufoulon, F., Pai, S., Pandurangan, G., Pemmaraju, S. V. & Robinson, P., Jan 2024, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024. Guruswami, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 287).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Scopus citations -
Tight Bounds on the Message Complexity of Distributed Tree Verification
Kutten, S., Robinson, P. & Tan, M. M., Jan 2024, 27th International Conference on Principles of Distributed Systems, OPODIS 2023. Bessani, A., Defago, X., Nakamura, J., Wada, K. & Yamauchi, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 286).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems
Robinson, P., Oct 2023, 37th International Symposium on Distributed Computing, DISC 2023. Oshman, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 32. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 281).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution