• Publications
  • Influence
Quantifying the information leak in cache attacks via symbolic execution
TLDR
At the core of CHALICE is a novel approach to quantify information leak that can highlight critical cache side-channel leaks on arbitrary binary code. Expand
Emptiness Problems for Integer Circuits
TLDR
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a major open problem in algebraic computing complexity. Expand
Quantifying the Information Leakage in Cache Attacks via Symbolic Execution
TLDR
At the core of CHALICE is a novel approach to quantify information leakage that can highlight critical cache side-channel leakage on arbitrary binary code. Expand
Quantifying the Information Leak in Cache Attacks through Symbolic Execution
TLDR
At the core of CHALICE is a novel approach to quantify information leak that can highlight critical cache side-channel leaks on arbitrary binary code. Expand
Planar Steiner Orientation is NP-complete
TLDR
A further restriction to planar graphs is considered and NP -completeness of Steiner Orientation is shown, showing W [1]-hardness of the problem for graphs of genus 1. Expand
Emptiness problems for integer circuits
TLDR
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a well-studied, major open problem in algebraic computing complexity. Expand
Puzzling Grid Embeddings
Minimum Polygons for Fixed Visibility VC-Dimension
TLDR
This paper seeks to find minimum polygons for each class, that is, polygons with a minimum number of vertices for each fixed visibility VC-dimension d, and shows that for \(d < 4\) the respectiveminimum polygons exhibit only few different visibility structures, which can be represented by so called visibility strings. Expand
An Extended Modular Processing Pipeline for Event-Based Vision in Automatic Visual Inspection
TLDR
This paper evaluates current state-of-the-art processing algorithms in automatic visual inspection of Dynamic Vision Sensors and proposes an algorithmic approach for the identification of ideal time windows within an event stream for object classification. Expand
...
1
2
...