-
Upper Tail Analysis of Bucket Sort and Random Tries
Bucket Sort is known to run in expected linear time when the input keys ...
02/24/2020 ∙ by Ioana O. Bercea, et al. ∙
0
∙
share
read it
-
Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses
A fully-dynamic dictionary is a data structure for maintaining sets that...
11/12/2019 ∙ by Ioana O. Bercea, et al. ∙
0
∙
share
read it
-
On the cost of essentially fair clusterings
Clustering is a fundamental tool in data mining. It partitions points in...
11/26/2018 ∙ by Ioana O. Bercea, et al. ∙
0
∙
share
read it
-
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks
Given a set of n disks of radius R in the Euclidean plane, the Traveling...
09/19/2018 ∙ by Ioana O. Bercea, et al. ∙
0
∙
share
read it
