1399 search results - page 183 / 280 » Multi-party Finite Computations |
149
click to vote
LOPSTR
1994
Springer
15 years 8 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
133
click to vote
STOC
1992
ACM
15 years 8 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
152
click to vote
APLAS
2007
ACM
15 years 8 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
135
click to vote
ASIACRYPT
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
131
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...