KFC: A Scalable Approximation Algorithm for E Harb, HS Lam
Advances in neural information processing systems 33, 14509-14519, 2020
29 2020 Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries M Golin, E Harb
Theoretical Computer Science 865, 99-118, 2021
13 2021 Polynomial time algorithms for constructing optimal aifv codes M Golin, E Harb
2019 Data Compression Conference (DCC), 231-240, 2019
11 2019 Faster and scalable algorithms for densest subgraph and decomposition E Harb, K Quanrud, C Chekuri
Advances in Neural Information Processing Systems 35, 26966-26979, 2022
9 2022 A polynomial time algorithm for constructing optimal binary aifv-2 codes M Golin, E Harb
IEEE Transactions on Information Theory, 2023
7 2023 Convergence to Lexicographically Optimal Base in a (Contra) Polymatroid and Applications to Densest Subgraph and Tree Packing E Harb, K Quanrud, C Chekuri
arXiv preprint arXiv:2305.02987, 2023
2 2023 Revisiting Random Points: Combinatorial Complexity and Algorithms S Har-Peled, E Harb
2024 Symposium on Simplicity in Algorithms (SOSA), 244-268, 2024
1 2024 Oracle-Augmented Prophet Inequalities S Har-Peled, E Harb, V Livanos
arXiv preprint arXiv:2404.11853, 2024
2024 Fishing For Better Constants: The Prophet Secretary Via Poissonization E Harb
arXiv preprint arXiv:2307.00971, 2023
2023 Polynomial Time Algorithms for Constructing Optimal AIFV Codes EYF Harb, MJ Golin
Data Compression Conference Proceedings, 2019
2019 