research
∙
05/15/2023
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
Mixed-integer linear programming (MILP) is at the core of many advanced ...
share
research
∙
02/13/2023
DASH: Accelerating Distributed Private Machine Learning Inference with Arithmetic Garbled Circuits
The adoption of machine learning solutions is rapidly increasing across ...
research
∙
08/10/2021
Util::Lookup: Exploiting key decoding in cryptographic libraries
Implementations of cryptographic libraries have been scrutinized for sec...
research
∙
07/28/2021
Load Balancing: The Long Road from Theory to Practice
There is a long history of approximation schemes for the problem of sche...
research
∙
04/20/2021
Robust Online Algorithms for Dynamic Choosing Problems
Semi-online algorithms that are allowed to perform a bounded amount of r...
research
∙
10/19/2020
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
We consider ILPs, where each variable corresponds to an integral point w...
research
∙
07/06/2020
Solving Packing Problems with Few Small Items Using Rainbow Matchings
An important area of combinatorial optimization is the study of packing ...
research
∙
06/18/2020
New Bounds for the Vertices of the Integer Hull
The vertices of the integer hull are the integral equivalent to the well...
research
∙
05/20/2019
Robust Online Algorithms for Dynamic Problems
Online algorithms that allow a small amount of migration or recourse hav...
research
∙
05/03/2019
Positive-Instance Driven Dynamic Programming for Graph Searching
Research on the similarity of a graph to being a tree - called the treew...
research
∙
04/13/2019
Online Bin Covering with Limited Migration
Semi-online models where decisions may be revoked in a limited way have ...
research
∙
06/26/2018
Practical Access to Dynamic Programming on Tree Decompositions
Parameterized complexity theory has lead to a wide range of algorithmic ...
research
∙
01/24/2018