Sciweavers

Share
CC
2016
Springer
4 years 8 months ago
The complexity of estimating min-entropy
Goldreich, Sahai, and Vadhan (CRYPTO 1999) proved that the promise problem for estimating the Shannon entropy of a distribution sampled by a given circuit is NISZK-complete. We co...
Thomas Watson
CC
2016
Springer
4 years 8 months ago
Combinatorial PCPs with Short Proofs
The PCP theorem (Arora et. al., J. ACM 45(1,3)) asserts the existence of proofs that can be verified by reading a very small part of the proof. Since the discovery of the theorem...
Or Meir
CC
2016
Springer
4 years 8 months ago
Quantum commitments from complexity assumptions
Abstract. We study worst-case complexity assumptions that imply quantum bitcommitment schemes. First we show that QSZK ⊆ QMA implies a computationally hiding and statistically bi...
André Chailloux, Iordanis Kerenidis, Bill R...
CC
2016
Springer
4 years 8 months ago
Safe and flexible adaptation via alternate data structure representations
The choice of data structures is crucial for achieving high performance. For applications that are long-running and/or operate on large data sets, the best choice for main data st...
Amlan Kusum, Iulian Neamtiu, Rajiv Gupta
CC
2016
Springer
4 years 8 months ago
Reachability and error diagnosis in LR(1) parsers
Given an LR(1) automaton, what are the states in which an error can be detected? For each such “error state”, what is a minimal input sentence that causes an error in this sta...
François Pottier
CC
2016
Springer
4 years 8 months ago
SVF: interprocedural static value-flow analysis in LLVM
This paper presents SVF, a tool that enables scalable and precise interprocedural Static Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF, ...
Yulei Sui, Jingling Xue
CC
2016
Springer
4 years 8 months ago
Input space splitting for OpenCL
The performance of OpenCL programs suffers from memory and control flow divergence. Therefore, OpenCL compilers employ static analyses to identify non-divergent control flow and...
Simon Moll, Johannes Doerfert, Sebastian Hack
CC
2016
Springer
4 years 8 months ago
GreenThumb: superoptimizer construction framework
Developing an optimizing compiler backend remains a laborious process, especially for nontraditional ISAs that have been appearing recently. Superoptimization sidesteps the need f...
Phitchaya Mangpo Phothilimthana, Aditya Thakur, Ra...
books