Will Rosenbaum
From MaRDI portal
Person:1742755
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Bias reduction for sum estimation | 2025-01-14 | Paper |
| Almost optimal bounds for sublinear-time sampling of k-cliques in bounded arboricity graphs | 2024-06-24 | Paper |
| Packet forwarding with swaps Structural Information and Communication Complexity | 2024-01-11 | Paper |
| The arboricity captures the complexity of sampling edges (available as arXiv preprint) | 2022-07-21 | Paper |
| Lower bounds for approximating graph parameters via communication complexity (available as arXiv preprint) | 2021-08-04 | Paper |
| Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| With Great Speed Come Small Buffers Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Fault Tolerant Gradient Clock Synchronization Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Stable Matchings with Restricted Preferences: Structure and Complexity | 2020-08-19 | Paper |
| A stable marriage requires communication Games and Economic Behavior | 2019-12-12 | Paper |
| On sampling edges almost uniformly (available as arXiv preprint) | 2019-10-25 | Paper |
| Space-time tradeoffs for distributed verification Lecture Notes in Computer Science | 2018-04-12 | Paper |
| The Space Requirement of Local Forwarding on Acyclic Networks Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| A Stable Marriage Requires Communication Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Brief announcement: Space-time tradeoffs for distributed verification Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Lower Bounds for Approximating Graph Parameters via Communication Complexity (available as arXiv preprint) | 2017-09-13 | Paper |
| Fast distributed almost stable matchings Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Research outcomes over time
This page was built for person: Will Rosenbaum
