Will Rosenbaum

Most-cited papers

A Stable Marriage Requires Communication
Yannai A. Gonczarowski, Noam Nisan, R. Ostrovsky, Will Rosenbaum
2014ACM-SIAM Symposium on Discrete Algorithms64 citations Open access
Semantic Scholar
On Sampling Edges Almost Uniformly
T. Eden, Will Rosenbaum
2017SIAM Symposium on Simplicity in Algorithms62 citations
Semantic Scholar
Lower Bounds for Approximating Graph Parameters via Communication Complexity
T. Eden, Will Rosenbaum
2017International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques36 citations
Semantic Scholar
The Arboricity Captures the Complexity of Sampling Edges
T. Eden, D. Ron, Will Rosenbaum
2019International Colloquium on Automata, Languages and Programming31 citations
Semantic Scholar
Space-Time Tradeoffs for Distributed Verification
Moran Baruch, R. Ostrovsky, Will Rosenbaum
2016Colloquium on Structural Information & Communication Complexity23 citations Open access
Semantic Scholar
Fast Distributed Almost Stable Matchings
R. Ostrovsky, Will Rosenbaum
2015ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing20 citations
Semantic Scholar
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Will Rosenbaum, J. Suomela
2019ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing16 citations Open access
Semantic Scholar
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
T. Eden, D. Ron, Will Rosenbaum
2022International Colloquium on Automata, Languages and Programming12 citations
Semantic Scholar
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting
T. Eden, D. Ron, Will Rosenbaum
2020arXiv.org10 citations
Semantic Scholar
Finding a Winning Strategy for Wordle is NP-complete
Will Rosenbaum
2022arXiv.org9 citations Open access
Semantic Scholar
Stable Matchings with Restricted Preferences: Structure and Complexity
Christine T. Cheng, Will Rosenbaum
2020ACM Conference on Economics and Computation9 citations
Semantic Scholar
PALS: Plesiochronous and Locally Synchronous Systems
J. Bund, Matthias Függer, C. Lenzen, Moti Medina +1 more
20202020 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)8 citations Open access
Semantic Scholar
Fault Tolerant Gradient Clock Synchronization
J. Bund, C. Lenzen, Will Rosenbaum
2019ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing6 citations Open access
Semantic Scholar
The Space Requirement of Local Forwarding on Acyclic Networks
B. Patt-Shamir, Will Rosenbaum
2017ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing6 citations
Semantic Scholar
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
Avery Miller, B. Patt-Shamir, Will Rosenbaum
2019ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing5 citations
Semantic Scholar
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
R. Ostrovsky, Will Rosenbaum
2014arXiv.org5 citations
Semantic Scholar
Stable Matchings with Restricted Preferences: Structure and Complexity
Christine T. Cheng, Will Rosenbaum
2022ACM Trans. Economics and Comput.3 citations Open access
Semantic Scholar
Distributed weak independent sets in hypergraphs: Upper and lower bounds
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
2024ALGOWIN2 citations
Semantic Scholar
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth
Christine T. Cheng, Will Rosenbaum
2020arXiv.org2 citations
Semantic Scholar
Space-Optimal Packet Routing on Trees
B. Patt-Shamir, Will Rosenbaum
2019IEEE Conference on Computer Communications2 citations
Semantic Scholar
On The Communication Complexity of Finding an (Approximate) Stable Marriage
R. Ostrovsky, Will Rosenbaum
2014arXiv.org2 citations
Semantic Scholar
Fast distributed almost stable marriages
R. Ostrovsky, Will Rosenbaum
2014arXiv.org2 citations
Semantic Scholar
A Quadratic Lower Bound for Stable Roommates Solvability
Will Rosenbaum
2025Embedded Systems and Applications1 citations
Semantic Scholar
Training-Time Attacks against k-Nearest Neighbors
A. Vartanian, Will Rosenbaum, Scott Alfeld
2022AAAI Conference on Artificial Intelligence1 citations Open access
Semantic Scholar
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
Christine T. Cheng, Will Rosenbaum
2026ACM Transactions on Economics and Computation0 citations Open access
Semantic Scholar
Distributed Triangle and Simplex Enumeration in Hypergraphs
Duncan Adamson, Will Rosenbaum, P. Spirakis
20260 citations
Semantic Scholar
Packet Forwarding with Swaps
Cameron Matsui, Will Rosenbaum
2023Colloquium on Structural Information & Communication Complexity0 citations
Semantic Scholar
Bias Reduction for Sum Estimation
T. Eden, Jakob Baek Tejs Houen, Shyam Narayanan, Will Rosenbaum +1 more
2022International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques0 citations Open access
Semantic Scholar
Distributed Almost Stable Matchings
Will Rosenbaum
20160 citations
Semantic Scholar
Introduction to Communication Complexity
Will Rosenbaum
20140 citations
Semantic Scholar
Acquired immunodeficiency syndrome in France.
J. Brunet, E. Bouvet, J. Leibowitch, J. Chaperon +10 more
1983The Lancet0 citations
Semantic Scholar
Statistical and Probabilistic Methods in Algorithmic Data Analysis
AristidesGionis, MatteoRiondato, EliUpfal, Ravi Kumar +28 more
0 citations
Semantic Scholar