The critical complexity of all (monotone) Boolean functions and monotone graph properties
Information and Control
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A zero-one law for Boolean privacy
SIAM Journal on Discrete Mathematics
SIAM Journal on Computing
Lower bounds for the complexity of reliable boolean circuits with noisy gates
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reliable computation with noisy circuits and decision trees—a general n log n lower bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Privacy and communication complexity
SIAM Journal on Discrete Mathematics
The equivalence of two problems on the cube
Journal of Combinatorial Theory Series A
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Private Computations Over the Integers
SIAM Journal on Computing
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A Randomness-Rounds Tradeoff in Private Computation
SIAM Journal on Discrete Mathematics
On the Number of Random Bits in Totally Private Computation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Security with Low Communication Overhead
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Private Simultaneous Messages Protocols with Applications
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Private Computations in Networks: Topology versus Randomness
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Private Computation - k-Connected versus 1-Connected Networks
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.00 |