Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

2007

2007

Abstract We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL) can be solved in… Expand

2007

2007

This work is concerned with the computational complexity of a model of computation that is inspired by optical computers. We… Expand

1995

1995

A matching M of a graph G = (V,E) is a subset of the set of edges E such that no two edges in M are adjacent. A maximum weight… Expand

1990

1990

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

1989

1989

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

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

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

Highly Cited

1980

Highly Cited

1980

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

Highly Cited

1978

Highly Cited

1978

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