Secure Distributed Linear Algebra in a Constant Number of Rounds
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
The complexity of tensor calculus
Computational Complexity
Information Processing Letters
The Complexity of Tensor Circuit Evaluation
Computational Complexity
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
From secrecy to soundness: efficient verification via secure computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
Counting paths in planar width 2 branching programs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Hi-index | 0.00 |