Sciweavers

4255 search results - page 238 / 851
» Cover
Sort
View
CRYPTO
1994
Springer
128views Cryptology» more  CRYPTO 1994»
15 years 10 months ago
Linear Cryptanalysis Using Multiple Approximations
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
Burton S. Kaliski Jr., Matthew J. B. Robshaw
GD
1994
Springer
15 years 10 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
STOC
1993
ACM
179views Algorithms» more  STOC 1993»
15 years 10 months ago
The network inhibition problem
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
Cynthia A. Phillips
APLAS
2009
ACM
15 years 10 months ago
On Stratified Regions
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
Roberto M. Amadio
CSL
2007
Springer
15 years 10 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...