Journal of Algorithms

Paper

01 Jan 1982

An O(logn) parallel connectivity algorithm

View publication

Abstract

No abstract available.

Paper

Implementation of simultaneous memory address access in models that forbid it

Uzi Vishkin

Journal of Algorithms

Paper

Complexity of finding k-path-free dominating sets in graphs

Reuven Bar-Yehuda, Uzi Vishkin

Information Processing Letters

Paper

Another look at the degree constrained subgraph problem

Yossi Shiloach

Information Processing Letters

Paper

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Yuri Gurevich, Larry Stockmeyer, et al.

Journal of the ACM

View all publications