- Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh. Lower bounds for linear decision lists. Chicago J. Theor. Comput. Sci., 2020, 2020.
- Dmitry Gavinsky. The communication complexity of the inevitable intersection problem. Chicago J. Theor. Comput. Sci., 2020, 2020.
- Rohit Agrawal 0002. Coin Theorems and the Fourier Expansion. Chicago J. Theor. Comput. Sci., 2020, 2020.
- Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. Chicago J. Theor. Comput. Sci., 2020, 2020.
- Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price. Collision-Based Testers are Optimal for Uniformity and Closeness. Chicago J. Theor. Comput. Sci., 2019, 2019.
- Ishay Haviv, Michael Langberg. H-wise Independence. Chicago J. Theor. Comput. Sci., 2019, 2019.
- Guillaume Lagarde, Guillaume Malod, Sylvain Perifel. Non-commutative computations: lower bounds and polynomial identity testing. Chicago J. Theor. Comput. Sci., 2019, 2019.
- Jan Krajícek, Igor Carboni Oliveira. On monotone circuits with local oracles and clique lower bounds. Chicago J. Theor. Comput. Sci., 2018, 2018.
- Markus Bläser, Matthias Christandl, Jeroen Zuiddam. The border support rank of two-by-two matrix multiplication is seven. Chicago J. Theor. Comput. Sci., 2018, 2018.
- Oded Goldreich 0001, Tom Gur. Universal Locally Testable Codes. Chicago J. Theor. Comput. Sci., 2018, 2018.