Will Rosenbaum

Orcid: 0000-0002-7723-9090

Affiliations:
  • Amherst College, Amherst, MA, USA


According to our database1, Will Rosenbaum authored at least 25 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Packet Forwarding with Swaps.
Proceedings of the Structural Information and Communication Complexity, 2023

Bias Reduction for Sum Estimation.
Proceedings of the Approximation, 2023

Training-Time Attacks against K-nearest Neighbors.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Stable Matchings with Restricted Preferences: Structure and Complexity.
ACM Trans. Economics and Comput., September, 2022

Finding a Winning Strategy for Wordle is NP-complete.
CoRR, 2022

Packet Forwarding with a Locally Bursty Adversary.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting.
CoRR, 2020

Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth.
CoRR, 2020

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

PALS: Plesiochronous and Locally Synchronous Systems.
Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems, 2020

2019
A stable marriage requires communication.
Games Econ. Behav., 2019

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Fault Tolerant Gradient Clock Synchronization.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Space-Optimal Packet Routing on Trees.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

The Arboricity Captures the Complexity of Sampling Edges.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
On Sampling Edges Almost Uniformly.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Lower Bounds for Approximating Graph Parameters via Communication Complexity.
Proceedings of the Approximation, 2018

2017
Space-Time Tradeoffs for Distributed Verification.
Proceedings of the Structural Information and Communication Complexity, 2017

The Space Requirement of Local Forwarding on Acyclic Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Distributed Almost Stable Matchings.
PhD thesis, 2016

Brief Announcement: Space-Time Tradeoffs for Distributed Verification.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Fast Distributed Almost Stable Matchings.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems.
CoRR, 2014

Fast distributed almost stable marriages.
CoRR, 2014


  Loading...