29908 search results - page 25 / 5982 » On the Complexity of |
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
ASIACRYPT
2001
Springer
14 years 5 days ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
CSCWD
2001
Springer
14 years 4 days ago
2001
Springer
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
FSTTCS
1994
Springer
13 years 11 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...