| 2013 | ICFP | Functional geometry and the Trait de Lutherie: functional pearl. | Harry G. Mairson |
| 2008 | ICFP | Deciding | David Van Horn, Harry G. Mairson |
| 2008 | SAS | Flow Analysis, Linearity, and PTIME. | David Van Horn, Harry G. Mairson |
| 2007 | ICFP | Relating complexity and precision in control flow analysis. | David Van Horn, Harry G. Mairson |
| 2004 | ICFP | Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. | Peter Mller Neergaard, Harry G. Mairson |
| 2003 | ICFP | From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. | Harry G. Mairson |
| 2002 | CSL | Proofnets and Context Semantics for the Additives. | Harry G. Mairson, Xavier Rival |
| 2000 | ESOP | Sharing Continuations: Proofnets for Languages with Explicit Control. | Julia L. Lawall, Harry G. Mairson |
| 1999 | ICFP | Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). | Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells |
| 1998 | POPL | Parallel Beta Reduction is not Elementary Recursive. | Andrea Asperti, Harry G. Mairson |
| 1997 | ICFP | on Global Dynamics of Optimal Graph Reduction. | Julia L. Lawall, Harry G. Mairson |
| 1996 | CP | Complexity-Theoretic Aspects for Programming Language Design. | Harry G. Mairson |
| 1996 | ICFP | Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? | Julia L. Lawall, Harry G. Mairson |
| 1994 | ICALP | An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. | Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson |
| 1993 | LICS | Database Query Languages Embedded in the Typed Lambda Calculus | Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson |
| 1993 | POPL | A Constructive Logic of Multiple Subtyping. | Harry G. Mairson |
| 1991 | PODS | Tools for Datalog Boundedness. | Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi |
| 1991 | POPL | The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. | Fritz Henglein, Harry G. Mairson |
| 1990 | POPL | Deciding ML Typability is Complete for Deterministic Exponential Time. | Harry G. Mairson |
| 1987 | LICS | Undecidable Optimization Problems for Database Logic Programs | Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi |
| 1985 | FOCS | Average Case Lower Bounds on the Construction and Searching of Partial Orders | Harry G. Mairson |
| 1984 | STOC | Correcting Faults in Write-Once Memory | Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman |
| 1983 | FOCS | The Program Complexity of Searching a Table | Harry G. Mairson |