Will Rosenbaum

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 34

Top Topics

Winning Strategy

Packet Forwarding

Stable Marriage

Top Venues

Publications

Ara Vartanian, Will Rosenbaum, Scott Alfeld
Training-Time Attacks against K-nearest Neighbors. AAAI (2023)
Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek
Bias Reduction for Sum Estimation. APPROX/RANDOM (2023)
Cameron Matsui, Will Rosenbaum
Packet Forwarding with Swaps. SIROCCO (2023)
Will Rosenbaum
Finding a Winning Strategy for Wordle is NP-complete. CoRR (2022)
Will Rosenbaum
Packet Forwarding with a Locally Bursty Adversary. CoRR (2022)
Ara Vartanian, Will Rosenbaum, Scott Alfeld
Training-Time Attacks against k-Nearest Neighbors. CoRR (2022)
Christine T. Cheng, Will Rosenbaum
Stable Matchings with Restricted Preferences: Structure and Complexity. ACM Trans. Economics and Comput. 10 (3) (2022)
Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek
Bias Reduction for Sum Estimation. CoRR (2022)
Talya Eden, Dana Ron, Will Rosenbaum
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. ICALP (2022)
Will Rosenbaum
Packet Forwarding with a Locally Bursty Adversary. DISC (2022)
Christine T. Cheng, Will Rosenbaum
Stable Matchings with Restricted Preferences: Structure and Complexity. EC (2021)
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum
PALS: Plesiochronous and Locally Synchronous Systems. ASYNC (2020)
Christine T. Cheng, Will Rosenbaum
Stable Matchings with Restricted Preferences: Structure and Complexity. CoRR (2020)
Talya Eden, Dana Ron, Will Rosenbaum
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting. CoRR (2020)
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum
PALS: Plesiochronous and Locally Synchronous Systems. CoRR (2020)
Christine T. Cheng, Will Rosenbaum
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth. CoRR (2020)
Will Rosenbaum, Jukka Suomela
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. PODC (2020)
Boaz Patt-Shamir, Will Rosenbaum
Space-Optimal Packet Routing on Trees. INFOCOM (2019)
Talya Eden, Dana Ron, Will Rosenbaum
The Arboricity Captures the Complexity of Sampling Edges. CoRR (2019)
Johannes Bund, Christoph Lenzen, Will Rosenbaum
Fault Tolerant Gradient Clock Synchronization. PODC (2019)
Avery Miller, Boaz Patt-Shamir, Will Rosenbaum
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. PODC (2019)
Talya Eden, Dana Ron, Will Rosenbaum
The Arboricity Captures the Complexity of Sampling Edges. ICALP (2019)
Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
A stable marriage requires communication. Games Econ. Behav. 118 (2019)
Johannes Bund, Christoph Lenzen, Will Rosenbaum
Fault Tolerant Gradient Clock Synchronization. CoRR (2019)
Will Rosenbaum, Jukka Suomela
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. CoRR (2019)
Avery Miller, Boaz Patt-Shamir, Will Rosenbaum
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. CoRR (2019)
Talya Eden, Will Rosenbaum
Lower Bounds for Approximating Graph Parameters via Communication Complexity. APPROX-RANDOM (2018)
Talya Eden, Will Rosenbaum
On Sampling Edges Almost Uniformly. SOSA (2018)
Talya Eden, Will Rosenbaum
Lower Bounds for Approximating Graph Parameters via Communication Complexity. CoRR (2017)
Talya Eden, Will Rosenbaum
On Sampling Edges Almost Uniformly. CoRR (2017)
Rafail Ostrovsky, Mor Perry, Will Rosenbaum
Space-Time Tradeoffs for Distributed Verification. SIROCCO (2017)
Boaz Patt-Shamir, Will Rosenbaum
The Space Requirement of Local Forwarding on Acyclic Networks. PODC (2017)
Mor Baruch, Rafail Ostrovsky, Will Rosenbaum
Brief Announcement: Space-Time Tradeoffs for Distributed Verification. PODC (2016)
Mor Baruch, Rafail Ostrovsky, Will Rosenbaum
Space-Time Tradeoffs for Distributed Verification. CoRR (2016)
Rafail Ostrovsky, Will Rosenbaum
Fast Distributed Almost Stable Matchings. PODC (2015)
Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
A Stable Marriage Requires Communication. SODA (2015)
Rafail Ostrovsky, Will Rosenbaum
Fast distributed almost stable marriages. CoRR (2014)
Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
A Stable Marriage Requires Communication. CoRR (2014)
Rafail Ostrovsky, Will Rosenbaum
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems. CoRR (2014)