Sciweavers

1226 search results - page 112 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
142
Voted
AGP
1998
IEEE
15 years 7 months ago
Some Design Issues in the Visualization of Constraint Logic Program Execution
Visualization of program executions has been found useful in applications which include education and debugging. However, traditional visualization techniques often fall short of ...
Manuel Carro, Manuel V. Hermenegildo
ICALP
2007
Springer
15 years 9 months ago
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
ASIACRYPT
2008
Springer
15 years 5 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
226
Voted
FORTE
2011
14 years 7 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
IPPS
2009
IEEE
15 years 10 months ago
A cross-input adaptive framework for GPU program optimizations
Abstract—Recent years have seen a trend in using graphic processing units (GPU) as accelerators for general-purpose computing. The inexpensive, single-chip, massively parallel ar...
Yixun Liu, Eddy Z. Zhang, Xipeng Shen