E
Ephraim Korach
Researcher at Ben-Gurion University of the Negev
Publications - 64
Citations - 1342
Ephraim Korach is an academic researcher from Ben-Gurion University of the Negev. The author has contributed to research in topics: Time complexity & Spanning tree. The author has an hindex of 19, co-authored 64 publications receiving 1286 citations. Previous affiliations of Ephraim Korach include Utrecht University & IBM.
Papers
More filters
Journal ArticleDOI
Testing Shared Memories
TL;DR: The first formal study of the problem of testing shared-memory multiprocessors to determine if they are indeed providing a sequentially consistent memory is presented, which has applications to testing new memory system designs and realizations, providing run-time fault tolerance, and detecting bugs in parallel programs.
Proceedings ArticleDOI
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
TL;DR: One implication of the results is that finding a spanning tree in a complete network is easier than finding a minimum weight spanning Tree in such a network, which may require O(n)>(supscrpt>2
Journal ArticleDOI
Distributed algorithms for finding centers and medians in networks
TL;DR: On considere le probleme de determiner d'une maniere repartie les centres and milieux d'un reseau de chaque nœud seulement locale de cha Queen Elizabeth II d'Italia.
Journal ArticleDOI
A modular technique for the design of efficient distributed leader finding algorithms
TL;DR: A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed, and in some cases the message complexity of the resulting algorithms is better by a constant factor than that of previously known algorithms.
Journal ArticleDOI
Tree-width, path-width, and cutwidth
Ephraim Korach,Nir Solel +1 more
TL;DR: It is proved that c ( G )=O(tw( G )· Δ ( G)·log n ), and if ({ X i : i ∈ I }, T =( I, A )) is a tree decomposition of G with tree-width≤ k then c (G )≤( k +1)·δ ( G ), and pw( G)=O (log n)· c ( T ).