Will Rosenbaum

Available identifiers

zbMath Open rosenbaum.willMaRDI QIDQ1742755

List of research outcomes

Publication	Date of Publication	Type
Bias reduction for sum estimation	2025-01-14	Paper
Almost optimal bounds for sublinear-time sampling of \(k\)-cliques in bounded arboricity graphs	2024-06-24	Paper
Packet forwarding with swaps	2024-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q5091207	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5009503	2021-08-04	Paper
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems	2021-03-15	Paper
With Great Speed Come Small Buffers	2021-01-20	Paper
Fault Tolerant Gradient Clock Synchronization	2021-01-20	Paper
Stable Matchings with Restricted Preferences: Structure and Complexity	2020-08-19	Paper
A stable marriage requires communication	2019-12-12	Paper
On Sampling Edges Almost Uniformly	2019-10-25	Paper
Space-time tradeoffs for distributed verification	2018-04-12	Paper
The Space Requirement of Local Forwarding on Acyclic Networks	2017-10-11	Paper
A Stable Marriage Requires Communication	2017-10-05	Paper
Space-time tradeoffs for distributed verification	2017-09-29	Paper
Lower Bounds for Approximating Graph Parameters via Communication Complexity	2017-09-13	Paper
Fast distributed almost stable matchings	2016-03-23	Paper

Research outcomes over time

This page was built for person: Will Rosenbaum