Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
Alternating Turing machineComputational complexity theoryComputer scientistCynthia Dwork

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Ontopolitics in the Anthropocene : An Introduction to Mapping, Sensing and Hacking
The Anthropocene captures more than a debate over how to address the problems of climate change and global warming. Increasingly… 
Highly Cited
2011
Highly Cited
2011
AN EXPERIMENTAL STUDY OF COLLECTIVE DELIBERATION
We study the effects of deliberation on collective decisions. In a series of experiments, we vary groups' preference… 
Highly Cited
2009
Highly Cited
2009
Compositions of Mercury's earliest crust from magma ocean models
Highly Cited
2007
Highly Cited
2007
Diversified cropping systems in semiarid Montana: Nitrogen use during drought
Highly Cited
2001
Highly Cited
2001
Potential of Desertification Control to Sequester Carbon and Mitigate the Greenhouse Effect
There is a strong link between desertification of the drylands and emission of CO2 from soil and vegetation to the atmosphere… 
1999
1999
Field and in vitro evidence for in-situ bioremediation using compound-specific 13C/12C ratio monitoring
Highly Cited
1986
Highly Cited
1986
On Relativized Exponential and Probabilistic Complexity Classes
Highly Cited
1984
Highly Cited
1984
A theorem on probabilistic constant depth Computations
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… 
Highly Cited
1980
Highly Cited
1980
3-D transformations of images in scanline order
Currerntly texture mapping onto projections of 3-D surfaces is time consuming and subject to considerable aliasing errors… 
Highly Cited
1976
Highly Cited
1976
On parallelism in turing machines
  • D. Kozen
  • 17th Annual Symposium on Foundations of Computer…
  • 1976
  • Corpus ID: 10055267
A model of parallel computation based on a generalization of nondeterminism in Turing machines is introduced. Complexity classes… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)