Ephraim Korach

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