1650 search results - page 111 / 330 » The HOM problem is decidable |
LFCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
LPAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
ESORICS
2004
Springer
14 years 3 months ago
2004
Springer
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...
LCN
2003
IEEE
14 years 3 months ago
2003
IEEE
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...