Yossi Shiloach

According to our database, Yossi Shiloach authored at least 25 papers between 1978 and 2006.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2006

Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation.

Amir Nahir, Yossi Shiloach, Avi Ziv

Proceedings of the Hardware and Software, 2006

1987

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.

Baruch Awerbuch, Yossi Shiloach

IEEE Trans. Computers, 1987

1986

An Improved Parallel Algorithm for Maximal Matching.

Amos Israeli, Yossi Shiloach

Inf. Process. Lett., 1986

1984

Finding Euler Circuits in Logarithmic Parallel Time

Baruch Awerbuch, Amos Israeli, Yossi Shiloach

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1982

The complexity of finding maximum disjoint paths with length constraints.

Alon Itai, Yehoshua Perl, Yossi Shiloach

Networks, 1982

An O(n² log n) Parallel MAX-FLOW Algorithm.

Yossi Shiloach, Uzi Vishkin

J. Algorithms, 1982

An O(log n) Parallel Connectivity Algorithm.

Yossi Shiloach, Uzi Vishkin

J. Algorithms, 1982

Golden ratios in a pairs covering problem.

Yossi Shiloach, Uzi Vishkin, Shmuel Zaks

Discret. Math., 1982

1981

Finding the Maximum, Merging, and Sorting in a Parallel Computation Model.

Yossi Shiloach, Uzi Vishkin

J. Algorithms, 1981

Fast Canonization of Circular Strings.

Yossi Shiloach

J. Algorithms, 1981

An On-Line Edge-Deletion Problem.

Shimon Even, Yossi Shiloach

J. ACM, 1981

Another Look at the Degree Constrained Subgraph Problem.

Yossi Shiloach

Inf. Process. Lett., 1981

Efficient Optimization of Monotonic Functions on Trees.

Yehoshua Perl, Yossi Shiloach

Proceedings of the CAAP '81, 1981

1980

A Multi-Terminal Minimum Cut Algorithm for Planar Graphs.

Yossi Shiloach

SIAM J. Comput., 1980

A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.

Bengt Aspvall, Yossi Shiloach

SIAM J. Comput., 1980

A Polynomial Solution to the Undirected Two Paths Problem.

Yossi Shiloach

J. ACM, 1980

1979

Multi-Terminal 0-1 Flow.

Yossi Shiloach

SIAM J. Comput., 1979

A Minimum Linear Arrangement Algorithm for Undirected Trees.

Yossi Shiloach

SIAM J. Comput., 1979

Maximum Flow in Planar Networks.

Alon Itai, Yossi Shiloach

SIAM J. Comput., 1979

Computer-Assisted Examination of Chemical Compounds for Structural Similarities.

Tomas H. Varkony, Yossi Shiloach, Dennis H. Smith

J. Chem. Inf. Comput. Sci., 1979

A Fast Equivalence-Checking Algorithm for Circular Lists.

Yossi Shiloach

Inf. Process. Lett., 1979

Strong Linear Orderings of a Directed Network.

Yossi Shiloach

Inf. Process. Lett., 1979

Edge-Disjoint Branching in Directed Multigraphs.

Yossi Shiloach

Inf. Process. Lett., 1979

1978

Permutation layout.

M. Cutler, Yossi Shiloach

Networks, 1978

Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph.

Yehoshua Perl, Yossi Shiloach

J. ACM, 1978