L
Larry J. Stockmeyer
Researcher at IBM
Publications - 94
Citations - 13656
Larry J. Stockmeyer is an academic researcher from IBM. The author has contributed to research in topics: Upper and lower bounds & Time complexity. The author has an hindex of 44, co-authored 94 publications receiving 12819 citations. Previous affiliations of Larry J. Stockmeyer include Massachusetts Institute of Technology.
Papers
More filters
Journal ArticleDOI
Some simplified NP-complete graph problems
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.
Journal ArticleDOI
Consensus in the presence of partial synchrony
TL;DR: Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time.
Journal ArticleDOI
The polynomial-time hierarchy☆
TL;DR: The problem of deciding validity in the theory of equality is shown to be complete in polynomial-space, and close upper and lower bounds on the space complexity of this problem are established.
Journal ArticleDOI
On the minimal synchronism needed for distributed consensus
TL;DR: The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others, and several critical system parameters, including various synchronicity conditions, are identified.