Result 1 to 20 of 85 total
Better short-seed quantum-proof extractors. (English)
Theor. Comput. Sci. 419, 17-25 (2012).
1
Short seed extractors against quantum storage. (English)
SIAM J. Comput. 40, No. 3, 664-677 (2011).
2
A combinatorial construction of almost-Ramanujan graphs using the zig-zag product. (English)
SIAM J. Comput. 40, No. 2, 267-290 (2011).
3
Approximate quantum error correction for correlated noise (English)
IEEE Transactions on Information Theory 57, No. 6, 3982-3988 (2011).
4
Quantum expanders: motivation and construction. (English)
Theory Comput. 6, Paper No. 3, 47-79, electronic only (2010).
5
On the complexity of approximating the diamond norm. (English)
Quantum Inf. Comput. 10, No. 1-2, 77-86 (2010).
6
Quantum expanders: motivation and construction (English)
Theory of Computing 6, No. 1, 47-79 (2010).
7
On the complexity of approximating the diamond norm (English)
Quantum Information & Computation 10, No. 1-2, 77-86 (2010).
8
Local list decoding with a constant number of queries (English)
FOCS, 715-722 (2010).
9
Non-interactive timestamping in the bounded-storage model. (English)
J. Cryptology 22, No. 2, 189-226 (2009).
10
Constructing small-bias sets from algebraic-geometric codes (English)
FOCS, 191-197 (2009).
11
Short seed extractors against quantum storage (English)
STOC, 401-408 (2009).
12
A combinatorial construction of almost-Ramanujan graphs using the zig-zag product. (English)
STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17‒20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 325-334 (2008).
13
Quantum expanders: motivation and constructions (English)
IEEE Conference on Computational Complexity, 292-303 (2008).
14
A combinatorial construction of almost-Ramanujan graphs using the zig-zag product (English)
STOC, 325-334 (2008).
15
On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy. (English)
Theory Comput. 3, Paper No. 3, 45-60, electronic only (2007).
16
Worst-case to average-case reductions revisited. (English)
Charikar, Moses (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20‒22, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74207-4/pbk). Lecture Notes in Computer Science 4627, 569-583 (2007).
17
Interaction in quantum communication. (English)
IEEE Trans. Inf. Theory 53, No. 6, 1970-1982 (2007).
18
Adiabatic quantum state generation. (English)
SIAM J. Comput. 37, No. 1, 47-82 (2007).
19
If NP languages are hard on the worst-case, then it is easy to find their hard instances. (English)
Comput. Complexity 16, No. 4, 412-441 (2007).
20
Result 1 to 20 of 85 total
Start
Contact
Print
General Help
