D. Ellis Hershkowitz

Orcid: 0000-0003-0862-3715

Affiliations:
  • Brown University, Computer Science Department


According to our database1, D. Ellis Hershkowitz authored at least 26 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Ghost Value Augmentation for k-ECSS and k-ECSM.
CoRR, 2023

Parallel Greedy Spanners.
CoRR, 2023

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
O(1) Steiner Point Removal in Series-Parallel Graphs.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph.
Inf. Process. Lett., 2021

Fast Algorithms for Hop-Constrained Flows and Moving Cuts.
CoRR, 2021

Bad-Policy Density: A Measure of Reinforcement Learning Hardness.
CoRR, 2021

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries.
CoRR, 2021

Tree embeddings for hop-constrained network design.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Near-Optimal Schedules for Simultaneous Multicasts.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

District-Fair Participatory Budgeting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Reverse greedy is bad for <i>k</i>-center.
Inf. Process. Lett., 2020

Computation-Aware Data Aggregation.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Erasure Correction for Noisy Radio Networks.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Finding Options that Minimize Planning Time.
Proceedings of the 36th International Conference on Machine Learning, 2019

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty.
Proceedings of the Approximation, 2019

2018
Reverse Greedy is Bad for k-Center.
CoRR, 2018

A Computational Approach to Organizational Structure.
CoRR, 2018

Round- and Message-Optimal Distributed Part-Wise Aggregation.
CoRR, 2018

Round- and Message-Optimal Distributed Graph Algorithms.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Broadcasting in Noisy Radio Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Near Optimal Behavior via Approximate State Abstraction.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Goal-Based Action Priors.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Learning Propositional Functions for Planning and Reinforcement Learning.
Proceedings of the 2015 AAAI Fall Symposia, Arlington, Virginia, USA, November 12-14, 2015, 2015


  Loading...