Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures… Expand

Is this relevant?

2005

2005

We present upper bounds on the computational power of an optical model of computation called the $\mathcal{C}_{2}$-CSM. We show… Expand

Is this relevant?

2005

2005

We investigate the computational complexity of an optically inspired model of computation. The model is called the continuous… Expand

Is this relevant?

1990

1990

We shall study in this chapter the relation between sequential and parallel computations. To this we consider in detail other… Expand

Is this relevant?

1989

1989

Abstract The parallel resources time and hardware and the complexity classes defined by them are studied using the aggregate… Expand

Is this relevant?

1989

1989

Nondeterministic analogues of the well-known language classes NC and SC called NNC and NSC, respectively, are investigated. NC is… Expand

Is this relevant?

1986

1986

It is reasonable to expect parallel machines to be faster than sequential ones. But exactly how much faster do we expect them to… Expand

Is this relevant?

1983

1983

On montre que tout ensemble qui peut etre accepte par une machine de Turing en temps T(n), peut etre accepte par une machine… Expand

Is this relevant?

1980

1980

Parallel time is clearly a fundamental complexity resource for synchronous parallel computation. But study of parallel time… Expand

Is this relevant?

Highly Cited

1978

Highly Cited

1978

A number of different models of synchronous, unbounded parallel computers have appeared in recent literature. Without exception… Expand

Is this relevant?