Harry G. Mairson - Publications

Affiliations: 
Brandeis University, Waltham, MA, United States 
Area:
Computer Science

11 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2004 Mairson HG. Linear lambda calculus and PTIME-completeness Journal of Functional Programming. 14: 623-633. DOI: 10.1017/S0956796804005131  0.333
2001 Asperti A, Mairson HG. Parallel beta reduction is not elementary recursive Information and Computation. 170: 49-80. DOI: 10.1006/Inco.2001.2869  0.328
2000 Mairson H. Programming language foundations of computation theory Acm Sigsoft Software Engineering Notes. 25: 63. DOI: 10.1145/340855.340972  0.33
1997 Mairson H, Kapron B. CALL FOR PAPERS: Special Issue on Functional Programming and Computational Complexity Journal of Functional Programming. 7: 355-356. DOI: 10.1017/S0956796897002773  0.352
1996 Mairson HG. Complexity-theoretic aspects of programming language design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1118: 572. DOI: 10.1007/3-540-61551-2_122  0.327
1995 Hillebrand GG, Kanellakis PC, Mairson HG, Vardi MY. Undecidable boundedness problems for datalog programs The Journal of Logic Programming. 25: 163-190. DOI: 10.1016/0743-1066(95)00051-K  0.35
1994 Hengleini F, Mairson HG. The complexity of type inference for higherorder typed lambda calculf Journal of Functional Programming. 4: 435-477. DOI: 10.1017/S0956796800001143  0.327
1993 Gaifman H, Mairson H, Sagiv Y, Vardi M. Undecidable optimization problems for database logic programs Journal of the Acm. 40: 683-713. DOI: 10.1145/174130.174142  0.373
1992 Mairson HG. Quantifier elimination and parametric polymorphism in programming languages Journal of Functional Programming. 2: 213-226. DOI: 10.1017/S0956796800000332  0.322
1992 Mairson HG. A simple proof of a theorem of Statman Theoretical Computer Science. 103: 387-394. DOI: 10.1016/0304-3975(92)90020-G  0.3
1992 Mairson HG. The effect of table expansion on the program complexity of perfect hash functions Bit. 32: 430-440. DOI: 10.1007/Bf02074879  0.307
Show low-probability matches.