default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDD. Ellis Hershkowitz
Person information
- affiliation: Brown University, Computer Science Department
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC Average Linkage! ICALP 2024: 18:1-18:18- [c18]Bernhard Haeupler
, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-commodity Flow Emulators. STOC 2024: 71-82 - [c17]D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen:
Ghost Value Augmentation for k-Edge-Connectivity. STOC 2024: 1853-1864 - [i22]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
New Structures and Algorithms for Length-Constrained Expander Decompositions. CoRR abs/2404.13446 (2024) - [i21]MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC with Average Linkage! CoRR abs/2404.14730 (2024) - [i20]MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
Efficient Centroid-Linkage Clustering. CoRR abs/2406.05066 (2024) - [i19]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-Commodity Flow Emulators. CoRR abs/2406.14384 (2024) - 2023
- [c16]Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman:
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. FOCS 2023: 60-76 - [c15]Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. STOC 2023: 1371-1383 - [i18]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
Parallel Greedy Spanners. CoRR abs/2304.08892 (2023) - [i17]Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman:
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. CoRR abs/2308.01199 (2023) - [i16]D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen:
Ghost Value Augmentation for k-ECSS and k-ECSM. CoRR abs/2311.09941 (2023) - 2022
- [c14]Bernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic:
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. ESA 2022: 63:1-63:14 - [c13]D. Ellis Hershkowitz, Jason Li:
O(1) Steiner Point Removal in Series-Parallel Graphs. ESA 2022: 66:1-66:17 - 2021
- [j2]D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph. Inf. Process. Lett. 167: 106067 (2021) - [c12]D. Ellis Hershkowitz, Anson Kahng, Dominik Peters, Ariel D. Procaccia:
District-Fair Participatory Budgeting. AAAI 2021: 5464-5471 - [c11]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. ICALP 2021: 78:1-78:19 - [c10]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Tree embeddings for hop-constrained network design. STOC 2021: 356-369 - [i15]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. CoRR abs/2102.05168 (2021) - [i14]D. Ellis Hershkowitz, Anson Kahng, Dominik Peters, Ariel D. Procaccia:
District-Fair Participatory Budgeting. CoRR abs/2102.06115 (2021) - [i13]D. Ellis Hershkowitz, Jason Li:
O(1) Steiner Point Removal in Series-Parallel Graphs. CoRR abs/2104.00750 (2021) - [i12]David Abel, Cameron Allen, Dilip Arumugam, D. Ellis Hershkowitz, Michael L. Littman, Lawson L. S. Wong:
Bad-Policy Density: A Measure of Reinforcement Learning Hardness. CoRR abs/2110.03424 (2021) - [i11]Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Fast Algorithms for Hop-Constrained Flows and Moving Cuts. CoRR abs/2111.01422 (2021) - 2020
- [j1]D. Ellis Hershkowitz, Gregory Kehne:
Reverse greedy is bad for k-center. Inf. Process. Lett. 158: 105941 (2020) - [c9]Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia:
Computation-Aware Data Aggregation. ITCS 2020: 65:1-65:38 - [i10]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. CoRR abs/2001.00072 (2020) - [i9]D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph. CoRR abs/2011.06108 (2020) - [i8]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Tree Embeddings for Hop-Constrained Network Design. CoRR abs/2011.06112 (2020)
2010 – 2019
- 2019
- [c8]David Ellis Hershkowitz, R. Ravi, Sahil Singla:
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. APPROX-RANDOM 2019: 4:1-4:19 - [c7]Yuu Jinnai, David Abel, David Ellis Hershkowitz, Michael L. Littman, George Dimitri Konidaris:
Finding Options that Minimize Planning Time. ICML 2019: 3120-3129 - [c6]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. DISC 2019: 10:1-10:17 - 2018
- [c5]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Round- and Message-Optimal Distributed Graph Algorithms. PODC 2018: 119-128 - [i7]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Round- and Message-Optimal Distributed Part-Wise Aggregation. CoRR abs/1801.05127 (2018) - [i6]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. CoRR abs/1805.04165 (2018) - [i5]Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia:
A Computational Approach to Organizational Structure. CoRR abs/1806.05701 (2018) - [i4]D. Ellis Hershkowitz, Gregory Kehne:
Reverse Greedy is Bad for k-Center. CoRR abs/1810.01834 (2018) - [i3]D. Ellis Hershkowitz, R. Ravi, Sahil Singla:
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. CoRR abs/1811.11635 (2018) - 2017
- [c4]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. PODC 2017: 33-42 - [i2]David Abel, D. Ellis Hershkowitz, Michael L. Littman:
Near Optimal Behavior via Approximate State Abstraction. CoRR abs/1701.04113 (2017) - [i1]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. CoRR abs/1705.07369 (2017) - 2016
- [c3]David Abel, D. Ellis Hershkowitz, Michael L. Littman:
Near Optimal Behavior via Approximate State Abstraction. ICML 2016: 2915-2923 - 2015
- [c2]David Ellis Hershkowitz, James MacGlashan, Stefanie Tellex:
Learning Propositional Functions for Planning and Reinforcement Learning. AAAI Fall Symposia 2015: 38-45 - [c1]David Abel, D. Ellis Hershkowitz, Gabriel Barth-Maron, Stephen Brawner, Kevin O'Farrell, James MacGlashan, Stefanie Tellex:
Goal-Based Action Priors. ICAPS 2015: 306-314
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
