#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2005

2017

- This year (3)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
- APPROX-RANDOM
- 2015

We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion. The goal is to minimize the number of used bins at every timestep while repacking of already packed items is allowed. Ivković and Lloyd [IL98] have developed an algorithm with asymptotic competitive ratio of 5/4 using O(log n) (amortized) shifting moves… (More)

- Sebastian Berndt, Maciej Liskiewicz
- ISAAC
- 2016

This paper considers steganography – the concept of hiding the presence of secret messages in legal communications – in the computational setting and its relation to cryptography. Very recently the first (non-polynomial time) steganographic protocol has been shown which, for any communication channel, is provably secure, reliable, and has nearly optimal… (More)

- Max Bannach, Sebastian Berndt, Thorsten Ehlers
- SEA
- 2017

While the theoretical aspects concerning the computation of tree width – one of the most important graph parameters – are well understood, it is not clear how it can be computed practically. We present the open source Java library Jdrasil that implements several different state of the art algorithms for this task. By experimentally comparing these… (More)

- Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
- Electronic Colloquium on Computational Complexity
- 2017

Residuality plays an essential role for learning finite automata. While residual deterministic and nondeterministic automata have been understood quite well, fundamental questions concerning alternating automata (AFA) remain open. Recently, Angluin, Eisenstat, and Fisman [3] have initiated a systematic study of residual AFAs and proposed an algorithm called… (More)

- Sebastian Berndt, Kenneth R Jeffrey, Roland Kuechler, Roland Böhmer
- Solid state nuclear magnetic resonance
- 2005

The motion of silver ions in (AgI)x-(Ag2O-B2O3)1-x glasses with AgI concentrations of x=0.5 and 0.7 was studied using 109Ag-NMR. The NMR spectra were analyzed in terms of a superposition of two different contributions. These are associated with Ag ions, which hop on vastly different time scales. The existence of dynamic heterogeneity, i.e. the existence of… (More)

- Sebastian Berndt, Maciej Liskiewicz
- CCS
- 2017

The goal of an algorithm substitution attack (ASA), also called a subversion attack (SA), is to replace an honest implementation of a cryptographic tool by a subverted one which allows to leak private information while generating output indistinguishable from the honest output. Bellare, Paterson, and Rogaway provided at CRYPTO '14 a formal security model to… (More)

- Sebastian Berndt, Rüdiger Reischuk
- LATA
- 2016

- Sebastian Berndt, Maciej Liskiewicz
- IH&MMSec
- 2016

We present the first complexity-theoretic secure steganographic protocol which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. Our system is unconditionally secure, i.e. our proof does not rely on any unproven complexity-theoretic assumption, like e.g. the existence of one-way functions. This disproves the… (More)

- ‹
- 1
- ›