Sciweavers

TCS
1998
13 years 11 months ago
A Partial k-Arboretum of Graphs with Bounded Treewidth
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
Hans L. Bodlaender
EUROCRYPT
1993
Springer
14 years 3 months ago
Differentially Uniform Mappings for Cryptography
This work is motivated by the observation that in DES-like ciphexs it is possible to choose the round functions in such a way that every non-trivial one-round characteristic has sm...
Kaisa Nyberg