| 2021 | LICS | Multi-Structural Games and Number of Quantifiers. | Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas |
| 2015 | ICAART | Quantifying Depth and Complexity of Thinking and Knowledge. | Tamal T. Biswas, Kenneth W. Regan |
| 2015 | ICMLA | Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. | Tamal Biswas, Kenneth W. Regan |
| 2014 | AAIM | Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. | Tamal Biswas, Kenneth W. Regan |
| 2011 | MFCS | Symmetric Functions Capture General Functions. | Richard J. Lipton, Kenneth W. Regan, Atri Rudra |
| 2010 | MFCS | Improved Simulation of Nondeterministic Turing Machines. | Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh |
| 2009 | CIDM | Skill rating by Bayesian inference. | Giuseppe Di Fatta, G. McC. Haworth, Kenneth W. Regan |
| 2007 | COCOON | "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. | Maurice J. Jansen, Kenneth W. Regan |
| 2004 | MFCS | A Protocol for Serializing Unique Strategies. | Marcel Crsmaru, Christian Glaer, Kenneth W. Regan, Samik Sengupta |
| 2002 | STACS | Games with a Uniqueness Property. | Shin Aida, Marcel Crsmaru, Kenneth W. Regan, Osamu Watanabe |
| 1998 | STACS | A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss |
| 1995 | FOCS | Pseudorandom Generators, Measure Theory, and Natural Proofs. | Kenneth W. Regan, D. Sivakumar, Jin-yi Cai |
| 1995 | STACS | Communication Complexity of Key Agreement on Small Ranges. | Jin-yi Cai, Richard J. Lipton, Luc Longpr, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar |
| 1994 | STACS | Quasilinear Time Complexity Theory. | Ashish V. Naik, Kenneth W. Regan, D. Sivakumar |
| 1994 | STACS | A New Parallel Vector Model, with Exact Characterization of NC^k. | Kenneth W. Regan |
| 1993 | ICCI | On the Difference Between Turing Machine Time and Random-Access Machine Time. | Kenneth W. Regan |
| 1986 | ICALP | A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. | Kenneth W. Regan |
| 1983 | FCT | On Diagonalization Methods and the Structure of Language Classes. | Kenneth W. Regan |