In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in… (More)

(More)

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

- Scott Aaronson, Alex Arkhipov
- STOC
- 2010

We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Robert A. Hearn, Erik D. Demaine
- Theor. Comput. Sci.
- 2005

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
- Distributed Computing
- 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

- Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
- IEEE Trans. on CAD of Integrated Circuits and…
- 1998

We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- G. Ramalingam, Thomas W. Reps
- Theor. Comput. Sci.
- 1996

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the time… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Zhenghan Wang
- 1996

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker
- Algorithmica
- 1994

TheUniform Memory Hierarchy (UMH) model introduced in this paper captures performance-relevant aspects of the hierarchical nature… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Elizabeth Borowsky, Eli Gafni
- STOC
- 1993

Demarcation of the border between solvable and unsolvable distributed tdis under various models is the holy grail of the theory… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Yishay Mansour, Noam Nisan, Prasoon Tiwari
- STOC
- 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?