The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ephraim Korach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ephraim Korach, Doron Rotem, Nicola Santoro
    Distributed Algorithms for Finding Centers and Medians in Networks. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1984, v:6, n:3, pp:380-401 [Journal]
  2. Ephraim Korach, Gerard Tel, Shmuel Zaks
    Optimal Synchronization of ABD Networks. [Citation Graph (0, 0)][DBLP]
    Concurrency, 1988, pp:353-367 [Conf]
  3. Shlomi Dolev, Ephraim Korach, Dmitry Yukelson
    The Sound of Silence: Guessing Games for Saving Energy in Mobile Environment. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:768-775 [Conf]
  4. Shlomi Dolev, Ephraim Korach, Dmitry Yukelson
    The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:273- [Conf]
  5. Ephraim Korach, Shay Kutten, Shlomo Moran
    A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:163-174 [Conf]
  6. Ephraim Korach, Shlomo Moran, Shmuel Zaks
    Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. [Citation Graph (0, 0)][DBLP]
    PODC, 1984, pp:199-207 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:277-286 [Conf]
  8. Ofir Cohen, Shayer Gil, Ephraim Korach, Yael Edan
    Behavior Analysis of Grid-map based Sensor Fusion Algorithms. [Citation Graph (0, 0)][DBLP]
    Robotics and Applications, 2003, pp:201-206 [Conf]
  9. Ofir Cohen, Yael Edan, Ephraim Korach
    Transition matrix methodology for evaluating sensor fusion mapping algorithms. [Citation Graph (0, 0)][DBLP]
    SMC (4), 2004, pp:3869-3874 [Conf]
  10. Ephraim Korach, Thành Nguyen, Britta Peis
    Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:842-850 [Conf]
  11. Phillip B. Gibbons, Ephraim Korach
    On Testing Cache-Coherent Shared Memories. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:177-188 [Conf]
  12. Phillip B. Gibbons, Ephraim Korach
    The Complexity of Sequential Consistency. [Citation Graph (0, 0)][DBLP]
    SPDP, 1992, pp:317-325 [Conf]
  13. Jan K. Pachl, Ephraim Korach, Doron Rotem
    A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:378-382 [Conf]
  14. Ephraim Korach, Zvi Ostfeld
    DFS Tree Construction: Algorithms and Characterizations. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:87-106 [Conf]
  15. Ephraim Korach, Margarita Razgon
    Optimal Hypergraph Tree-Realization. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:261-270 [Conf]
  16. Ran Giladi, Ephraim Korach, Rony Ohayon
    Placement of network resources in communication networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2003, v:43, n:2, pp:195-209 [Journal]
  17. Ephraim Korach, Uri N. Peled
    Equistable series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:149-162 [Journal]
  18. Ephraim Korach, Michal Penn
    A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:1, pp:77-83 [Journal]
  19. Ephraim Korach, Nir Solel
    Tree-Width, Path-Widt, and Cutwidth. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:43, n:1, pp:97-101 [Journal]
  20. Ephraim Korach, Ady Tal
    General Vertex Disjoint Paths in Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:41, n:2, pp:147-164 [Journal]
  21. Avichai Cohen, Ephraim Korach, Mark Last, Rony Ohayon
    A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks. [Citation Graph (0, 0)][DBLP]
    Fuzzy Sets and Systems, 2005, v:150, n:3, pp:401-417 [Journal]
  22. Jan K. Pachl, Ephraim Korach, Doron Rotem
    Lower Bounds for Distributed Maximum-Finding Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:905-918 [Journal]
  23. Hagai Ilani, Ephraim Korach, Michael Lomonosov
    On Extremal Multiflows. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:183-210 [Journal]
  24. Ephraim Korach
    Two-Trees Optimal T-Join and Integral Packing of T-Cuts. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:1-10 [Journal]
  25. Ran Giladi, Ephraim Korach, Rony Ohayon
    Path selection under multiple QoS constraints-a practical approach. [Citation Graph (0, 0)][DBLP]
    J. High Speed Networks, 2004, v:13, n:2, pp:155-167 [Journal]
  26. Shlomi Dolev, Ephraim Korach, Dmitry Yukelson
    The Sound of Silence: Guessing Games for Saving Energy in a Mobile Environment. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:7, pp:868-883 [Journal]
  27. Doron Rotem, Ephraim Korach, Nicola Santoro
    Analysis of a Distributed Algorithm for Extrema Finding in a Ring. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1987, v:4, n:6, pp:575-591 [Journal]
  28. Ephraim Korach, Michal Penn
    Tight integral duality gap in the Chinese Postman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:183-191 [Journal]
  29. Phillip B. Gibbons, Ephraim Korach
    Testing Shared Memories. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1208-1244 [Journal]
  30. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:231-236 [Journal]
  31. Ephraim Korach, Shlomo Moran, Shmuel Zaks
    Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:1, pp:125-132 [Journal]
  32. Gerard Tel, Ephraim Korach, Shmuel Zaks
    Synchronizing ABD networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1994, v:2, n:1, pp:66-69 [Journal]
  33. Ephraim Korach, Shay Kutten, Shlomo Moran
    A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1990, v:12, n:1, pp:84-101 [Journal]
  34. Shlomi Dolev, Ephraim Korach, Galit Uzan
    Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SSS, 2007, pp:253-265 [Conf]
  35. Ephraim Korach, Zvi Ostfeld
    Recognition of DFS trees: sequential and parallel algorithms with refined verifications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:305-327 [Journal]

  36. Tabu search for the BWC problem. [Citation Graph (, )][DBLP]


  37. The complete optimal stars-clustering-tree problem. [Citation Graph (, )][DBLP]


  38. Equistable distance-hereditary graphs. [Citation Graph (, )][DBLP]


  39. Minimal cutwidth linear arrangements of abelian Cayley graphs. [Citation Graph (, )][DBLP]


  40. Anticoloring and separation of graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002