Larry J. Stockmeyer

Publications

5.8K

Citations

H-Index

1972

Active since

Affiliations

IBM Research - Thomas J. Watson Research Center(Current)

Massachusetts Institute of Technology

IBM (United States)

University of Washington

IBM Research - Almaden

Larry J. Stockmeyer is an author at IBM Research - Thomas J. Watson Research Center specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityFormal MethodsAutomated ReasoningDiscrete MathematicsFormal VerificationComputer EngineeringCombinatorial OptimizationParallel Computing

Publications per year

1972–1998

Publications

The polynomial-time hierarchy

Larry J. Stockmeyer · Theoretical Computer Science · 1976 · 1.3K citations

Computational Complexity Theory, Engineering, Automated Reasoning +7

Alternation

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer · Journal of the ACM · 1981 · 1.2K citations · Full text

Word problems requiring exponential time(Preliminary Report)

Larry J. Stockmeyer, Albert R. Meyer · 1973 · 864 citations

Engineering, Computational Complexity, Combinatorics On Word +20

The equivalence problem for regular expressions with squaring requires exponential space

Albert R. Meyer, Larry J. Stockmeyer · 1972 · 604 citations

Regular Expressions, Equivalence Problem, Exponential Space

On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

Michael S. Paterson, Larry J. Stockmeyer · SIAM Journal on Computing · 1973 · 298 citations

Computational Complexity Theory, Engineering, Computational Number Theory +11

Rows per page

1–5 of 29