Elfarouk Harb

most citedPolynomial Time Algorithms for Constructing Optimal Binary AIFV-

2

Codes

3 citations · 6 across the 3 of their papers we have counts for

collaborators

3 papers

cs.LG2020★ 3 cited

KFC: A Scalable Approximation Algorithm for $k$ -center Fair Clustering

Elfarouk Harb, Ho Shan Lam

In this paper, we study the problem of fair clustering on the $k -$ center objective. In fair clustering, the input is $N$ points, each belonging to at least one of $l$ protected gro…

cs.DS2020

Speeding up the AIFV- $2$ dynamic programs by two orders of magnitude using Range Minimum Queries

Mordecai Golin, Elfarouk Harb

AIFV- $2$ codes are a new method for constructing lossless codes for memoryless sources that provide better worst-case redundancy than Huffman codes. They do this by using two code…

cs.IT2020★ 3 cited

Polynomial Time Algorithms for Constructing Optimal Binary AIFV- $2$ Codes

Mordecai Golin, Elfarouk Harb

Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these constraints permits constructi…

KFC: A Scalable Approximation Algorithm for k-center Fair Clustering

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries

Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes

KFC: A Scalable Approximation Algorithm for $k$ -center Fair Clustering

Speeding up the AIFV- $2$ dynamic programs by two orders of magnitude using Range Minimum Queries

Polynomial Time Algorithms for Constructing Optimal Binary AIFV- $2$ Codes