Yossi Shiloach

27 papers A* 2Journal 22Unranked 3
YearRankTypeTitle / Venue / Authors
2006 — conf
Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation.
Haifa Verification Conference
Amir Nahir, Yossi Shiloach, Avi Ziv
1987 J jnl
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.
IEEE Trans. Computers
Baruch Awerbuch, Yossi Shiloach
1986 J jnl
An Improved Parallel Algorithm for Maximal Matching.
Inf. Process. Lett.
Amos Israeli, Yossi Shiloach
1984 A* conf
Finding Euler Circuits in Logarithmic Parallel Time
STOC
Baruch Awerbuch, Amos Israeli, Yossi Shiloach
1982 J jnl
An O(log n) Parallel Connectivity Algorithm.
J. Algorithms
Yossi Shiloach, Uzi Vishkin
1982 J jnl
An O(n² log n) Parallel MAX-FLOW Algorithm.
J. Algorithms
Yossi Shiloach, Uzi Vishkin
1982 J jnl
Golden ratios in a pairs covering problem.
Discret. Math.
Yossi Shiloach, Uzi Vishkin, Shmuel Zaks
1982 J jnl
The complexity of finding maximum disjoint paths with length constraints.
Networks
Alon Itai, Yehoshua Perl, Yossi Shiloach
1981 J jnl
An On-Line Edge-Deletion Problem.
J. ACM
Shimon Even, Yossi Shiloach
1981 J jnl
Another Look at the Degree Constrained Subgraph Problem.
Inf. Process. Lett.
Yossi Shiloach
1981 — conf
Efficient Optimization of Monotonic Functions on Trees.
CAAP
Yehoshua Perl, Yossi Shiloach
1981 J jnl
Fast Canonization of Circular Strings.
J. Algorithms
Yossi Shiloach
1981 J jnl
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model.
J. Algorithms
Yossi Shiloach, Uzi Vishkin
1981 — conf
Finding the maximum, merging and sorting in a parallel computation model.
CONPAR
Yossi Shiloach, Uzi Vishkin
1980 J jnl
A Multi-Terminal Minimum Cut Algorithm for Planar Graphs.
SIAM J. Comput.
Yossi Shiloach
1980 J jnl
A Polynomial Solution to the Undirected Two Paths Problem.
J. ACM
Yossi Shiloach
1980 J jnl
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.
SIAM J. Comput.
Bengt Aspvall, Yossi Shiloach
1979 J jnl
A Fast Equivalence-Checking Algorithm for Circular Lists.
Inf. Process. Lett.
Yossi Shiloach
1979 J jnl
A Minimum Linear Arrangement Algorithm for Undirected Trees.
SIAM J. Comput.
Yossi Shiloach
1979 A* conf
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality
FOCS
Bengt Aspvall, Yossi Shiloach
1979 J jnl
Computer-Assisted Examination of Chemical Compounds for Structural Similarities.
J. Chem. Inf. Comput. Sci.
Tomas H. Varkony, Yossi Shiloach, Dennis H. Smith
1979 J jnl
Edge-Disjoint Branching in Directed Multigraphs.
Inf. Process. Lett.
Yossi Shiloach
1979 J jnl
Maximum Flow in Planar Networks.
SIAM J. Comput.
Alon Itai, Yossi Shiloach
1979 J jnl
Multi-Terminal 0-1 Flow.
SIAM J. Comput.
Yossi Shiloach
1979 J jnl
Strong Linear Orderings of a Directed Network.
Inf. Process. Lett.
Yossi Shiloach
1978 J jnl
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph.
J. ACM
Yehoshua Perl, Yossi Shiloach
1978 J jnl
Permutation layout.
Networks
M. Cutler, Yossi Shiloach