research
∙
02/20/2023
Fair k-Center: a Coreset Approach in Low Dimensions
Center-based clustering techniques are fundamental in some areas of mach...
share
research
∙
03/01/2021
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons
We present a simple O(n^4)-time algorithm for computing optimal search t...
research
∙
03/01/2021
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons
Search trees are commonly used to implement access operations to a set o...
research
∙
02/23/2020
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
AIFV-2 codes are a new method for constructing lossless codes for memory...
research
∙
01/30/2020
Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes
Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in ...
research
∙
12/28/2019
Minmax Regret for sink location on paths with general capacities
In dynamic flow networks, every vertex starts with items (flow) that nee...
research
∙
01/12/2019
On Huang and Wong's Algorithm for Generalized Binary Split Trees
Huang and Wong [5] proposed a polynomial-time dynamic-programming algori...
research
∙
07/18/2018
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions
The Maximal points in a set S are those that aren't dominated by any o...
research
∙
06/27/2018
