World's Best Scientists 2026 revealed!
Larry J. Stockmeyer

Larry J. Stockmeyer

D-Index & Metrics

Computer Science

D-Index
54
Citations
23115
World Ranking
4438
National Ranking
2076

Research.com Recognitions

  • 1996 - ACM Fellow For several fundamental contributions to computational complexity theory, which have significantly affected the course of this field.

Overview

Larry J. Stockmeyer was a researcher affiliated with IBM in the United States. Their work was associated with computational complexity theory, a field in computer science that deals with classifying computational problems according to their inherent difficulty.

Although specific publications by Larry J. Stockmeyer are not listed here, they were recognized for fundamental contributions to computational complexity theory. Their work made a significant impact on the direction and development of the field over time.

Stockmeyer was awarded the title of ACM Fellow in 1996. This honor recognized their contributions to computational complexity theory and noted the influence these contributions had on the field's progression.

Best Publications

  • Some simplified NP-complete problems

    M. R. Garey;D. S. Johnson;L. Stockmeyer

  • Some simplified NP-complete graph problems

    M. R. Garey;David S. Johnson;Larry J. Stockmeyer

  • Consensus in the presence of partial synchrony

    Cynthia Dwork;Nancy Lynch;Larry Stockmeyer

  • The polynomial-time hierarchy☆

    Larry J. Stockmeyer

  • On the minimal synchronism needed for distributed consensus

    Danny Dolev;Cynthia Dwork;Larry Stockmeyer

  • Alternation

    Unknown

  • Word problems requiring exponential time(Preliminary Report)

    Unknown

  • The equivalence problem for regular expressions with squaring requires exponential space

    A. R. Meyer;L. J. Stockmeyer

  • What Can Be Computed Locally

    Moni Naor;Larry Stockmeyer

  • The complexity of decision problems in automata theory and logic.

    Larry Joseph Stockmeyer

  • Optimal orientations of cells in slicing floorplan designs

    Larry Stockmeyer

  • Constant Depth Reducibility

    Ashok K. Chandra;Larry J. Stockmeyer;Uzi Vishkin

  • On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

    Michael S. Paterson;Larry J. Stockmeyer

  • NP-completeness of some generalizations of the maximum matching problem

    Larry J. Stockmeyer;Vijay V. Vazirani

  • On Approximation Algorithms for # P

    Larry J. Stockmeyer

  • The complexity of approximate counting

    Larry Stockmeyer

  • Simulation of Parallel Random Access Machines by Circuits

    Larry J. Stockmeyer;Uzi Vishkin

  • System and method for differential compression of data from a plurality of binary sources

    Miklos Ajtai;Randal Chilton Burns;Ronald Fagin;Larry Joseph Stockmeyer

  • Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998

    Cynthia Dwork;Moni Naor;Omer Reingold;Larry Stockmeyer

  • Improved upper and lower bounds for modal logics of programs

    M Y Vardi;L Stockmeyer

  • A characterization of the power of vector machines

    Vaughan R. Pratt;Larry J. Stockmeyer

  • On a monadic NP vs monadic co-NP

    Ronald Fagin;Larry J. Stockmeyer;Moshe Y. Vardi

Frequent Co-Authors

Cynthia Dwork
Cynthia Dwork Harvard University
Ronald Fagin
Ronald Fagin IBM (United States)
Miklós Ajtai
Miklós Ajtai Hungarian Academy of Sciences
Richard J. Lipton
Richard J. Lipton Georgia Institute of Technology
Danny Dolev
Danny Dolev Hebrew University of Jerusalem
Moshe Y. Vardi
Moshe Y. Vardi Rice University
Moni Naor
Moni Naor Weizmann Institute of Science
Uzi Vishkin
Uzi Vishkin University of Maryland, College Park
Ashok K. Chandra
Ashok K. Chandra IBM (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students exploring Computer Science in the USA, there are several closely related disciplines and degrees that can help diversify or specialize your tech expertise. Many reputable programs now offer flexible online options, making it easier to upskill or switch fields while managing other commitments.

If you're interested in a broader scientific foundation, consider pursuing an online physics bachelor's degree to build strong analytical skills. Those seeking to tap into the rapidly growing field of data analysis should explore what is the cheapest data science course in the us? for high-value, affordable options.

Engineering backgrounds also complement Computer Science. Take a look at online electrical engineering career outcomes to understand job prospects and study pathways. For those looking for quicker entry points, there are also a range of short certificate programs that pay well—ideal for professionals aiming to quickly boost their credentials or shift into lucrative tech roles.

Best Scientists Citing Larry J. Stockmeyer