
Util::Lookup: Exploiting key decoding in cryptographic libraries
Implementations of cryptographic libraries have been scrutinized for sec...
read it

Load Balancing: The Long Road from Theory to Practice
There is a long history of approximation schemes for the problem of sche...
read it

Robust Online Algorithms for Dynamic Choosing Problems
Semionline algorithms that are allowed to perform a bounded amount of r...
read it

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
We consider ILPs, where each variable corresponds to an integral point w...
read it

Solving Packing Problems with Few Small Items Using Rainbow Matchings
An important area of combinatorial optimization is the study of packing ...
read it

New Bounds for the Vertices of the Integer Hull
The vertices of the integer hull are the integral equivalent to the well...
read it

Robust Online Algorithms for Dynamic Problems
Online algorithms that allow a small amount of migration or recourse hav...
read it

PositiveInstance Driven Dynamic Programming for Graph Searching
Research on the similarity of a graph to being a tree  called the treew...
read it

Online Bin Covering with Limited Migration
Semionline models where decisions may be revoked in a limited way have ...
read it

Practical Access to Dynamic Programming on Tree Decompositions
Parameterized complexity theory has lead to a wide range of algorithmic ...
read it

On the Gold Standard for Security of Universal Steganography
While symmetrickey steganography is quite well understood both in the i...
read it
Sebastian Berndt
is this you? claim profile