On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
On lower bounds for read-k-times branching programs
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth 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
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
An Exponential Lower Bound for One-Time-Only Branching Programs
Proceedings of the Mathematical Foundations of Computer Science 1984
On the Power of Randomized Branching Programs
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
De-Randomizing BPP: The State of the Art
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Weak random sources, hitting sets, and BPP simulations
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Time-Space Tradeoffs for Branching Programs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The recognition problem for the set of perfect squares
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On multi-partition communication complexity
Information and Computation
| Hi-index | 0.00 |
Branching programs are a graphical representation of Boolean functions which are considered as a nonuniform model of computation in complexity theory and are also used as a data structure in practice. The talk discusses randomized variants of branching programs which allow to study the relative power of deterministic, nondeterministic, and randomized algorithms in a scenario where space is the primary resource.