Sciweavers

254 search results - page 26 / 51
» Binary amiable Words
Sort
View
CONCUR
2004
Springer
15 years 4 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
ENTCS
2006
174views more  ENTCS 2006»
14 years 11 months ago
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
Jörn Ossowski, Christel Baier
91
Voted
IJNSEC
2008
135views more  IJNSEC 2008»
14 years 11 months ago
Software Implementations of Elliptic Curve Cryptography
Elliptic Curve Cryptography (ECC) is a promising alternative for public-key algorithms in resource-constrained systems because it provides a similar level of security with much sh...
Zhijie Jerry Shi, Hai Yun
228
Voted
CORR
2010
Springer
368views Education» more  CORR 2010»
14 years 11 months ago
Quasigroups in cryptology
It is surveyed known (published) possible application of binary and n-ary quasigroups in cryptology. Mathematics Subject Classification: 20N05, 94A60. Key words and phrases: Crypto...
V. A. Shcherbacov
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
14 years 11 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen