945 search results - page 75 / 189 » On the robustness of primitive words |
158
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
168
click to vote
IJACI
2010
15 years 4 months ago
2010
Abstract. Ambient computing requires the integration of multiple mobile heterogeneous networks. Multi-path communication, in such scenarios, can provide reliability and privacy ben...
170
click to vote
FMCO
2009
Springer
15 years 4 months ago
2009
Springer
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...
151
click to vote
TCS
2010
15 years 27 days ago
2010
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
277
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...