1650 search results - page 87 / 330 » The HOM problem is decidable |
134
click to vote
RTA
2007
Springer
16 years 5 days ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
185
click to vote
ISPDC
2006
IEEE
16 years 2 days ago
2006
IEEE
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
157
click to vote
LICS
2006
IEEE
16 years 2 days ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
178
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
169
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...