The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harry G. Mairson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
    Undecidable Optimization Problems for Database Logic Programs [Citation Graph (26, 0)][DBLP]
    LICS, 1987, pp:106-115 [Conf]
  2. Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
    Undecidable Optimization Problems for Database Logic Programs. [Citation Graph (9, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:683-713 [Journal]
  3. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
    Tools for Datalog Boundedness. [Citation Graph (8, 18)][DBLP]
    PODS, 1991, pp:1-12 [Conf]
  4. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
    Database Query Languages Embedded in the Typed Lambda Calculus [Citation Graph (6, 0)][DBLP]
    LICS, 1993, pp:332-343 [Conf]
  5. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
    Undecidable Boundedness Problems for Datalog Programs. [Citation Graph (4, 0)][DBLP]
    J. Log. Program., 1995, v:25, n:2, pp:163-190 [Journal]
  6. Harry G. Mairson
    The Program Complexity of Searching a Table [Citation Graph (3, 0)][DBLP]
    FOCS, 1983, pp:40-47 [Conf]
  7. Harry G. Mairson
    A Simple Proof of a Theorem of Statman. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:2, pp:387-394 [Journal]
  8. Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell
    Unification and ML-Type Reconstruction. [Citation Graph (1, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:444-478 [Conf]
  9. Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
    An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. [Citation Graph (1, 0)][DBLP]
    ICALP, 1994, pp:83-105 [Conf]
  10. Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman
    Correcting Faults in Write-Once Memory [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:225-229 [Conf]
  11. Harry G. Mairson
    Complexity-Theoretic Aspects for Programming Language Design. [Citation Graph (0, 0)][DBLP]
    CP, 1996, pp:572- [Conf]
  12. Harry G. Mairson, Xavier Rival
    Proofnets and Context Semantics for the Additives. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:151-166 [Conf]
  13. Julia L. Lawall, Harry G. Mairson
    Sharing Continuations: Proofnets for Languages with Explicit Control. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:245-259 [Conf]
  14. Harry G. Mairson
    Average Case Lower Bounds on the Construction and Searching of Partial Orders [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:303-311 [Conf]
  15. Harry G. Mairson
    Outline of a Proof Theory of Parametricity. [Citation Graph (0, 0)][DBLP]
    FPCA, 1991, pp:313-327 [Conf]
  16. Harry G. Mairson
    From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:2-17 [Conf]
  17. A. J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells
    Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICFP, 1999, pp:90-101 [Conf]
  18. Julia L. Lawall, Harry G. Mairson
    Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? [Citation Graph (0, 0)][DBLP]
    ICFP, 1996, pp:92-101 [Conf]
  19. Julia L. Lawall, Harry G. Mairson
    on Global Dynamics of Optimal Graph Reduction. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:188-195 [Conf]
  20. Harry G. Mairson
    From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. [Citation Graph (0, 0)][DBLP]
    ICFP, 2003, pp:125- [Conf]
  21. Peter Møller Neergaard, Harry G. Mairson
    Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. [Citation Graph (0, 0)][DBLP]
    ICFP, 2004, pp:138-149 [Conf]
  22. Harry G. Mairson, Kazushige Terui
    On the Computational Complexity of Cut-Elimination in Linear Logic. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:23-36 [Conf]
  23. Andrea Asperti, Harry G. Mairson
    Parallel Beta Reduction is not Elementary Recursive. [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:303-315 [Conf]
  24. Fritz Henglein, Harry G. Mairson
    The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    POPL, 1991, pp:119-130 [Conf]
  25. Harry G. Mairson
    Deciding ML Typability is Complete for Deterministic Exponential Time. [Citation Graph (0, 0)][DBLP]
    POPL, 1990, pp:382-401 [Conf]
  26. Harry G. Mairson
    A Constructive Logic of Multiple Subtyping. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:313-324 [Conf]
  27. Harry G. Mairson
    The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:3, pp:430-440 [Journal]
  28. Harry G. Mairson
    Some New Upper Bounds on the Generation of Prime Numbers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1977, v:20, n:9, pp:664-669 [Journal]
  29. Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi
    In Memoriam Paris C. Kanellakis. [Citation Graph (0, 32)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:3-15 [Journal]
  30. Andrea Asperti, Harry G. Mairson
    Parallel Beta Reduction Is Not Elementary Recursive. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:170, n:1, pp:49-80 [Journal]
  31. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
    Database Query Languages Embedded in the Typed Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:127, n:2, pp:117-144 [Journal]
  32. Harry G. Mairson
    Generating Words in a Context-Free Language Uniformly at Random. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:2, pp:95-99 [Journal]
  33. Fritz Henglein, Harry G. Mairson
    The Complexity of Type Inference for Higher-Order Typed lambda Calculi. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1994, v:4, n:4, pp:435-477 [Journal]
  34. Harry G. Mairson
    Linear lambda calculus and PTIME-completeness. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:6, pp:623-633 [Journal]
  35. Harry G. Mairson
    Quantifier Elimination and Parametric Polymorphism in Programming Languages. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1992, v:2, n:2, pp:213-226 [Journal]
  36. Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
    Editorial: Special Issue Dedicated to Bob Paige. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2003, v:16, n:1-2, pp:5-6 [Journal]
  37. Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2005, v:18, n:1-2, pp:5-6 [Journal]
  38. Harry G. Mairson
    Robert Paige (1947-1999). [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2005, v:18, n:1-2, pp:7-8 [Journal]
  39. David Van Horn, Harry G. Mairson
    Relating complexity and precision in control flow analysis. [Citation Graph (0, 0)][DBLP]
    ICFP, 2007, pp:85-96 [Conf]

  40. Deciding kCFA is complete for EXPTIME. [Citation Graph (, )][DBLP]


  41. Flow Analysis, Linearity, and PTIME. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002