Sciweavers

523 search results - page 101 / 105
» On the Power of Quantum Proofs
Sort
View
POPL
1995
ACM
15 years 3 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
CCS
2008
ACM
15 years 1 months ago
Efficiently tracking application interactions using lightweight virtualization
In this paper, we propose a general-purpose framework that harnesses the power of lightweight virtualization to track applications interactions in a scalable an efficient manner. ...
Yih Huang, Angelos Stavrou, Anup K. Ghosh, Sushil ...
91
Voted
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
15 years 1 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak
JAC
2008
15 years 1 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
SERVICES
2008
246views more  SERVICES 2008»
15 years 1 months ago
BioFlow: A Web-Based Declarative Workflow Language for Life Sciences
Scientific workflows in Life Sciences are usually complex, and use many online databases, analysis tools, publication repositories and customized computation intensive desktop sof...
Hasan M. Jamil, Bilal El-Hajj-Diab