Efficient Parallel Pseudo-Random Number Generation
CRYPTO '85 Advances in Cryptology
Hardness of Approximating the Minimum Distance of a Linear Code
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Typically-correct derandomization
ACM SIGACT News
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Other complexity classes and measures
Algorithms and theory of computation handbook
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Simplified derandomization of BPP using a hitting set generator
Studies in complexity and cryptography
Linear advice for randomized logarithmic space
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Valiant's model: from exponential sums to exponential products
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Theoretical Computer Science
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Symmetry of information and nonuniform lower bounds
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Searchable symmetric encryption: Improved definitions and efficient constructions
Journal of Computer Security
| Hi-index | 0.00 |