Harry G. Mairson

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
Harry G Mairson, Harry George Mairson, Harry Mairson
Publication record
53 papers · 1,320 citations · H-index 21

PAPERS

Getting a Quick Fix on Comonads
20150 citationsauthor #1
Functional geometry and the Traité de Lutherie: functional pearl
20136 citationsauthor #1
Flow Analysis, Linearity, and PTIME
200811 citationsauthor #2
Deciding kCFA is complete for EXPTIME
200848 citationsauthor #2
Automatic Program Development: A Tribute to Robert Paige
20086 citationsauthor #2
Automatic Program Development
20082 citationsauthor #2
Robert Paige: Researcher and Teacher
20080 citationsauthor #1
Relating complexity and precision in control flow analysis
200723 citationsauthor #2
Editorial
20052 citationsauthor #3
Robert Paige (1947–1999)
20050 citationsauthor #1
Complexity aspects of programming language design: from logspace to elementary time via proofnets and intersection types
200413 citationsauthor #1
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
200461 citationsauthor #2
On the Computational Complexity of Cut-Elimination in Linear Logic
200352 citationsauthor #1
In Memoriam: Paris C. Kanellakis
20030 citationsauthor #3
Editorial: Special Issue Dedicated to Bob Paige
20030 citationsauthor #3
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis
20032 citationsauthor #1
Rank Bounded Intersection: Types, Potency, and Idempotency
20032 citationsauthor #2
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple
200220 citationsauthor #1
Proofnets and Context Semantics for the Additives
20026 citationsauthor #1
LAL Is Square: Representation and Expressiveness in Light Affine Logic
200213 citationsauthor #2
How Light Is Safe Recursion? Compositional Translations Between Languages of Polynomial Time
20013 citationsauthor #2
Programming language foundations of computation theory
20002 citationsauthor #1
Sharing Continuations: Proofnets for Languages with Explicit Control
20005 citationsauthor #2
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)
199921 citationsauthor #2
Parallel beta reduction is not elementary recursive
199840 citationsauthor #2
On global dynamics of optimal graph reduction
199713 citationsauthor #2
Complexity-Theoretic Aspects for Programming Language Design
19960 citationsauthor #1
Optimality and inefficiency: what isn't a cost model of the lambda calculus?
199645 citationsauthor #2
In memoriam Paris C. Kanellakis
19962 citationsauthor #3
Undecidable Boundedness Problems for Datalog Programs
199568 citationsauthor #3
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
19948 citationsauthor #3
The complexity of type inference for higher-order typed lambda calculi
199442 citationsauthor #2
Generating Words in a Context-Free Language Uniformly at Random
199450 citationsauthor #1
Database query languages embedded in the typed lambda calculus
199333 citationsauthor #3
Undecidable optimization problems for database logic programs
1993152 citationsauthor #2
A constructive logic of multiple subtyping
19930 citationsauthor #1
Quantifier elimination and parametric polymorphism in programming languages
19929 citationsauthor #1
The effect of table expansion on the program complexity of perfect hash functions
19927 citationsauthor #1
A Simple Proof of a Theorem of Statman
199257 citationsauthor #1
Undecidable Boundedness Problem For Datalog Program
19920 citationsauthor #3
The complexity of type inference for higher-order lambda calculi
19912 citationsauthor #2
Tools for Datalog boundedness
199134 citationsauthor #3
Unification and ML-Type Reconstruction
199172 citationsauthor #2
Outline of a Proof Theory of Parametricity
199145 citationsauthor #1
Deciding ML typability is complete for deterministic exponential time
1989125 citationsauthor #1
Reporting and Counting Intersections Between Two Sets of Line Segments
198899 citationsauthor #1
Average case lower bounds on the construction and searching of partial orders
19855 citationsauthor #1
Correcting faults in write-once memory
19845 citationsauthor #3
The program complexity of searching a table (data structures, applied combinatorics)
19845 citationsauthor #1
The program complexity of searching a table
198333 citationsauthor #1
Some new upper bounds on the generation of prime numbers
197734 citationsauthor #1
Computer Science 190 ( Spring Term , 2008 ) Semantics of Programming Languages Course instructor :
year unknown0 citationsauthor #1
Under Consideration for Publication in J. Functional Programming Linear Lambda Calculus and Ptime-completeness
year unknown38 citationsauthor #1

TIMELINE

1977 34 citations

1983 33 citations

1984 10 citations

1985 5 citations

1988 99 citations

1989 125 citations

1991 153 citations

1992 73 citations

1993 185 citations

1994 100 citations

1995 68 citations

1996 47 citations

1997 13 citations

1998 40 citations

1999 21 citations

2000 7 citations

2001 3 citations

2002 39 citations

2003 56 citations

2004 74 citations

2005 2 citations

2007 23 citations

2008 67 citations

2013 6 citations

2015 0 citations

Unknown 38 citations

Harry G. Mairson

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT