Ephraim Korach

According to our database, Ephraim Korach authored at least 48 papers between 1982 and 2016.

Collaborative distances:

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

2016

Assignment Problems of Different-Sized Inputs in MapReduce.

Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman

ACM Trans. Knowl. Discov. Data, 2016

Magnifying computing gaps: Establishing encrypted communication over unidirectional channels.

Shlomi Dolev, Ephraim Korach, Ximing Li, Yin Li, Galit Uzan

Theor. Comput. Sci., 2016

2015

Anticoloring of the rook's graph.

Daniel Berend, Ephraim Korach, Orly Yahalom

Discret. Appl. Math., 2015

2014

Assignment of Different-Sized Inputs in MapReduce.

Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman

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

2012

Tabu search for the BWC problem.

Daniel Berend, Ephraim Korach, Shira Zucker

J. Glob. Optim., 2012

2010

Anticoloring and separation of graphs.

Daniel Berend, Ephraim Korach, Shira Zucker

Discret. Math., 2010

2008

Minimal cutwidth linear arrangements of abelian Cayley graphs.

Daniel Berend, Ephraim Korach, Vladimir Lipets

Discret. Math., 2008

Anticoloring of a family of grid graphs.

Daniel Berend, Ephraim Korach, Shira Zucker

Discret. Optim., 2008

The complete optimal stars-clustering-tree problem.

Ephraim Korach, Michal Stern

Discret. Appl. Math., 2008

Equistable distance-hereditary graphs.

Ephraim Korach, Uri N. Peled, Udi Rotics

Discret. Appl. Math., 2008

2007

A Reduction of the Anticoloring Problem to Connected Graphs.

Daniel Berend, Ephraim Korach, Shira Zucker

Electron. Notes Discret. Math., 2007

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

Shlomi Dolev, Ephraim Korach, Galit Uzan

Proceedings of the Stabilization, 2007

2006

On the Optimal Stars Clustering Tree Problem.

Michal Stern, Ephraim Korach

Electron. Notes Discret. Math., 2006

Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs.

Ephraim Korach, Thành Nguyen, Britta Peis

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.

Avichai Cohen, Ephraim Korach, Mark Last, Rony Ohayon

Fuzzy Sets Syst., 2005

Optimal Hypergraph Tree-Realization.

Ephraim Korach, Margarita Razgon

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

2004

Path selection under multiple QoS constraints-a practical approach.

Ran Giladi, Ephraim Korach, Rony Ohayon

J. High Speed Networks, 2004

Transition matrix methodology for evaluating sensor fusion mapping algorithms.

Ofir Cohen, Yael Edan, Ephraim Korach

Proceedings of the IEEE International Conference on Systems, 2004

2003

The clustering matroid and the optimal clustering tree.

Ephraim Korach, Michal Stern

Math. Program., 2003

Equistable series-parallel graphs.

Ephraim Korach, Uri N. Peled

Discret. Appl. Math., 2003

Placement of network resources in communication networks.

Ran Giladi, Ephraim Korach, Rony Ohayon

Comput. Networks, 2003

Behavior Analysis of Grid-map based Sensor Fusion Algorithms.

Ofir Cohen, Shayer Gil, Ephraim Korach, Yael Edan

Proceedings of the IASTED International Conference Robotics and Applications, 2003

2002

Path selection in networks with non-deterministic information.

Ephraim Korach, Rony Ohayon

Proceedings of the IEEE International Conference on Communications, 2002

2001

The Sound of Silence: Guessing Games for Saving Energy in a Mobile Environment.

Shlomi Dolev, Ephraim Korach, Dmitry Yukelson

J. Parallel Distributed Comput., 2001

2000

On Extremal Multiflows.

Hagai Ilani, Ephraim Korach, Michael Lomonosov

J. Comb. Theory B, 2000

1998

Algorithms for locating resources in a communication network.

Ran Giladi, Ephraim Korach, Rony Ohayon

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

1997

Testing Shared Memories.

Phillip B. Gibbons, Ephraim Korach

SIAM J. Comput., 1997

1995

On the existence of special depth first search trees.

Ephraim Korach, Zvi Ostfeld

J. Graph Theory, 1995

1994

Synchronizing ABD networks.

Gerard Tel, Ephraim Korach, Shmuel Zaks

IEEE/ACM Trans. Netw., 1994

Two-Trees Optimal <i>T</i>-Join and Integral Packing of <i>T</i>-Cuts.

Ephraim Korach

J. Comb. Theory B, 1994

On Testing Cache-Coherent Shared Memories.

Phillip B. Gibbons, Ephraim Korach

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.

Ephraim Korach, Zvi Ostfeld

Discret. Math., 1993

General Vertex Disjoint Paths in Series-Parallel Graphs.

Ephraim Korach, Ady Tal

Discret. Appl. Math., 1993

Tree-Width, Path-Widt, and Cutwidth.

Ephraim Korach, Nir Solel

Discret. Appl. Math., 1993

A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs.

Ephraim Korach, Michal Penn

Discret. Appl. Math., 1993

1992

Tight integral duality gap in the Chinese Postman problem.

Ephraim Korach, Michal Penn

Math. Program., 1992

The Complexity of Sequential Consistency.

Phillip B. Gibbons, Ephraim Korach

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.

Ephraim Korach, Shay Kutten, Shlomo Moran

ACM Trans. Program. Lang. Syst., 1990

1989

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

Ephraim Korach, Shlomo Moran, Shmuel Zaks

Theor. Comput. Sci., 1989

1988

DFS Tree Construction: Algorithms and Characterizations.

Ephraim Korach, Zvi Ostfeld

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

Optimal Synchronization of ABD Networks.

Ephraim Korach, Gerard Tel, Shmuel Zaks

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.

Ephraim Korach, Shlomo Moran, Shmuel Zaks

SIAM J. Comput., 1987

Analysis of a Distributed Algorithm for Extrema Finding in a Ring.

Doron Rotem, Ephraim Korach, Nicola Santoro

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.

Ephraim Korach, Shlomo Moran, Shmuel Zaks

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

1984

Distributed Algorithms for Finding Centers and Medians in Networks.

Ephraim Korach, Doron Rotem, Nicola Santoro

ACM Trans. Program. Lang. Syst., 1984

Lower Bounds for Distributed Maximum-Finding Algorithms.

Jan K. Pachl, Ephraim Korach, Doron Rotem

J. ACM, 1984

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

Ephraim Korach, Shlomo Moran, Shmuel Zaks

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

1982

A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, Ephraim Korach, Doron Rotem

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