Ephraim Korach

Publication Activity (10 Years)

Years Active: 1982-2016
Publications (10 Years): 2

Top Topics

Distributed Processing

High Performance Data Mining

Top Venues

Discret. Appl. Math.

J. Glob. Optim.

ACM Trans. Knowl. Discov. Data

Publications

Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman
Assignment Problems of Different-Sized Inputs in MapReduce. ACM Trans. Knowl. Discov. Data 11 (2) (2016)
Shlomi Dolev, Ephraim Korach, Ximing Li, Yin Li, Galit Uzan
Magnifying computing gaps: Establishing encrypted communication over unidirectional channels. Theor. Comput. Sci. 636 (2016)
Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman
Assignment Problems of Different-Sized Inputs in MapReduce. CoRR (2015)
Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman
Assignment of Different-Sized Inputs in MapReduce. EDBT/ICDT Workshops (2015)
Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman
Assignment of Different-Sized Inputs in MapReduce. CoRR (2015)
Daniel Berend, Ephraim Korach, Orly Yahalom
Anticoloring of the rook's graph. Discret. Appl. Math. 188 (2015)
Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman
Assignment of Different-Sized Inputs in MapReduce. DISC (2014)
Daniel Berend, Ephraim Korach, Shira Zucker
Tabu search for the BWC problem. J. Glob. Optim. 54 (4) (2012)
Daniel Berend, Ephraim Korach, Shira Zucker
Anticoloring and separation of graphs. Discret. Math. 310 (3) (2010)
Daniel Berend, Ephraim Korach, Shira Zucker
Anticoloring of a family of grid graphs. Discret. Optim. 5 (3) (2008)
Daniel Berend, Ephraim Korach, Vladimir Lipets
Minimal cutwidth linear arrangements of abelian Cayley graphs. Discret. Math. 308 (20) (2008)
Daniel Berend, Ephraim Korach, Shira Zucker
Tabu search for the BWC problem. SOFSEM (2) (2008)
Ephraim Korach, Uri N. Peled, Udi Rotics
Equistable distance-hereditary graphs. Discret. Appl. Math. 156 (4) (2008)
Ephraim Korach, Michal Stern
The complete optimal stars-clustering-tree problem. Discret. Appl. Math. 156 (4) (2008)
Daniel Berend, Ephraim Korach, Shira Zucker
A Reduction of the Anticoloring Problem to Connected Graphs. Electron. Notes Discret. Math. 28 (2007)
Shlomi Dolev, Ephraim Korach, Galit Uzan
Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract). SSS (2007)
Michal Stern, Ephraim Korach
On the Optimal Stars Clustering Tree Problem. Electron. Notes Discret. Math. 27 (2006)
Ephraim Korach, Thành Nguyen, Britta Peis
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. SODA (2006)
Ephraim Korach, Margarita Razgon
Optimal Hypergraph Tree-Realization. WG (2005)
Avichai Cohen, Ephraim Korach, Mark Last, Rony Ohayon
A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks. Fuzzy Sets Syst. 150 (3) (2005)
Ran Giladi, Ephraim Korach, Rony Ohayon
Path selection under multiple QoS constraints-a practical approach. J. High Speed Networks 13 (2) (2004)
Ofir Cohen, Yael Edan, Ephraim Korach
Transition matrix methodology for evaluating sensor fusion mapping algorithms. SMC (4) (2004)
Ephraim Korach, Michal Stern
The clustering matroid and the optimal clustering tree. Math. Program. 98 (1-3) (2003)
Ofir Cohen, Shayer Gil, Ephraim Korach, Yael Edan
Behavior Analysis of Grid-map based Sensor Fusion Algorithms. Robotics and Applications (2003)
Ran Giladi, Ephraim Korach, Rony Ohayon
Placement of network resources in communication networks. Comput. Networks 43 (2) (2003)
Ephraim Korach, Uri N. Peled
Equistable series-parallel graphs. Discret. Appl. Math. 132 (1-3) (2003)
Ephraim Korach, Rony Ohayon
Path selection in networks with non-deterministic information. ICC (2002)
Shlomi Dolev, Ephraim Korach, Dmitry Yukelson
The Sound of Silence: Guessing Games for Saving Energy in a Mobile Environment. J. Parallel Distributed Comput. 61 (7) (2001)
Hagai Ilani, Ephraim Korach, Michael Lomonosov
On Extremal Multiflows. J. Comb. Theory, Ser. B 79 (2) (2000)
Shlomi Dolev, Ephraim Korach, Dmitry Yukelson
The Sound of Silence: Guessing Games for Saving Energy in Mobile Environment. INFOCOM (1999)
Shlomi Dolev, Ephraim Korach, Dmitry Yukelson
The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment. PODC (1999)
Ran Giladi, Ephraim Korach, Rony Ohayon
Algorithms for locating resources in a communication network. ISCC (1998)
Phillip B. Gibbons, Ephraim Korach
Testing Shared Memories. SIAM J. Comput. 26 (4) (1997)
Ephraim Korach, Zvi Ostfeld
On the existence of special depth first search trees. J. Graph Theory 19 (4) (1995)
Phillip B. Gibbons, Ephraim Korach
On Testing Cache-Coherent Shared Memories. SPAA (1994)
Gerard Tel, Ephraim Korach, Shmuel Zaks
Synchronizing ABD networks. IEEE/ACM Trans. Netw. 2 (1) (1994)
Ephraim Korach
-Cuts. J. Comb. Theory, Ser. B 62 (1) (1994)
Ephraim Korach, Nir Solel
Tree-Width, Path-Widt, and Cutwidth. Discret. Appl. Math. 43 (1) (1993)
Ephraim Korach, Michal Penn
A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. Discret. Appl. Math. 47 (1) (1993)
Ephraim Korach, Ady Tal
General Vertex Disjoint Paths in Series-Parallel Graphs. Discret. Appl. Math. 41 (2) (1993)
Ephraim Korach, Zvi Ostfeld
Recognition of DFS trees: sequential and parallel algorithms with refined verifications. Discret. Math. 114 (1-3) (1993)
Phillip B. Gibbons, Ephraim Korach
The Complexity of Sequential Consistency. SPDP (1992)
Ephraim Korach, Michal Penn
Tight integral duality gap in the Chinese Postman problem. Math. Program. 55 (1992)
Ephraim Korach, Shay Kutten, Shlomo Moran
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ACM Trans. Program. Lang. Syst. 12 (1) (1990)
Ephraim Korach, Shlomo Moran, Shmuel Zaks
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64 (1) (1989)
Ephraim Korach, Zvi Ostfeld
DFS Tree Construction: Algorithms and Characterizations. WG (1988)
Ephraim Korach, Gerard Tel, Shmuel Zaks
Optimal Synchronization of ABD Networks. Concurrency (1988)
Doron Rotem, Ephraim Korach, Nicola Santoro
Analysis of a Distributed Algorithm for Extrema Finding in a Ring. J. Parallel Distributed Comput. 4 (6) (1987)
Ephraim Korach, Shlomo Moran, Shmuel Zaks
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. SIAM J. Comput. 16 (2) (1987)
Ephraim Korach, Shlomo Moran, Shmuel Zaks
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC (1985)
Ephraim Korach, Shay Kutten, Shlomo Moran
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. PODC (1985)
Ephraim Korach, Doron Rotem, Nicola Santoro
Distributed Algorithms for Finding Centers and Medians in Networks. ACM Trans. Program. Lang. Syst. 6 (3) (1984)
Jan K. Pachl, Ephraim Korach, Doron Rotem
Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31 (4) (1984)
Ephraim Korach, Shlomo Moran, Shmuel Zaks
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. PODC (1984)
Jan K. Pachl, Ephraim Korach, Doron Rotem
A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms STOC (1982)