3238 search results - page 379 / 648 » Multi-return function call |
184
Voted
PKC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
194
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
163
click to vote
ICS
2001
Tsinghua U.
15 years 11 months ago
2001
Tsinghua U.
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
137
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
190
click to vote
PASTE
1999
ACM
15 years 11 months ago
1999
ACM
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...