A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Explicit construction of exponential sized families of K-independent sets
Discrete Mathematics
The monotone circuit complexity of Boolean functions
Combinatorica
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A simple lower bound for monotone clique using a communication game
Information Processing Letters
Monotone circuits for matching require linear depth
Journal of the ACM (JACM)
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Poceedings of the London Mathematical Society symposium on Boolean function complexity
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for monotone span programs
Computational Complexity
Communication complexity
Counting bottlenecks to show monotone P ? NP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Superpolynomial Lower Bounds for Monotone Span Programs
Superpolynomial Lower Bounds for Monotone Span Programs
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A note on monotone complexity and the rank of matrices
Information Processing Letters
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms (TALG)
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
| Hi-index | 0.00 |