A lower bound for integer multiplication with read-once branching programs
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
Theoretical Computer Science
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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)
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
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
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
Comparing the sizes of nondeterministic branching read-k-times programs
Discrete Applied Mathematics
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On multi-partition communication complexity
Information and Computation
On the computational power of probabilistic and quantum branching program
Information and Computation
Lower bounds for restricted read-once parity branching programs
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
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Expanders and time-restricted branching programs
Theoretical Computer Science
A nondeterministic space-time tradeoff for linear codes
Information Processing Letters
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
On the computational power of probabilistic and quantum branching program
Information and Computation
On multi-partition communication complexity
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Theoretical Computer Science
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the incompressibility of monotone DNFs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On some bounds on the size of branching programs (a survey)
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
| Hi-index | 0.01 |