The following pages link to Harry G. Mairson (Q1198970):
Displaying 27 items.
- (Q814995) (redirect page) (← links)
- Robert Paige (1947--1999) (Q814996) (← links)
- The effect of table expansion on the program complexity of perfect hash functions (Q1198971) (← links)
- A simple proof of a theorem of Statman (Q1199546) (← links)
- Generating words in a context-free language uniformly at random (Q1318776) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- Database query languages embedded in the typed lambda calculus (Q1923099) (← links)
- Optimality and inefficiency (Q2817687) (← links)
- Undecidable boundedness problems for datalog programs (Q3128622) (← links)
- Undecidable optimization problems for database logic programs (Q3140022) (← links)
- Flow Analysis, Linearity, and PTIME (Q3522075) (← links)
- Some new upper bounds on the generation of prime numbers (Q4127386) (← links)
- (Q4411821) (← links)
- (Q4415239) (← links)
- (Q4518884) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- FUNCTIONAL PEARL <i>Linear lambda calculus and PTIME-completeness</i> (Q4660260) (← links)
- Quantifier elimination and parametric polymorphism in programming languages (Q4763983) (← links)
- The complexity of type inference for higher-order typed lambda calculi (Q4764610) (← links)
- IN MEMORIAM Paris C. Kanellakis (1953–1995) (Q4876690) (← links)
- Relating complexity and precision in control flow analysis (Q5168927) (← links)
- Types, potency, and idempotency (Q5178032) (← links)
- Deciding <i>k</i> CFA is complete for EXPTIME (Q5178768) (← links)
- In memoriam Paris C. Kanellakis (Q5228138) (← links)
- Functional geometry and the Traité de Lutherie (Q5244795) (← links)
- On global dynamics of optimal graph reduction (Q5348875) (← links)
- Theoretical Computer Science (Q5897348) (← links)
