Will Rosenbaum

45 papers A* 12A 2B 2Journal 24Unranked 4

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