Follow
Will Rosenbaum
Title
Cited by
Cited by
Year
A stable marriage requires communication
YA Gonczarowski, N Nisan, R Ostrovsky, W Rosenbaum
Games and Economic Behavior 118 (November 2019), 626-647, 2019
195*2019
On sampling edges almost uniformly
T Eden, W Rosenbaum
arXiv preprint arXiv:1706.09748, 2017
302017
Lower bounds for approximating graph parameters via communication complexity
T Eden, W Rosenbaum
arXiv preprint arXiv:1709.04262, 2017
212017
Space-time tradeoffs for distributed verification
R Ostrovsky, M Perry, W Rosenbaum
International Colloquium on Structural Information and Communication …, 2017
18*2017
The arboricity captures the complexity of sampling edges
T Eden, D Ron, W Rosenbaum
arXiv preprint arXiv:1902.08086, 2019
152019
Fast distributed almost stable matchings
R Ostrovsky, W Rosenbaum
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
132015
Seeing far vs. seeing wide: Volume complexity of local graph problems
W Rosenbaum, J Suomela
Proceedings of the 39th Symposium on Principles of Distributed Computing, 89-98, 2020
82020
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
T Eden, D Ron, W Rosenbaum
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
7*2022
The space requirement of local forwarding on acyclic networks
B Patt-Shamir, W Rosenbaum
Proceedings of the ACM Symposium on Principles of Distributed Computing, 13-22, 2017
62017
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
R Ostrovsky, W Rosenbaum
arXiv preprint arXiv:1412.1130, 2014
62014
Fault tolerant gradient clock synchronization
J Bund, C Lenzen, W Rosenbaum
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
42019
With great speed come small buffers: Space-bandwidth tradeoffs for routing
A Miller, B Patt-Shamir, W Rosenbaum
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
42019
Stable matchings with restricted preferences: Structure and complexity
CT Cheng, W Rosenbaum
Proceedings of the 22nd ACM Conference on Economics and Computation, 319-339, 2021
22021
PALS: Plesiochronous and locally synchronous systems
J Bund, M Függer, C Lenzen, M Medina, W Rosenbaum
2020 26th IEEE International Symposium on Asynchronous Circuits and Systems …, 2020
22020
Brief announcement: Space-time tradeoffs for distributed verification
M Baruch, R Ostrovsky, W Rosenbaum
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
22016
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth
CT Cheng, W Rosenbaum
arXiv preprint arXiv:2008.08479, 2020
12020
Analysis on Circles: A Modern View of Fourier Series
WB Rosenbaum
Reed College, 2009
12009
Bias Reduction for Sum Estimation
T Eden, JBT Houen, S Narayanan, W Rosenbaum, J Tětek
arXiv preprint arXiv:2208.01197, 2022
2022
Finding a Winning Strategy for Wordle is NP-complete
W Rosenbaum
arXiv preprint arXiv:2204.04104, 2022
2022
Space-Optimal Packet Routing on Trees
B Patt-Shamir, W Rosenbaum
IEEE INFOCOM 2019-IEEE Conference on Computer Communications, 1036-1044, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20