8132 search results - page 1299 / 1627 » Dependability, Abstraction, and Programming |
169
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
156
click to vote
HIPC
2000
Springer
15 years 10 months ago
2000
Springer
Within two or three technology generations, processor architects will face a number of major challenges. Wire delays will become critical, and power considerations will temper the ...
196
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract-If data traffic were Poisson, increases in the amount of traffic aggregated on a network would rapidly decrease the relative size of bursts. The discovery of pervasive lon...
154
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Perfect forward secrecy, one of the possible security features provided by key establishment protocols, concerns dependency of a session key upon long-term secret keys (s...
168
click to vote
CRYPTO
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...