Model of computation

Known as: Models of computation, Computational formalism, Computational mechanism 
In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
020040019562016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In recent years the MapReduce framework has emerged as one of the most widely used parallel computing platforms for processing… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the time… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are… (More)
  • figure 1.2
  • figure 1.1
  • figure 1.3
  • figure 1.4
  • figure 1.7
Is this relevant?
Highly Cited
1994
Highly Cited
1994
TheUniform Memory Hierarchy (UMH) model introduced in this paper captures performance-relevant aspects of the hierarchical nature… (More)
  • figure I
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Demarcation of the border between solvable and unsolvable distributed tdis under various models is the holy grail of the theory… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS… (More)
Is this relevant?