Sciweavers

1969 search results - page 105 / 394
» Financial Theory 1
Sort
View
STTT
2010
92views more  STTT 2010»
15 years 1 months ago
Don't care in SMT: building flexible yet efficient abstraction/refinement solvers
ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
15 years 10 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui
JGT
2010
57views more  JGT 2010»
15 years 4 months ago
NZ-flows in strong products of graphs
: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cu...
ECSQARU
2001
Springer
15 years 11 months ago
Social Choice, Merging, and Elections
Abstract. Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merg...
Thomas Andreas Meyer, Aditya Ghose, Samir Chopra
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
15 years 10 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers