Larry Stockmeyer

Q: What Schools Are Affiliated With Larry Stockmeyer

Larry Stockmeyer is affiliated with the following schools: Rutgers University, IBM Research – Almaden, Massachusetts Institute of Technology, University of California, Santa Cruz

Larry Stockmeyer's AcademicInfluence.com Rankings

Larry Stockmeyer

Computer Science

#1153

World Rank

#1193

Historical Rank

#603

USA Rank

Database

#954

World Rank

#1002

Historical Rank

#285

USA Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Larry Stockmeyer Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Larry Joseph Stockmeyer was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.

(See a Problem?)

Larry Stockmeyer's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Some Simplified NP-Complete Graph Problems (1976) (2177)
Consensus in the presence of partial synchrony (1988) (1759)
The Polynomial-Time Hierarchy (1976) (1341)
Word problems requiring exponential time(Preliminary Report) (1973) (840)
Alternation (1976) (810)
On the minimal synchronism needed for distributed consensus (1983) (703)
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space (1972) (692)
Some simplified NP-complete problems (1974) (635)
The complexity of decision problems in automata theory and logic (1974) (410)
Optimal Orientations of Cells in Slicing Floorplan Designs (1984) (315)
Constant Depth Reducibility (1984) (308)
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials (1973) (276)
On Approximation Algorithms for #P (1985) (216)
NP-Completeness of Some Generalizations of the Maximum Matching Problem (1982) (215)
The complexity of approximate counting (1983) (205)
Simulation of Parallel Random Access Machines by Circuits (1984) (201)
On monadic NP vs. monadic co-NP (1993) (179)
Improved upper and lower bounds for modal logics of programs (1985) (178)
Magic functions (1999) (169)
What can be computed locally? (1993) (160)
A characterization of the power of vector machines (1974) (149)
Covering edges by cliques with regard to keyword conflicts and intersection graphs (1978) (133)
Planar 3-colorability is polynomial complete (1973) (132)
Provably Difficult Combinatorial Games (1979) (125)
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata (1990) (106)
Finite state verifiers I: the power of interaction (1992) (105)
Alternating Pushdown and Stack Automata (1984) (104)
Compactly encoding unstructured inputs with differential compression (2002) (96)
Classifying the computational complexity of problems (1987) (96)
Bounds on the time to reach agreement in the presence of timing uncertainty (1991) (95)
A Dictionary Machine (for VLSI) (1982) (86)
Alternating pushdown automata (1978) (79)
The Complexity of Word Problems - This Time with Interleaving (1994) (79)
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998 (2003) (77)
Relaxing the Triangle Inequality in Pattern Matching (1998) (76)
Intrinsically Difficult Problems (1979) (70)
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions (1985) (66)
Local computations on static and dynamic graphs (1995) (59)
The distributed firing squad problem (1985) (56)
The Closure of Monadic NP (2000) (56)
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (1984) (56)
Declustered disk array architectures with optimal and near-optimal parallelism (1998) (53)
A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers (2004) (52)
Parallel Algorithms for Term Matching (1986) (52)
A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers (2002) (46)
Fast on-line integer multiplication (1973) (42)
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (1992) (42)
On the combinational complexity of certain symmetric Boolean functions (1976) (42)
Comments on diffusive and electrostatic effects with immobilized enzymes. (1973) (40)
A complexity theory for unbounded fan-in parallelism (1982) (40)
Word Problems - This Time with Interleaving (1991) (40)
Cosmological lower bound on the circuit complexity of a small problem in logic (2002) (35)
An Age-Threshold Algorithm for Garbage Collection in Log-Structured Arrays and File Systems (1998) (32)
Hashing Schemes for Extendible Arrays (1977) (32)
Bounds on the time to reach agreement in the presence of timing uncertainty (1994) (29)
On the power of 2-way probabilistic finite state automata (1989) (28)
The Complexity of Approximate Counting (Preliminary Version) (1983) (26)
Some simplified polynomial complete problems (1974) (24)
The Complexity of PDL with Interleaving (1996) (22)
2-round zero knowledge and proof auditors (2002) (22)
Evaluation of polynomials with super-preconditioning (1976) (20)
Flipping persuasively in constant expected time (1986) (20)
Consensus in the presence of partial synchrony (Preliminary Version) (1984) (18)
Flipping Persuasively in Constant Time (1990) (16)
On the Number of Comparisons to Find the Intersection of Two Relations (1979) (16)
Alternation Bounded Auxiliary Pushdown Automata (1984) (15)
In-Place Reconstruction of Version Differences (2003) (15)
Efficiently extendible mappings for balanced data distribution (1996) (14)
Finite state verifiers II: zero knowledge (1992) (13)
Uniform Data Encodings (1980) (13)
The closure of Monadic NP (extended abstract) (1998) (12)
ON THE MINIMAL SYNCHRONISMNEEDED FOR DISTRIBUTED CONSENSUS (1983) (12)
Bounds on the Evaluation Time for Rational Polynomials (1971) (10)
Zero-Knowledge With Finite State Verifiers (1988) (8)
The complexity of backtrack searches (1985) (8)
Pseudorandom Number Generation and Space Complexity (1983) (7)
On Monadic NP vs. Monadic co-NP (Extended Abstract) (1993) (6)
Scalable Session Locking for a Distributed File System (2001) (5)
Links between complexity theory and constrained block coding (2001) (3)
Chapter 9 Computational complexity (1992) (3)
Alternating Pushdown Automata (Preliminary Report) (1978) (3)
Local Computations on Static and Dynamic Graphs (Preliminary Version). (1995) (3)
The Distributed Firing Squad Problem (Preliminary Version) (1985) (2)
Hashing schemes for extendible arrays (Extended Abstract) (1975) (2)
Zero-Knowledge With Finite State Verifiers (Extended Abstract) (1990) (2)
Experimentally Evaluating In-Place Delta Reconstruction (2002) (2)
Storage schemes for boundedly extendible arrays (1977) (1)
Pohl-Warnsdorf – Revisited (2004) (1)
Links between complexity theory and constrained block coding (2001) (1)
Simulations of the Age-threshold and Fitness Free Space Collection Algorithms on a Long Trace (2007) (1)
On Closure Properties of Bounded 2-sided Error Com- the Equivalence Problem for Regular Expres- Sions with Squaring Requires Exponential Space. In (1994) (0)
The Complexity of Backtrack Searches (Preliminary Version) (1985) (0)
PUpping Persuasively in CODstant Expeeted Time (Preliminary version) (1986) (0)
Modelling Ge- Netic Algorithms with Markov Chains. In (1994) (0)
Zero-knowledge with finite state verifiers (invited talk) (1990) (0)
Flipping Persuasively in Constant Expected Time (Preliminary Version) (1986) (0)
LCS / TM-270 0 In I CONSENSUS IN THE PRESENCE Cl OF PARTIAL SYNCHRONY-( PRELIMINARY VERSION ) (0)
Potential Course Projects Course Projects 2. Model Checking Using Interpolation * (2007) (0)
An Architecture for Provably Secure Computation (2006) (0)
Bounds on Polynomial Evaluation Algorithms (1972) (0)

This paper list is powered by the following services:

Other Resources About Larry Stockmeyer

en.wikipedia.org

What Schools Are Affiliated With Larry Stockmeyer?

Larry Stockmeyer is affiliated with the following schools: