- Aleksandrs Belovs, Eric Blais, “A Polynomial Lower Bound for Testing Monotonicity”, SIAM J. Comput., 50, no. 3, 2021, STOC16-406
- Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary, 7422, Combinatorial Optimization, 2012, 129
- Mohsen Ghaffari, Fabian Kuhn, 8205, Distributed Computing, 2013, 1
- Dmitry Gavinsky, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 401
- Will Rosenbaum, Jukka Suomela, Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, 89
- François Le Gall, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006, 67
- Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014, 166
- Juraj Hromkovič, Georg Schnitger, 2719, Automata, Languages and Programming, 2003, 66
- Sima Hajiaghaei Shanjani, Valerie King, Proceedings of the 22nd International Conference on Distributed Computing and Networking, 2021, 36
- Stasys Jukna, “On the P versus NP intersected with co-NP question in communication complexity”, Information Processing Letters, 96, no. 6, 2005, 202