Journal of Algorithms

Paper

01 Jan 1982

An O(logn) parallel connectivity algorithm

View publication

Abstract

No abstract available.

Conference paper

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

Bengt Aspvall, Yossi Shiloach

FOCS 1979

Paper

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

Don Coppersmith, Uzi Vishkin

Discrete Applied Mathematics

Paper

Implementation of simultaneous memory address access in models that forbid it

Uzi Vishkin

Journal of Algorithms

Paper

Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm

Baruch Schieber, Uzi Vishkin

Discrete Applied Mathematics

View all publications