Fast distributed almost stable marriages. - Rafail Ostrovsky; Will Rosenbaum (CoRR, 2014)

It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems. - Rafail Ostrovsky; Will Rosenbaum (CoRR, 2014)

Fast Distributed Almost Stable Matchings. - Rafail Ostrovsky; Will Rosenbaum (PODC, 2015)

Brief Announcement: Space-Time Tradeoffs for Distributed Verification. - Mor Baruch; Rafail Ostrovsky; Will Rosenbaum (PODC, 2016)

Distributed Almost Stable Matchings. - Will Rosenbaum (2016)

The Space Requirement of Local Forwarding on Acyclic Networks. - Boaz Patt-Shamir; Will Rosenbaum (PODC, 2017)

Space-Time Tradeoffs for Distributed Verification. - Rafail Ostrovsky; Mor Perry; Will Rosenbaum (SIROCCO, 2017)

Lower Bounds for Approximating Graph Parameters via Communication Complexity. - Talya Eden; Will Rosenbaum (APPROX-RANDOM, 2018)

On Sampling Edges Almost Uniformly. - Talya Eden; Will Rosenbaum (SOSA, 2018)

The Arboricity Captures the Complexity of Sampling Edges. - Talya Eden; Dana Ron; Will Rosenbaum (ICALP, 2019)

Space-Optimal Packet Routing on Trees. - Boaz Patt-Shamir; Will Rosenbaum (INFOCOM, 2019)

Fault Tolerant Gradient Clock Synchronization. - Johannes Bund; Christoph Lenzen 001; Will Rosenbaum (PODC, 2019)

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. - Avery Miller; Boaz Patt-Shamir; Will Rosenbaum (PODC, 2019)

A stable marriage requires communication. - Yannai A. Gonczarowski; Noam Nisan; Rafail Ostrovsky; Will Rosenbaum (Games Econ. Behav., 2019)

PALS: Plesiochronous and Locally Synchronous Systems. - Johannes Bund; Matthias Függer; Christoph Lenzen 001; Moti Medina; Will Rosenbaum (ASYNC, 2020)

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. - Will Rosenbaum; Jukka Suomela (PODC, 2020)

Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth. - Christine T. Cheng; Will Rosenbaum (CoRR, 2020)

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting. - Talya Eden; Dana Ron; Will Rosenbaum (CoRR, 2020)

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. - Talya Eden; Dana Ron; Will Rosenbaum (ICALP, 2022)

Packet Forwarding with a Locally Bursty Adversary. - Will Rosenbaum (DISC, 2022)

Finding a Winning Strategy for Wordle is NP-complete. - Will Rosenbaum (CoRR, 2022)

Stable Matchings with Restricted Preferences: Structure and Complexity. - Christine T. Cheng; Will Rosenbaum (ACM Trans. Economics and Comput., 2022)

Training-Time Attacks against K-nearest Neighbors. - Ara Vartanian; Will Rosenbaum; Scott Alfeld (AAAI, 2023)

Bias Reduction for Sum Estimation. - Talya Eden; Jakob Bæk Tejs Houen; Shyam Narayanan; Will Rosenbaum; Jakub Tetek (APPROX/RANDOM, 2023)

Packet Forwarding with Swaps. - Cameron Matsui; Will Rosenbaum (SIROCCO, 2023)

Distributed weak independent sets in hypergraphs: Upper and lower bounds. - Duncan Adamson; Will Rosenbaum; Paul G. Spirakis (CoRR, 2024)

A Quadratic Lower Bound for Stable Roommates Solvability. - Will Rosenbaum (CoRR, 2025)