Larry J. Stockmeyer
Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from public sources and our publisher partners.
The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is… Expand
Abstract It is widely believed that showing a problem to be NP -complete is tantamount to proving its computational intractability. In this paper we show that a number of NP -complete problems remain… Expand
Abstract The polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarchy in which deterministic (nondeterministic) polynomial time plays the role of recursive… Expand
The equivalence problem for Kleene's regular expressions has several effective solutions, all of which are computationally inefficient. In , we showed that this inefficiency is an inherent… Expand
Reaching agreement is a primitive of distributed computing. While this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system:… Expand
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain… Expand
The purpose of this paper is a study of computation that can be done locally in a distributed network, where \locally" means within time (or distance) independent of the size of the network. Locally… Expand
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D.