On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On multi-partition communication complexity
Information and Computation
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science
A note on the decoding complexity of error-correcting codes
Information Processing Letters
Expanders and time-restricted branching programs
Theoretical Computer Science
A nondeterministic space-time tradeoff for linear codes
Information Processing Letters
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
On multi-partition communication complexity
Information and Computation
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |