| 2026 | ESA | A Quadratic Lower Bound for Stable Roommates Solvability. | Will Rosenbaum |
| 2025 | Algosensors | Distributed Weak Independent Sets in Hypergraphs: Upper and Lower Bounds. | Duncan Adamson, Will Rosenbaum, Paul G. Spirakis |
| 2023 | AAAI | Training-Time Attacks against K-nearest Neighbors. | Ara Vartanian, Will Rosenbaum, Scott Alfeld |
| 2023 | SIROCCO | Packet Forwarding with Swaps. | Cameron Matsui, Will Rosenbaum |
| 2022 | ICALP | Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2020 | PODC | Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. | Will Rosenbaum, Jukka Suomela |
| 2019 | ICALP | The Arboricity Captures the Complexity of Sampling Edges. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2019 | INFOCOM | Space-Optimal Packet Routing on Trees. | Boaz Patt-Shamir, Will Rosenbaum |
| 2019 | PODC | Fault Tolerant Gradient Clock Synchronization. | Johannes Bund, Christoph Lenzen, Will Rosenbaum |
| 2019 | PODC | With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. | Avery Miller, Boaz Patt-Shamir, Will Rosenbaum |
| 2018 | SODA | On Sampling Edges Almost Uniformly. | Talya Eden, Will Rosenbaum |
| 2017 | PODC | The Space Requirement of Local Forwarding on Acyclic Networks. | Boaz Patt-Shamir, Will Rosenbaum |
| 2017 | SIROCCO | Space-Time Tradeoffs for Distributed Verification. | Rafail Ostrovsky, Mor Perry, Will Rosenbaum |
| 2016 | PODC | Brief Announcement: Space-Time Tradeoffs for Distributed Verification. | Mor Baruch, Rafail Ostrovsky, Will Rosenbaum |
| 2015 | PODC | Fast Distributed Almost Stable Matchings. | Rafail Ostrovsky, Will Rosenbaum |
| 2015 | SODA | A Stable Marriage Requires Communication. | Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum |