Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,587,597 papers from all fields of science

Search

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…

2010

2010

The complexity class PSPACE is one of the most robust concepts in contemporary computer science. Aside from the fact that space…

2007

2007

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

2007

2007

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

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…

1990

1990

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

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…

Highly Cited

1980

Highly Cited

1980

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

Highly Cited

1978

Highly Cited

1978

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