D. Ellis Hershkowitz

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Ghost Value Augmentation for k-Edge-Connectivity (available as arXiv preprint)	N/A	Paper
Near-optimal schedules for simultaneous multicasts	2026-05-12	Paper
Low recourse arborescence forests under uniformly random arcs	2026-02-10	Paper
It's hard to HAC average linkage!	2026-01-14	Paper
The Steiner path aggregation problem Information Processing Letters	2026-01-13	Paper
One tree to rule them all: poly-logarithmic universal Steiner tree	2025-08-15	Paper
O(1) Steiner point removal in series-parallel graphs	2025-06-19	Paper
Adaptive-adversary-robust algorithms via small copy tree embeddings	2025-06-19	Paper
Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast	2024-05-08	Paper
Tree embeddings for hop-constrained network design Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
scientific article; zbMATH DE number 7650071 (Why is no real title available?) (available as arXiv preprint)	2023-02-03	Paper
Computation-Aware Data Aggregation. (available as arXiv preprint)	2023-02-03	Paper
Erasure correction for noisy radio networks	2023-02-03	Paper
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph Information Processing Letters	2021-03-11	Paper
Reverse greedy is bad for \(k\)-center Information Processing Letters	2020-04-03	Paper
Round- and message-optimal distributed graph algorithms Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing	2019-09-19	Paper
Broadcasting in noisy radio networks Proceedings of the ACM Symposium on Principles of Distributed Computing	2017-10-11	Paper

Research outcomes over time

This page was built for person: D. Ellis Hershkowitz