7 citations · 18 across the 15 of their papers we have counts for
23 papers
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
Christine T. Cheng, Will Rosenbaum
In the Stable Roommates Problem (SR), a set of agents rank one another in a linear order. The goal is to find a matching that is stable: one that has no pair of agents who mut…
Distributed Triangle and Simplex Enumeration in Hypergraphs
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
In the last decade, subgraph detection and enumeration have emerged as central problems in distributed graph algorithms. This is largely due to the problems' theoretical challenges…
A Quadratic Lower Bound for Stable Roommates Solvability
Will Rosenbaum
In their seminal work on the Stable Marriage Problem (SM), Gale and Shapley introduced a generalization of SM referred to as the Stable Roommates Problem (SR). An instance of SR co…
Distributed weak independent sets in hypergraphs: Upper and lower bounds
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertice…
Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case (Extended Version)
Timothé Albouy, Davide Frey, Michel Raynal +1
This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct.…
Training-Time Attacks against k-Nearest Neighbors
Ara Vartanian, Will Rosenbaum, Scott Alfeld
Nearest neighbor-based methods are commonly used for classification tasks and as subroutines of other data-analysis methods. An attacker with the capability of inserting their own…