Journal of Algorithms

Paper

01 Jan 1982

An O(logn) parallel connectivity algorithm

View publication

Abstract

No abstract available.

Paper

Solving NP-hard problems in 'almost trees': Vertex cover

Don Coppersmith, Uzi Vishkin

Discrete Applied Mathematics

Conference paper

A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality

Bengt Aspvall, Yossi Shiloach

FOCS 1979

Paper

Finding the maximum, merging, and sorting in a parallel computation model

Yossi Shiloach, Uzi Vishkin

Journal of Algorithms

Paper

A fast algorithm for solving systems of linear equations with two variables per equation

Bengt Aspvall, Yossi Shiloach

Linear Algebra and Its Applications

View all publications