7 citations · 13 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.NI2019
On the Robustness of Deep Learning-predicted Contention Models for Network Calculus
Fabien Geyer, Steffen Bondorf
The network calculus (NC) analysis takes a simple model consisting of a network of schedulers and data flows crossing them. A number of analysis "building blocks" can then be appli…
cs.IT2019★ 6 cited
Sublinear-Time Non-Adaptive Group Testing with Tests via Bit-Mixing Coding
Steffen Bondorf, Binbin Chen, Jonathan Scarlett +2
The group testing problem consists of determining a small set of defective items from a larger set of items based on tests on groups of items, and is relevant in applications such…