Spremljaj
Elfarouk Harb
Naslov
Navedeno
Navedeno
Leto
KFC: A Scalable Approximation Algorithm for −center Fair Clustering
E Harb, HS Lam
Advances in neural information processing systems 33, 14509-14519, 2020
362020
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
262022
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
202021
Polynomial time algorithms for constructing optimal AIFV codes
M Golin, E Harb
2019 Data Compression Conference (DCC), 231-240, 2019
142019
A polynomial time algorithm for constructing optimal binary aifv-2 codes
M Golin, E Harb
IEEE Transactions on Information Theory 69 (10), 6269-6278, 2023
132023
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
92023
Fishing for better constants: The prophet secretary via poissonization
E Harb
arXiv preprint arXiv:2307.00971, 2023
42023
New prophet inequalities via poissonization and sharding
E Harb
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
22025
Oracle-Augmented Prophet Inequalities
S Har-Peled, E Harb, V Livanos
arXiv preprint arXiv:2404.11853, 2024
22024
Revisiting Random Points: Combinatorial Complexity and Algorithms
S Har-Peled, E Harb
2024 Symposium on Simplicity in Algorithms (SOSA), 244-268, 2024
12024
ReFill: Reinforcement Learning for Fill-In Minimization
E Harb, HS Lam
arXiv preprint arXiv:2501.16130, 2025
2025
Shortest Path Separators in Unit Disk Graphs
E Harb, Z Huang, DW Zheng
arXiv preprint arXiv:2407.15980, 2024
2024
Polynomial Time Algorithms for Constructing Optimal AIFV Codes
EYF Harb, MJ Golin
Data Compression Conference Proceedings, 2019
2019
A New Separator Theorem for Unit Disk Graphs
E Harb, Z Huang
Computational Geometry: Young Researchers Forum 2024—book of abstracts—, 59, 0
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–14