Harry Mairson | Academic Influence

Harry Mairson's AcademicInfluence.com Rankings

Harry Mairson

Computer Science

#1736

World Rank

#1799

Historical Rank

#826

USA Rank

Database

#9659

World Rank

#10207

Historical Rank

#1391

USA Rank

computer-science Degrees

Download Badge

Computer Science

Harry Mairson's Degrees

PhD Computer Science Carnegie Mellon University
Masters Computer Science Carnegie Mellon University

Similar Degrees You Can Earn

Why Is Harry Mairson Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Harry George Mairson is a theoretical computer scientist and professor of computer science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics.

(See a Problem?)

Harry Mairson's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Undecidable optimization problems for database logic programs (1993) (145)
Deciding ML typability is complete for deterministic exponential time (1989) (125)
Reporting and Counting Intersections Between Two Sets of Line Segments (1988) (94)
Unification and ML-Type Reconstruction (1991) (71)
Undecidable Boundedness Problems for Datalog Programs (1995) (61)
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work (2004) (60)
A Simple Proof of a Theorem of Statman (1992) (58)
On the Computational Complexity of Cut-Elimination in Linear Logic (2003) (53)
Outline of a Proof Theory of Parametricity (1991) (49)
Generating Words in a Context-Free Language Uniformly at Random (1994) (48)
Optimality and inefficiency: what isn't a cost model of the lambda calculus? (1996) (47)
The complexity of type inference for higher-order lambda calculi (1991) (42)
Parallel beta reduction is not elementary recursive (1998) (41)
Deciding $k$CFA is complete for EXPTIME (2008) (37)
Tools for Datalog boundedness (1991) (34)
Database query languages embedded in the typed lambda calculus (1993) (33)
Linear lambda calculus and PTIME-completeness (2004) (32)
Deciding kCFA is complete for EXPTIME (2013) (32)
Some new upper bounds on the generation of prime numbers (1977) (31)
The program complexity of searching a table (1983) (29)
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract) (1999) (22)
Relating complexity and precision in control flow analysis (2007) (22)
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple (2002) (21)
On global dynamics of optimal graph reduction (1997) (13)
Complexity aspects of programming language design: from logspace to elementary time via proofnets and intersection types (2004) (12)
LAL Is Square: Representation and Expressiveness in Light Affine Logic (2002) (12)
Flow Analysis, Linearity, and PTIME (2008) (11)
Quantifier elimination and parametric polymorphism in programming languages (1992) (9)
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction (1994) (8)
Automatic Program Development: A Tribute to Robert Paige (2008) (6)
The effect of table expansion on the program complexity of perfect hash functions (1992) (6)
Sharing Continuations: Proofnets for Languages with Explicit Control (2000) (6)
Proofnets and Context Semantics for the Additives (2002) (6)
The program complexity of searching a table (data structures, applied combinatorics) (1984) (5)
Correcting faults in write-once memory (1984) (5)
Functional geometry and the Traité de Lutherie: functional pearl (2013) (5)
Average case lower bounds on the construction and searching of partial orders (1985) (5)
How Light Is Safe Recursion? Compositional Translations Between Languages of Polynomial Time (2001) (3)
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis (2003) (2)
Programming language foundations of computation theory (2000) (2)
Automatic Program Development (2008) (2)
In memoriam Paris C. Kanellakis (1996) (2)
Higher-order and symbolic computation: editorial (2005) (2)
Rank Bounded Intersection: Types, Potency, and Idempotency (2003) (2)
A constructive logic of multiple subtyping (1993) (0)
Getting a Quick Fix on Comonads (2015) (0)
Robert Paige (1947–1999) (2005) (0)
Editorial (2005) (0)
In Memoriam: Paris C. Kanellakis (2003) (0)
Robert Paige: Researcher and Teacher (2008) (0)
CALL FOR PAPERS Journal of Functional Programming Special Issue on Functional Programming and Computational Complexity (1997) (0)
Editorial: Special Issue Dedicated to Bob Paige (2003) (0)
Complexity-Theoretic Aspects for Programming Language Design (1996) (0)
Undecidable Boundedness Problem For Datalog Program (1992) (0)
Computer Science 190 ( Spring Term , 2008 ) Semantics of Programming Languages Course instructor : (0)

This paper list is powered by the following services:

Other Resources About Harry Mairson

en.wikipedia.org

What Schools Are Affiliated With Harry Mairson?

Harry Mairson is affiliated with the following schools: