Share This Author
Consensus in the presence of partial synchrony
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.
Some Simplified NP-Complete Graph Problems
This work defines alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate, and shows that while n-state alternating finite automata accept only regular sets that can be accepted by 22n-O(logn) state deterministic automata, alternating pushdown automata acceptance all languages accepted by Turing machines in deterministic exponential time.
The Polynomial-Time Hierarchy
- L. Stockmeyer
- Computer Science, MathematicsTheor. Comput. Sci.
- 1 October 1976
Word problems requiring exponential time(Preliminary Report)
A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space
Some simplified NP-complete problems
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.
On the minimal synchronism needed for distributed consensus
- D. Dolev, C. Dwork, L. Stockmeyer
- Mathematics24th Annual Symposium on Foundations of Computer…
- 7 November 1983
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.
The complexity of decision problems in automata theory and logic
- L. Stockmeyer
- Computer Science
This paper is intended to demonstrate the efforts of the Massachusetts Institute of Technology’s graduate students to improve the quality of their teaching and research.
Constant Depth Reducibility
The purpose of this paper is to study reducibilities that can be computed by combinational logic networks of polynomial size and constant depth containing AND’s, OR’s and NOT’s, with no bound placed…