1. On (simple) decision tree rank;dahiya;Proceedings of the 41st oundations of Software Technology and Theoretical Computer Science (FSTTCS),2021
2. A composition theorem for randomized query complexity via max-conflict complexity;gavinsky;Proc Int'l Colloquium on Automata Languages and Programming (ICALP),2019
3. Randomized communication versus partition number;göös;ACM Transactions on Computation Theory,2018
4. Randomized query complexity of sabotaged and composed functions;ben-david;Proc Int'l Colloquium on Automata Languages and Programming (ICALP),2016