| 2015 | EDBT | Assignment of Different-Sized Inputs in MapReduce. | Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman |
| 2008 | SOFSEM | Tabu search for the BWC problem. | Daniel Berend, Ephraim Korach, Shira Zucker |
| 2007 | SSS | Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract). | Shlomi Dolev, Ephraim Korach, Galit Uzan |
| 2006 | SODA | Subgraph characterization of Red/Blue-Split Graph and Knig Egervry Graphs. | Ephraim Korach, Thnh Nguyen, Britta Peis |
| 2005 | WG | Optimal Hypergraph Tree-Realization. | Ephraim Korach, Margarita Razgon |
| 2004 | SMC | Transition matrix methodology for evaluating sensor fusion mapping algorithms. | Ofir Cohen, Yael Edan, Ephraim Korach |
| 1999 | INFOCOM | The Sound of Silence: Guessing Games for Saving Energy in Mobile Environment. | Shlomi Dolev, Ephraim Korach, Dmitry Yukelson |
| 1999 | PODC | The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment. | Shlomi Dolev, Ephraim Korach, Dmitry Yukelson |
| 1998 | ISCC | Algorithms for locating resources in a communication network. | Ran Giladi, Ephraim Korach, Rony Ohayon |
| 1994 | SPAA | On Testing Cache-Coherent Shared Memories. | Phillip B. Gibbons, Ephraim Korach |
| 1988 | CONCUR | Optimal Synchronization of ABD Networks. | Ephraim Korach, Gerard Tel, Shmuel Zaks |
| 1988 | WG | DFS Tree Construction: Algorithms and Characterizations. | Ephraim Korach, Zvi Ostfeld |
| 1985 | PODC | A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. | Ephraim Korach, Shay Kutten, Shlomo Moran |
| 1985 | PODC | 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 |
| 1984 | PODC | Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. | Ephraim Korach, Shlomo Moran, Shmuel Zaks |
| 1982 | STOC | A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms | Jan K. Pachl, Ephraim Korach, Doron Rotem |