163 search results - page 7 / 33 » Composition Theorems in Communication Complexity |
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
61
Voted
ICDCS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-en...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
WMCSA
2009
IEEE
15 years 4 months ago
2009
IEEE
Context–Aware Composition is a technique to overcome the complexity of wireless discovery, device selection, and establishing connections to other computers in an environment wh...
ICSE
2003
IEEE-ACM
15 years 9 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...