- Stasys Jukna, “On the P versus NP intersected with co-NP question in communication complexity”, Information Processing Letters, 96, no. 6, 2005, 202
- Detlef Sieling, “Minimization of decision trees is hard to approximate”, Journal of Computer and System Sciences, 74, no. 3, 2008, 394
- Alexander S. Kulikov, Vladimir V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates”, Theory Comput Syst, 63, no. 5, 2019, 956
- Gil Cohen, Igor Shinkar, Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016, 47
- Yogesh Dahiya, Meena Mahajan, “On (simple) decision tree rank”, Theoretical Computer Science, 978, 2023, 114177
- Paul Beame, Vincent Liew, Mihai Pǎtraşcu, 9134, Automata, Languages, and Programming, 2015, 103