# Ephraim Korach

According to our database

Collaborative distances:

^{1}, Ephraim Korach authored at least 48 papers between 1982 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2016

ACM Trans. Knowl. Discov. Data, 2016

Magnifying computing gaps: Establishing encrypted communication over unidirectional channels.

Theor. Comput. Sci., 2016

2015

Discret. Appl. Math., 2015

2014

Proceedings of the Distributed Computing - 28th International Symposium, 2014

2012

J. Glob. Optim., 2012

2010

Discret. Math., 2010

2008

Discret. Math., 2008

Discret. Optim., 2008

Discret. Appl. Math., 2008

Discret. Appl. Math., 2008

2007

Electron. Notes Discret. Math., 2007

Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract).

Proceedings of the Stabilization, 2007

2006

Electron. Notes Discret. Math., 2006

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks.

Fuzzy Sets Syst., 2005

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

J. High Speed Networks, 2004

Proceedings of the IEEE International Conference on Systems, 2004

2003

Math. Program., 2003

Discret. Appl. Math., 2003

Comput. Networks, 2003

Behavior Analysis of Grid-map based Sensor Fusion Algorithms.

Proceedings of the IASTED International Conference Robotics and Applications, 2003

2002

Proceedings of the IEEE International Conference on Communications, 2002

2001

J. Parallel Distributed Comput., 2001

2000

J. Comb. Theory B, 2000

1998

Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC 1998), June 30, 1998

1997

SIAM J. Comput., 1997

1995

J. Graph Theory, 1995

1994

IEEE/ACM Trans. Netw., 1994

J. Comb. Theory B, 1994

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Recognition of DFS trees: sequential and parallel algorithms with refined verifications.

Discret. Math., 1993

Discret. Appl. Math., 1993

Discret. Appl. Math., 1993

Discret. Appl. Math., 1993

1992

Math. Program., 1992

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1990

A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms.

ACM Trans. Program. Lang. Syst., 1990

1989

Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.

Theor. Comput. Sci., 1989

1988

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

1987

The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors.

SIAM J. Comput., 1987

J. Parallel Distributed Comput., 1987

1985

The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors.

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1984

ACM Trans. Program. Lang. Syst., 1984

J. ACM, 1984

Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors.

Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1982

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982