Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On directional vs. undirectional randomized decision tree complexity for read-once formulas
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
Discrete Applied Mathematics
Bounding the randomized decision tree complexity of read-once Boolean functions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An improved lower bound for the randomized decision tree complexity of recursive majority,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A composition theorem for the fourier entropy-influence conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |