default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarry G. Mairson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1984
[b1]Harry G. Mairson:
The program complexity of searching a table. Stanford University, USA, 1984
Journal Articles
- 2005
- [j16]Olivier Danvy
, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi:
Editorial. High. Order Symb. Comput. 18(1-2): 5-6 (2005) - [j15]Harry G. Mairson:
Robert Paige (1947-1999). High. Order Symb. Comput. 18(1-2): 7-8 (2005) - 2004
- [j14]Harry G. Mairson:
Linear lambda calculus and PTIME-completeness. J. Funct. Program. 14(6): 623-633 (2004) - 2003
- [j13]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi:
Editorial: Special Issue Dedicated to Bob Paige. High. Order Symb. Comput. 16(1-2): 5-6 (2003) - 2001
- [j12]Andrea Asperti, Harry G. Mairson:
Parallel Beta Reduction Is Not Elementary Recursive. Inf. Comput. 170(1): 49-80 (2001) - 2000
- [j11]Harry G. Mairson:
Programming language foundations of computation theory. ACM SIGSOFT Softw. Eng. Notes 25(1): 63 (2000) - 1996
- [j10]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) - [j9]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
- [j8]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
- [j7]Harry G. Mairson:
Generating Words in a Context-Free Language Uniformly at Random. Inf. Process. Lett. 49(2): 95-99 (1994) - [j6]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
- [j5]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
- [j4]Harry G. Mairson:
The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. BIT 32(3): 430-440 (1992) - [j3]Harry G. Mairson:
Quantifier Elimination and Parametric Polymorphism in Programming Languages. J. Funct. Program. 2(2): 213-226 (1992) - [j2]Harry G. Mairson:
A Simple Proof of a Theorem of Statman. Theor. Comput. Sci. 103(2): 387-394 (1992) - 1977
- [j1]Harry G. Mairson:
Some New Upper Bounds on the Generation of Prime Numbers. Commun. ACM 20(9): 664-669 (1977)
Conference and Workshop Papers
- 2013
- [c27]Harry G. Mairson:
Functional geometry and the Traité de Lutherie: functional pearl. ICFP 2013: 123-132 - 2008
- [c26]David Van Horn, Harry G. Mairson:
Deciding kCFA is complete for EXPTIME. ICFP 2008: 275-282 - [c25]David Van Horn, Harry G. Mairson:
Flow Analysis, Linearity, and PTIME. SAS 2008: 255-269 - 2007
- [c24]David Van Horn, Harry G. Mairson:
Relating complexity and precision in control flow analysis. ICFP 2007: 85-96 - 2004
- [c23]Peter Møller Neergaard, Harry G. Mairson:
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. ICFP 2004: 138-149 - 2003
- [c22]Harry G. Mairson:
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. ICFP 2003: 125 - [c21]Harry G. Mairson, Kazushige Terui:
On the Computational Complexity of Cut-Elimination in Linear Logic. ICTCS 2003: 23-36 - 2002
- [c20]Harry G. Mairson, Xavier Rival:
Proofnets and Context Semantics for the Additives. CSL 2002: 151-166 - [c19]Harry G. Mairson:
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. FSTTCS 2002: 2-17 - 2000
- [c18]Julia L. Lawall, Harry G. Mairson:
Sharing Continuations: Proofnets for Languages with Explicit Control. ESOP 2000: 245-259 - 1999
- [c17]Assaf 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
- [c16]Andrea Asperti, Harry G. Mairson:
Parallel Beta Reduction is not Elementary Recursive. POPL 1998: 303-315 - 1997
- [c15]Julia L. Lawall, Harry G. Mairson:
on Global Dynamics of Optimal Graph Reduction. ICFP 1997: 188-195 - 1996
- [c14]Harry G. Mairson:
Complexity-Theoretic Aspects for Programming Language Design. CP 1996: 572 - [c13]Julia L. Lawall, Harry G. Mairson:
Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? ICFP 1996: 92-101 - 1994
- [c12]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 - 1993
- [c11]Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson:
Database Query Languages Embedded in the Typed Lambda Calculus. LICS 1993: 332-343 - [c10]Harry G. Mairson:
A Constructive Logic of Multiple Subtyping. POPL 1993: 313-324 - 1991
- [c9]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 - [c8]Harry G. Mairson:
Outline of a Proof Theory of Parametricity. FPCA 1991: 313-327 - [c7]Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi:
Tools for Datalog Boundedness. PODS 1991: 1-12 - [c6]Fritz Henglein, Harry G. Mairson:
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. POPL 1991: 119-130 - 1990
- [c5]Harry G. Mairson:
Deciding ML Typability is Complete for Deterministic Exponential Time. POPL 1990: 382-401 - 1987
- [c4]Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs. LICS 1987: 106-115 - 1985
- [c3]Harry G. Mairson:
Average Case Lower Bounds on the Construction and Searching of Partial Orders. FOCS 1985: 303-311 - 1984
- [c2]Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman:
Correcting Faults in Write-Once Memory. STOC 1984: 225-229 - 1983
- [c1]Harry G. Mairson:
The Program Complexity of Searching a Table. FOCS 1983: 40-47
Informal and Other Publications
- 2013
- [i2]David Van Horn, Harry G. Mairson:
Deciding $k$CFA is complete for EXPTIME. CoRR abs/1311.5810 (2013) - [i1]David Van Horn, Harry G. Mairson:
Flow analysis, linearity, and PTIME. CoRR abs/1311.5825 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
