Harry G. Mairson

Available identifiers

zbMath Open mairson.harry-georgeDBLP31/6437WikidataQ5670862 ScholiaQ5670862MaRDI QIDQ1198970

List of research outcomes

Publication	Date of Publication	Type
In memoriam Paris C. Kanellakis	2019-08-09	Paper
An analysis of the Core-ML language: Expressive power and type reconstruction	2019-04-29	Paper
On global dynamics of optimal graph reduction	2017-08-21	Paper
Optimality and inefficiency	2016-09-01	Paper
Functional geometry and the Traité de Lutherie	2015-03-30	Paper
Deciding k CFA is complete for EXPTIME	2015-03-16	Paper
Types, potency, and idempotency	2015-03-09	Paper
Relating complexity and precision in control flow analysis	2014-07-21	Paper
Theoretical Computer Science	2010-02-23	Paper
Flow Analysis, Linearity, and PTIME	2008-08-28	Paper
Robert Paige (1947--1999)	2006-02-08	Paper
FUNCTIONAL PEARL Linear lambda calculus and PTIME-completeness	2005-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4415239	2003-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4411821	2003-07-10	Paper
Parallel beta reduction is not elementary recursive	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4518884	2000-12-03	Paper
Undecidable boundedness problems for datalog programs	1997-04-17	Paper
Database query languages embedded in the typed lambda calculus	1996-10-01	Paper
IN MEMORIAM Paris C. Kanellakis (1953–1995)	1996-06-04	Paper
The complexity of type inference for higher-order typed lambda calculi	1995-12-13	Paper
Quantifier elimination and parametric polymorphism in programming languages	1995-05-01	Paper
Generating words in a context-free language uniformly at random	1994-04-04	Paper
Undecidable optimization problems for database logic programs	1993-12-06	Paper
The effect of table expansion on the program complexity of perfect hash functions	1993-01-16	Paper
A simple proof of a theorem of Statman	1993-01-16	Paper
Some new upper bounds on the generation of prime numbers	1977-01-01	Paper

Research outcomes over time

This page was built for person: Harry G. Mairson