Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Larry Stockmeyer

Known as: Larry J. Stockmeyer 
Larry Joseph Stockmeyer (1948 – 31 July 2004) was an American computer scientist. He was one of the pioneers in the field of computational complexity… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Secular stagnation on the supply side takes the form of a slow 1.6 percent annual growth rate of US potential real GDP, roughly… Expand
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In the exploration and implementation of formation control strategies, communication range and bandwidth limitations form a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We investigate the power of first-order logic with only two variables over /spl omega/-words and finite words, a logic denoted by… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Probabilistic Context-Free Grammars (PCFGs) and variations on them have recently become some of the most common formalisms for… Expand
  • figure 1.2
  • figure 3.6
  • figure 3.8
  • figure 3.15
  • figure 5.12
Is this relevant?
Highly Cited
1984
Highly Cited
1984
1. In t roduc t ion I{t~txml, ly there has been much interest ill tht, comput:Ltional power of circuits o1' bounded dt;pth. In… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • C. Yap
  • Theor. Comput. Sci.
  • 1983
  • Corpus ID: 31802674
We obtain some results of the form: If certain complexity classes satisfy a non-uniform condition, then some unlikely… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • C. Papadimitriou
  • 24th Annual Symposium on Foundations of Computer…
  • 1983
  • Corpus ID: 13632401
Abstract We present a new characterization of MACE in terms of problems in a classical area in optimization, decision-making… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • R. Kannan
  • Inf. Control.
  • 1982
  • Corpus ID: 33367739
As remarked in Cook (“Towards a Complexity Theory of Synchronous Parallel Computation,≓ Univ. of Toronto, 1980), a nonlinear… Expand
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Currerntly texture mapping onto projections of 3-D surfaces is time consuming and subject to considerable aliasing errors… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D. 
  • table 4.2
Is this relevant?