← Search

Alex Elenter

2 accepted papers

2025

Scenario-Based Robust Optimization of Tree Structures

AAAI 2025technical

We initiate the study of tree structures in the context of scenario-based robust optimization. Specifically, we study Binary Search Trees (BSTs) and Huffman coding, two fundamental techniques for efficiently managing and encoding data based on a known set of frequencies of keys. Given a number of di…

Cited by 0SourcePDFScholar
2024

Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms

NeurIPS 2024poster

The study of online algorithms with machine-learned predictions has gained considerable prominence in recent years. One of the common objectives in the design and analysis of such algorithms is to attain (Pareto) optimal tradeoffs between the {\em consistency} of the algorithm, i.e., its performance…

Cited by 3SourcePDFScholar