| 2006 |
|---|
| 25 | EE | Amir Nahir,
Yossi Shiloach,
Avi Ziv:
Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation.
Haifa Verification Conference 2006: 16-33 |
| 1987 |
|---|
| 24 | | Baruch Awerbuch,
Yossi Shiloach:
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.
IEEE Trans. Computers 36(10): 1258-1263 (1987) |
| 1986 |
|---|
| 23 | | Amos Israeli,
Yossi Shiloach:
An Improved Parallel Algorithm for Maximal Matching.
Inf. Process. Lett. 22(2): 57-60 (1986) |
| 1984 |
|---|
| 22 | | Baruch Awerbuch,
Amos Israeli,
Yossi Shiloach:
Finding Euler Circuits in Logarithmic Parallel Time
STOC 1984: 249-257 |
| 1982 |
|---|
| 21 | EE | Yossi Shiloach,
Uzi Vishkin,
Shmuel Zaks:
Golden ratios in a pairs covering problem.
Discrete Mathematics 41(1): 57-65 (1982) |
| 20 | | Yossi Shiloach,
Uzi Vishkin:
An O(log n) Parallel Connectivity Algorithm.
J. Algorithms 3(1): 57-67 (1982) |
| 19 | | Yossi Shiloach,
Uzi Vishkin:
An O(n² log n) Parallel MAX-FLOW Algorithm.
J. Algorithms 3(2): 128-146 (1982) |
| 1981 |
|---|
| 18 | | Yehoshua Perl,
Yossi Shiloach:
Efficient Optimization of Monotonic Functions on Trees.
CAAP 1981: 332-339 |
| 17 | | Yossi Shiloach,
Uzi Vishkin:
Finding the maximum, merging and sorting in a parallel computation model.
CONPAR 1981: 314-327 |
| 16 | | Yossi Shiloach:
Another Look at the Degree Constrained Subgraph Problem.
Inf. Process. Lett. 12(2): 89-92 (1981) |
| 15 | EE | Shimon Even,
Yossi Shiloach:
An On-Line Edge-Deletion Problem.
J. ACM 28(1): 1-4 (1981) |
| 14 | | Yossi Shiloach,
Uzi Vishkin:
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model.
J. Algorithms 2(1): 88-102 (1981) |
| 13 | | Yossi Shiloach:
Fast Canonization of Circular Strings.
J. Algorithms 2(2): 107-121 (1981) |
| 1980 |
|---|
| 12 | EE | Yossi Shiloach:
A Polynomial Solution to the Undirected Two Paths Problem.
J. ACM 27(3): 445-456 (1980) |
| 11 | | Yossi Shiloach:
A Multi-Terminal Minimum Cut Algorithm for Planar Graphs.
SIAM J. Comput. 9(2): 219-224 (1980) |
| 10 | | Bengt Aspvall,
Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.
SIAM J. Comput. 9(4): 827-845 (1980) |
| 1979 |
|---|
| 9 | | Bengt Aspvall,
Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality
FOCS 1979: 205-217 |
| 8 | | Yossi Shiloach:
Edge-Disjoint Branching in Directed Multigraphs.
Inf. Process. Lett. 8(1): 24-27 (1979) |
| 7 | | Yossi Shiloach:
Strong Linear Orderings of a Directed Network.
Inf. Process. Lett. 8(3): 146-148 (1979) |
| 6 | | Yossi Shiloach:
A Fast Equivalence-Checking Algorithm for Circular Lists.
Inf. Process. Lett. 8(5): 236-238 (1979) |
| 5 | EE | Tomas H. Varkony,
Yossi Shiloach,
Dennis H. Smith:
Computer-Assisted Examination of Chemical Compounds for Structural Similarities.
Journal of Chemical Information and Computer Sciences 19(2): 104-111 (1979) |
| 4 | | Yossi Shiloach:
Multi-Terminal 0-1 Flow.
SIAM J. Comput. 8(1): 15-32 (1979) |
| 3 | | Alon Itai,
Yossi Shiloach:
Maximum Flow in Planar Networks.
SIAM J. Comput. 8(2): 135-150 (1979) |
| 2 | | Yossi Shiloach:
A Minimum Linear Arrangement Algorithm for Undirected Trees.
SIAM J. Comput. 8(3): 422-430 (1979) |
| 1978 |
|---|
| 1 | EE | Yehoshua Perl,
Yossi Shiloach:
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph.
J. ACM 25(1): 1-9 (1978) |
