2 citations · 2 across the 13 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Universal Connection Schedules for Reconfigurable Networking
Shaleen Baral, Robert Kleinberg, Sylvan Martin +3
Reconfigurable networks are a novel communication paradigm in which the pattern of connectivity between hosts varies rapidly over time. Prior theoretical work explored the inherent…
cs.DS2025
Improving Pinwheel Density Bounds for Small Minimums
Ahan Mishra, Parker Rho, Robert Kleinberg
The density bound for schedulability for general pinwheel instances is , but density bounds better than can be shown for cases in which the minimum eleme…
cs.DS2024
Online Matroid Embeddings
Andrés Cristi, Paul Dütting, Robert Kleinberg +2
We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. We…