M. Rodeh

Publications64
h-index27
Citations3,120
Highly Influential Citations142
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • R. Tarjan
  • 421 Publications, 62,322 Citations
  • N. Francez
  • 209 Publications, 3,605 Citations
  • J. Ullman
  • 429 Publications, 80,932 Citations
  • S. Sagiv
  • 178 Publications, 9,973 Citations
  • Publications
  • Influence
The Multi-Tree Approach to Reliability in Distributed Networks
TLDR
We describe a communication protocol which uses k rooted spanning trees having the property that for every vertex ν the paths from ν to the root are edge-disjoint. Expand
  • 288
  • 13
CSSV: towards a realistic tool for statically detecting all buffer overflows in C
TLDR
We present C String Static Verifyer (CSSV), a tool that statically uncovers all string manipulation errors. Expand
  • 263
  • 13
  • PDF
Symmetry breaking in distributed networks
TLDR
We investigate the effects of symmetry on distributed and randomized algorithms and propose probabilistic algorithms to solve the problem. Expand
  • 217
  • 11
  • PDF
Global instruction scheduling for superscalar machines
TLDR
A scheme for global (intra-loop) scheduling is proposed, which uses the control and data dependence information summarized in a Program Dependence Graph, to move instructions well beyond basic block boundaries. Expand
  • 209
  • 10
  • PDF
Finding a Minimum Circuit in a Graph
  • A. Itai, M. Rodeh
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 November 1978
Finding minimum circuits in graphs and digraphs is discussed. An almost minimum circuit is a circuit which may have only one edge more than the minimum. To find an almost minimum circuit an $O(n^2 )$… Expand
  • 105
  • 10
Symmetry breaking in distributive networks
  • A. Itai, M. Rodeh
  • Computer Science
  • 22nd Annual Symposium on Foundations of Computer…
  • 28 October 1981
TLDR
Given a ring (cycle) of n processes it is required to design the processes so that they will be able to choose a leader (a uniquely designated process) by sending messages along the ring. Expand
  • 104
  • 8
Some Matching Problems for Bipartite Graphs
Certam apphcatlons require finding a perfect matching in a bipartite graph that satisfies some additional properties For one such type of restncUon the problem is proven to be NP-complete. If for a… Expand
  • 96
  • 7
  • PDF
A Sparse Table Implementation of Priority Queues
  • 116
  • 7
  • PDF
A distributed abstract data type implemented by a probabilistic communication scheme
  • N. Francez, M. Rodeh
  • Computer Science
  • 21st Annual Symposium on Foundations of Computer…
  • 13 October 1980
TLDR
A probabilistic implementation of guard scheduling is suggested, which allows completely distributed symmetric programs. Expand
  • 55
  • 7
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle
TLDR
We obtain a unidirectional algorithm using at most 1.356 n log n + O ( n ) messages. Expand
  • 213
  • 6
  • PDF