| 2008 |
|---|
| 41 | EE | David Van Horn,
Harry G. Mairson:
Deciding kCFA is complete for EXPTIME.
ICFP 2008: 275-282 |
| 40 | EE | David Van Horn,
Harry G. Mairson:
Flow Analysis, Linearity, and PTIME.
SAS 2008: 255-269 |
| 2007 |
|---|
| 39 | EE | David Van Horn,
Harry G. Mairson:
Relating complexity and precision in control flow analysis.
ICFP 2007: 85-96 |
| 2005 |
|---|
| 38 | EE | Olivier Danvy,
Fritz Henglein,
Harry G. Mairson,
Alberto Pettorossi:
Editorial.
Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005) |
| 37 | EE | Harry G. Mairson:
Robert Paige (1947-1999).
Higher-Order and Symbolic Computation 18(1-2): 7-8 (2005) |
| 2004 |
|---|
| 36 | EE | Peter Møller Neergaard,
Harry G. Mairson:
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work.
ICFP 2004: 138-149 |
| 35 | EE | Harry G. Mairson:
Linear lambda calculus and PTIME-completeness.
J. Funct. Program. 14(6): 623-633 (2004) |
| 2003 |
|---|
| 34 | EE | Harry G. Mairson:
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis.
ICFP 2003: 125 |
| 33 | EE | Harry G. Mairson,
Kazushige Terui:
On the Computational Complexity of Cut-Elimination in Linear Logic.
ICTCS 2003: 23-36 |
| 32 | EE | Olivier Danvy,
Fritz Henglein,
Harry G. Mairson,
Alberto Pettorossi:
Editorial: Special Issue Dedicated to Bob Paige.
Higher-Order and Symbolic Computation 16(1-2): 5-6 (2003) |
| 2002 |
|---|
| 31 | EE | Harry G. Mairson,
Xavier Rival:
Proofnets and Context Semantics for the Additives.
CSL 2002: 151-166 |
| 30 | EE | Harry G. Mairson:
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple.
FSTTCS 2002: 2-17 |
| 2001 |
|---|
| 29 | | Andrea Asperti,
Harry G. Mairson:
Parallel Beta Reduction Is Not Elementary Recursive.
Inf. Comput. 170(1): 49-80 (2001) |
| 2000 |
|---|
| 28 | EE | Julia L. Lawall,
Harry G. Mairson:
Sharing Continuations: Proofnets for Languages with Explicit Control.
ESOP 2000: 245-259 |
| 1999 |
|---|
| 27 | EE | A. J. Kfoury,
Harry G. Mairson,
Franklyn A. Turbak,
J. B. Wells:
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract).
ICFP 1999: 90-101 |
| 1998 |
|---|
| 26 | EE | Andrea Asperti,
Harry G. Mairson:
Parallel Beta Reduction is not Elementary Recursive.
POPL 1998: 303-315 |
| 1997 |
|---|
| 25 | | Julia L. Lawall,
Harry G. Mairson:
on Global Dynamics of Optimal Graph Reduction.
ICFP 1997: 188-195 |
| 1996 |
|---|
| 24 | | Harry G. Mairson:
Complexity-Theoretic Aspects for Programming Language Design.
CP 1996: 572 |
| 23 | | Julia L. Lawall,
Harry G. Mairson:
Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus?
ICFP 1996: 92-101 |
| 22 | EE | Serge Abiteboul,
Gabriel M. Kuper,
Harry G. Mairson,
Alexander A. Shvartsman,
Moshe Y. Vardi:
In Memoriam Paris C. Kanellakis.
ACM Comput. Surv. 28(1): 3-15 (1996) |
| 21 | | Gerd G. Hillebrand,
Paris C. Kanellakis,
Harry G. Mairson:
Database Query Languages Embedded in the Typed Lambda Calculus.
Inf. Comput. 127(2): 117-144 (1996) |
| 1995 |
|---|
| 20 | | Gerd G. Hillebrand,
Paris C. Kanellakis,
Harry G. Mairson,
Moshe Y. Vardi:
Undecidable Boundedness Problems for Datalog Programs.
J. Log. Program. 25(2): 163-190 (1995) |
| 1994 |
|---|
| 19 | | Paris C. Kanellakis,
Gerd G. Hillebrand,
Harry G. Mairson:
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction.
ICALP 1994: 83-105 |
| 18 | | Harry G. Mairson:
Generating Words in a Context-Free Language Uniformly at Random.
Inf. Process. Lett. 49(2): 95-99 (1994) |
| 17 | | Fritz Henglein,
Harry G. Mairson:
The Complexity of Type Inference for Higher-Order Typed lambda Calculi.
J. Funct. Program. 4(4): 435-477 (1994) |
| 1993 |
|---|
| 16 | | Gerd G. Hillebrand,
Paris C. Kanellakis,
Harry G. Mairson:
Database Query Languages Embedded in the Typed Lambda Calculus
LICS 1993: 332-343 |
| 15 | | Harry G. Mairson:
A Constructive Logic of Multiple Subtyping.
POPL 1993: 313-324 |
| 14 | EE | Haim Gaifman,
Harry G. Mairson,
Yehoshua Sagiv,
Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs.
J. ACM 40(3): 683-713 (1993) |
| 1992 |
|---|
| 13 | | Harry G. Mairson:
The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions.
BIT 32(3): 430-440 (1992) |
| 12 | | Harry G. Mairson:
Quantifier Elimination and Parametric Polymorphism in Programming Languages.
J. Funct. Program. 2(2): 213-226 (1992) |
| 11 | | Harry G. Mairson:
A Simple Proof of a Theorem of Statman.
Theor. Comput. Sci. 103(2): 387-394 (1992) |
| 1991 |
|---|
| 10 | | Paris C. Kanellakis,
Harry G. Mairson,
John C. Mitchell:
Unification and ML-Type Reconstruction.
Computational Logic - Essays in Honor of Alan Robinson 1991: 444-478 |
| 9 | | Harry G. Mairson:
Outline of a Proof Theory of Parametricity.
FPCA 1991: 313-327 |
| 8 | EE | Gerd G. Hillebrand,
Paris C. Kanellakis,
Harry G. Mairson,
Moshe Y. Vardi:
Tools for Datalog Boundedness.
PODS 1991: 1-12 |
| 7 | | Fritz Henglein,
Harry G. Mairson:
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi.
POPL 1991: 119-130 |
| 1990 |
|---|
| 6 | | Harry G. Mairson:
Deciding ML Typability is Complete for Deterministic Exponential Time.
POPL 1990: 382-401 |
| 1987 |
|---|
| 5 | | Haim Gaifman,
Harry G. Mairson,
Yehoshua Sagiv,
Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs
LICS 1987: 106-115 |
| 1985 |
|---|
| 4 | | Harry G. Mairson:
Average Case Lower Bounds on the Construction and Searching of Partial Orders
FOCS 1985: 303-311 |
| 1984 |
|---|
| 3 | | Danny Dolev,
David Maier,
Harry G. Mairson,
Jeffrey D. Ullman:
Correcting Faults in Write-Once Memory
STOC 1984: 225-229 |
| 1983 |
|---|
| 2 | | Harry G. Mairson:
The Program Complexity of Searching a Table
FOCS 1983: 40-47 |
| 1977 |
|---|
| 1 | | Harry G. Mairson:
Some New Upper Bounds on the Generation of Prime Numbers.
Commun. ACM 20(9): 664-669 (1977) |
