Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On uncertainty versus size in branching programs
Theoretical Computer Science
On multi-partition communication complexity
Information and Computation
Expanders and time-restricted branching programs
Theoretical Computer Science
A nondeterministic space-time tradeoff for linear codes
Information Processing Letters
On multi-partition communication complexity
Information and Computation
Theoretical Computer Science
| Hi-index | 0.05 |