Sciweavers

1302 search results - page 42 / 261
» On the Strong Chromatic Number
Sort
View
FSE
2006
Springer
166views Cryptology» more  FSE 2006»
15 years 10 months ago
A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
We present PEP, which is a new construction of a tweakable strong pseudo-random permutation. PEP uses a hash-encrypt-hash approach which has recently been used in the construction...
Debrup Chakraborty, Palash Sarkar
FORMATS
2008
Springer
15 years 7 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
JSCIC
2006
98views more  JSCIC 2006»
15 years 6 months ago
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
Sigal Gottlieb, Steven J. Ruuth
EATCS
2000
85views more  EATCS 2000»
15 years 6 months ago
A New Zero-One Law and Strong Extension Axioms
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Andreas Blass, Yuri Gurevich
DSD
2010
IEEE
133views Hardware» more  DSD 2010»
15 years 3 months ago
Area and Speed Oriented Implementations of Asynchronous Logic Operating under Strong Constraints
Asynchronous circuit implementations operating under strong constraints (DIMS, Direct Logic, some of NCL gates, etc.) are attractive due to: 1) regularity; 2) combined implementati...
Igor Lemberski, Petr Fiser