Yossi Shiloach

According to our database1, Yossi Shiloach authored at least 27 papers between 1978 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation.
Proceedings of the Hardware and Software, 2006

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.
IEEE Trans. Computers, 1987

An Improved Parallel Algorithm for Maximal Matching.
Inf. Process. Lett., 1986

Finding Euler Circuits in Logarithmic Parallel Time
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

The complexity of finding maximum disjoint paths with length constraints.
Networks, 1982

An O(n² log n) Parallel MAX-FLOW Algorithm.
J. Algorithms, 1982

An O(log n) Parallel Connectivity Algorithm.
J. Algorithms, 1982

Golden ratios in a pairs covering problem.
Discrete Mathematics, 1982

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

Fast Canonization of Circular Strings.
J. Algorithms, 1981

An On-Line Edge-Deletion Problem.
J. ACM, 1981

Another Look at the Degree Constrained Subgraph Problem.
Inf. Process. Lett., 1981

Finding the maximum, merging and sorting in a parallel computation model.
Proceedings of the CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, 1981

Efficient Optimization of Monotonic Functions on Trees.
Proceedings of the CAAP '81, 1981

A Multi-Terminal Minimum Cut Algorithm for Planar Graphs.
SIAM J. Comput., 1980

A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.
SIAM J. Comput., 1980

A Polynomial Solution to the Undirected Two Paths Problem.
J. ACM, 1980

Multi-Terminal 0-1 Flow.
SIAM J. Comput., 1979

A Minimum Linear Arrangement Algorithm for Undirected Trees.
SIAM J. Comput., 1979

Maximum Flow in Planar Networks.
SIAM J. Comput., 1979

Computer-Assisted Examination of Chemical Compounds for Structural Similarities.
Journal of Chemical Information and Computer Sciences, 1979

A Fast Equivalence-Checking Algorithm for Circular Lists.
Inf. Process. Lett., 1979

Strong Linear Orderings of a Directed Network.
Inf. Process. Lett., 1979

Edge-Disjoint Branching in Directed Multigraphs.
Inf. Process. Lett., 1979

A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

Permutation layout.
Networks, 1978

Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph.
J. ACM, 1978