Larry Stockmeyer - Concepedia

Author

Larry Stockmeyer

IBM Research - Almaden

Also Known As

L Stockmeyer, L. Stockmeyer, Larry Stockmeyer

Publications

8.5K

Citations

H-Index

Concepts

All Affiliations

IBM Research - Almaden IBM (United States)Massachusetts Institute of Technology Hebrew University of Jerusalem Weizmann Institute of Science

About

Larry Stockmeyer is an author at IBM Research - Almaden specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	26	37	7.7K
2	Business	2	2	45
3	Management	2	2	28
4	Education	1	1	206
5	Natural Sciences	1	1	328

Larry Stockmeyer

Publications

8.4K

Citations

H-Index

Page 1

	Year	Citations
Some simplified NP-complete graph problems M. R. Garey, David S. Johnson, Larry Stockmeyer Theoretical Computer Science EngineeringGraph TheoryNp-complete Graph ProblemsStructural Graph TheoryComputational Complexity	1976	2.1K
Consensus in the presence of partial synchrony Cynthia Dwork, Nancy Lynch, Larry Stockmeyer Journal of the ACM Partial SynchronyEngineeringByzantine FaultUpper Bound φConsistency Technology	1988	1.8K
On the minimal synchronism needed for distributed consensus Danny Dolev, Cynthia Dwork, Larry Stockmeyer Journal of the ACM Cluster ComputingDistributed ConsensusBlockchain Consensus ProtocolEngineeringDistributed Computing	1987	617
Some simplified NP-complete problems M. R. Garey, D. S. Johnson, Larry Stockmeyer Mathematical ProgrammingEngineeringPlanar GraphMax CutComputational Complexity	1974	595
Optimal orientations of cells in slicing floorplan designs Larry Stockmeyer Information and Control Geometric ModelingEngineeringNatural SciencesDesignGeometry Generation	1983	328
What Can be Computed Locally? Moni Naor, Larry Stockmeyer SIAM Journal on Computing EngineeringLcl ProblemVerificationComputer-aided VerificationComputational Complexity	1995	313
Constant Depth Reducibility Ashok K. Chandra, Larry Stockmeyer, Uzi Vishkin SIAM Journal on Computing Circuit ComplexitySymmetric Boolean FunctionsEngineeringComputational Complexity TheoryBoolean Function	1984	296
On Approximation Algorithms for # P Larry Stockmeyer SIAM Journal on Computing	1985	211
The complexity of approximate counting Larry Stockmeyer Computational Complexity TheoryEngineeringNetwork AnalysisEducationComputational Complexity	1983	206
Simulation of Parallel Random Access Machines by Circuits Larry Stockmeyer, Uzi Vishkin SIAM Journal on Computing Circuit ComplexityComputational Complexity TheoryEngineeringComputer ArchitectureSimulation	1984	188

Page 1