6142 search results - page 1098 / 1229 » The Complexity of Partition Functions |
140
click to vote
CSFW
2002
IEEE
15 years 9 months ago
2002
IEEE
We describe a protocol design process, and illustrate its use by creating ATSPECT, an Authentication Test-based Secure Protocol for Electronic Commerce Transactions. The design pr...
157
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
161
click to vote
SAC
2009
ACM
15 years 9 months ago
2009
ACM
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
139
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
149
click to vote
CRYPTO
2001
Springer
15 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...