738 search results - page 72 / 148 » cases 2001 |
156
click to vote
CC
2001
Springer
15 years 10 months ago
2001
Springer
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
144
click to vote
COCOON
2001
Springer
15 years 10 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
159
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
139
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
145
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...