17366 search results - page 3373 / 3474 » New Revision Algorithms |
113
Voted
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
146
click to vote
FSE
1994
Springer
15 years 8 months ago
1994
Springer
This paper shows that the actual proposal for an unbalanced Feistel network by Schneier and Blaze is as vulnerable to differential cryptanalysis as the DES. 1 McGuffin Schneier and...
125
click to vote
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
145
Voted
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
157
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...