Some New Upper Bounds on the Generation of Prime Numbers. - Harry G. Mairson (Commun. ACM, 1977)

The Program Complexity of Searching a Table - Harry G. Mairson (FOCS, 1983)

Correcting Faults in Write-Once Memory - Danny Dolev; David Maier 001; Harry G. Mairson; Jeffrey D. Ullman (STOC, 1984)

The program complexity of searching a table. - Harry G. Mairson (1984)

Average Case Lower Bounds on the Construction and Searching of Partial Orders - Harry G. Mairson (FOCS, 1985)

Deciding ML Typability is Complete for Deterministic Exponential Time. - Harry G. Mairson (POPL, 1990)

Unification and ML-Type Reconstruction. - Paris C. Kanellakis; Harry G. Mairson; John C. Mitchell (Computational Logic - Essays in Honor of Alan Robinson, 1991)

Outline of a Proof Theory of Parametricity. - Harry G. Mairson (FPCA, 1991)

Tools for Datalog Boundedness. - Gerd G. Hillebrand; Paris C. Kanellakis; Harry G. Mairson; Moshe Y. Vardi (PODS, 1991)

The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. - Harry G. Mairson (BIT, 1992)

Quantifier Elimination and Parametric Polymorphism in Programming Languages. - Harry G. Mairson (J. Funct. Program., 1992)

A Simple Proof of a Theorem of Statman. - Harry G. Mairson (Theor. Comput. Sci., 1992)

A Constructive Logic of Multiple Subtyping. - Harry G. Mairson (POPL, 1993)

Undecidable Optimization Problems for Database Logic Programs. - Haim Gaifman; Harry G. Mairson; Yehoshua Sagiv; Moshe Y. Vardi (J. ACM, 1993)

An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. - Paris C. Kanellakis; Gerd G. Hillebrand; Harry G. Mairson (ICALP, 1994)

Generating Words in a Context-Free Language Uniformly at Random. - Harry G. Mairson (Inf. Process. Lett., 1994)

The Complexity of Type Inference for Higher-Order Typed lambda Calculi. - Fritz Henglein; Harry G. Mairson (J. Funct. Program., 1994)

Undecidable Boundedness Problems for Datalog Programs. - Gerd G. Hillebrand; Paris C. Kanellakis; Harry G. Mairson; Moshe Y. Vardi (J. Log. Program., 1995)

Complexity-Theoretic Aspects for Programming Language Design. - Harry G. Mairson (CP, 1996)

Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? - Julia L. Lawall; Harry G. Mairson (ICFP, 1996)

In Memoriam Paris C. Kanellakis. - Serge Abiteboul; Gabriel M. Kuper; Harry G. Mairson; Alexander A. Shvartsman; Moshe Y. Vardi (ACM Comput. Surv., 1996)

Database Query Languages Embedded in the Typed Lambda Calculus. - Gerd G. Hillebrand; Paris C. Kanellakis; Harry G. Mairson (Inf. Comput., 1996)

on Global Dynamics of Optimal Graph Reduction. - Julia L. Lawall; Harry G. Mairson (ICFP, 1997)

Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). - Assaf J. Kfoury; Harry G. Mairson; Franklyn A. Turbak; J. B. Wells (ICFP, 1999)

Sharing Continuations: Proofnets for Languages with Explicit Control. - Julia L. Lawall; Harry G. Mairson (ESOP, 2000)

Programming language foundations of computation theory. - Harry G. Mairson (ACM SIGSOFT Softw. Eng. Notes, 2000)

Parallel Beta Reduction Is Not Elementary Recursive. - Andrea Asperti; Harry G. Mairson (Inf. Comput., 2001)

Proofnets and Context Semantics for the Additives. - Harry G. Mairson; Xavier Rival (CSL, 2002)

From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. - Harry G. Mairson (FSTTCS, 2002)

From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. - Harry G. Mairson (ICFP, 2003)

On the Computational Complexity of Cut-Elimination in Linear Logic. - Harry G. Mairson; Kazushige Terui (ICTCS, 2003)

Editorial: Special Issue Dedicated to Bob Paige. - Olivier Danvy; Fritz Henglein; Harry G. Mairson; Alberto Pettorossi (High. Order Symb. Comput., 2003)

Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. - Peter Møller Neergaard; Harry G. Mairson (ICFP, 2004)

Linear lambda calculus and PTIME-completeness. - Harry G. Mairson (J. Funct. Program., 2004)

Editorial. - Olivier Danvy; Fritz Henglein; Harry G. Mairson; Alberto Pettorossi (High. Order Symb. Comput., 2005)

Robert Paige (1947-1999). - Harry G. Mairson (High. Order Symb. Comput., 2005)

Relating complexity and precision in control flow analysis. - David Van Horn; Harry G. Mairson (ICFP, 2007)

Deciding kCFA is complete for EXPTIME. - David Van Horn; Harry G. Mairson (ICFP, 2008)

Flow Analysis, Linearity, and PTIME. - David Van Horn; Harry G. Mairson (SAS, 2008)

Functional geometry and the Traité de Lutherie: functional pearl. - Harry G. Mairson (ICFP, 2013)

Deciding $k$CFA is complete for EXPTIME. - David Van Horn; Harry G. Mairson (CoRR, 2013)