Search the dblp DataBase
Michael Rodeh :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nissim Francez , Michael Rodeh Achieving Distributed Termination without Freezing. [Citation Graph (2, 0)][DBLP ] IEEE Trans. Software Eng., 1982, v:8, n:3, pp:287-292 [Journal ] Nissim Francez , Michael Rodeh A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme [Citation Graph (1, 0)][DBLP ] FOCS, 1980, pp:373-379 [Conf ] Alon Itai , Alan G. Konheim , Michael Rodeh A Sparse Table Implementation of Priority Queues. [Citation Graph (1, 0)][DBLP ] ICALP, 1981, pp:417-431 [Conf ] Shai Rubin , David Bernstein , Michael Rodeh Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures. [Citation Graph (0, 0)][DBLP ] CC, 1999, pp:259-273 [Conf ] David Bernstein , Michael Rodeh , Shmuel Sagiv Proving Safety of Speculative Load Instructions at Compile Time. [Citation Graph (0, 0)][DBLP ] ESOP, 1992, pp:56-72 [Conf ] Alon Itai , Michael Rodeh Symmetry Breaking in Distributive Networks [Citation Graph (0, 0)][DBLP ] FOCS, 1981, pp:150-158 [Conf ] Alon Itai , Michael Rodeh The Multi-Tree Approach to Reliability in Distributed Networks [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:137-147 [Conf ] Alon Itai , Michael Rodeh Some Matching Problems. [Citation Graph (0, 0)][DBLP ] ICALP, 1977, pp:258-268 [Conf ] Alon Itai , Michael Rodeh Covering a Graph by Circuits. [Citation Graph (0, 0)][DBLP ] ICALP, 1978, pp:289-299 [Conf ] N. Frances , Michael Rodeh , Michel Sintzoff Distributed Termination with Interval Assertions. [Citation Graph (0, 0)][DBLP ] ICFPC, 1981, pp:280-291 [Conf ] Nurit Dor , Michael Rodeh , Shmuel Sagiv Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience). [Citation Graph (0, 0)][DBLP ] PASTE, 1998, pp:27-34 [Conf ] David Bernstein , Michael Rodeh Global Instruction Scheduling for Superscalar Machines. [Citation Graph (0, 0)][DBLP ] PLDI, 1991, pp:241-255 [Conf ] Nurit Dor , Michael Rodeh , Shmuel Sagiv CSSV: towards a realistic tool for statically detecting all buffer overflows in C. [Citation Graph (0, 0)][DBLP ] PLDI, 2003, pp:155-167 [Conf ] Shmuel Sagiv , Nissim Francez , Michael Rodeh , Reinhard Wilhelm A Logic-Based Approach to Data Flow Analysis Problem. [Citation Graph (0, 0)][DBLP ] PLILP, 1990, pp:277-292 [Conf ] Liuba Shrira , Nissim Francez , Michael Rodeh Distributed k-Selection: From a Sequential to a Distributed Algorithm. [Citation Graph (0, 0)][DBLP ] PODC, 1983, pp:143-153 [Conf ] David Bernstein , Jeffrey M. Jaffe , Michael Rodeh Scheduling Arithmetic and Load Operations in Parallel with No Spilling. [Citation Graph (0, 0)][DBLP ] POPL, 1987, pp:263-273 [Conf ] David Bernstein , Ron Y. Pinter , Michael Rodeh Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses. [Citation Graph (0, 0)][DBLP ] POPL, 1985, pp:325-333 [Conf ] Shmuel Sagiv , O. Edelstein , Nissim Francez , Michael Rodeh Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis. [Citation Graph (0, 0)][DBLP ] POPL, 1989, pp:36-48 [Conf ] Nurit Dor , Michael Rodeh , Shmuel Sagiv Checking Cleanness in Linked Lists. [Citation Graph (0, 0)][DBLP ] SAS, 2000, pp:115-134 [Conf ] Nurit Dor , Michael Rodeh , Shmuel Sagiv Cleanness Checking of String Manipulations in C Programs via Integer Analysis. [Citation Graph (0, 0)][DBLP ] SAS, 2001, pp:194-212 [Conf ] Amihood Amir , Dmitry Keselman , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein , Michael Rodeh Indexing and Dictionary Matching with One Error. [Citation Graph (0, 0)][DBLP ] WADS, 1999, pp:181-192 [Conf ] Nadav Eiron , Michael Rodeh , Iris Steinwarts Matrix Multiplication: A Case Study of Algorithm Engineering. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 1998, pp:98-109 [Conf ] Alon Itai , Michael Rodeh Representation of Graphs. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1982, v:17, n:, pp:215-219 [Journal ] Shmuel Sagiv , Nissim Francez , Michael Rodeh , Reinhard Wilhelm A Logic-Based Approach to Program Flow Analysis. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1998, v:35, n:6, pp:457-504 [Journal ] Shimon Even , Michael Rodeh Economical Encoding of Commas Between Strings. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1978, v:21, n:4, pp:315-317 [Journal ] Alon Itai , Michael Rodeh The Multi-Tree Approach to Reliability in Distributed Networks [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1988, v:79, n:1, pp:43-59 [Journal ] Alon Itai , Michael Rodeh Symmetry breaking in distributed networks [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:88, n:1, pp:60-87 [Journal ] Shmuel Katz , Lawrence J. Risman , Michael Rodeh A System for Constructing Linear Programming Models. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 1980, v:19, n:4, pp:505-520 [Journal ] Yefim Dinitz , Alon Itai , Michael Rodeh On an Algorithm of Zemlyachenko for Subtree Isomorphism. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:70, n:3, pp:141-146 [Journal ] David Steinberg , Michael Rodeh A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:2, pp:83-88 [Journal ] Alon Itai , Michael Rodeh , Steven L. Tanimoto Some Matching Problems for Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] J. ACM, 1978, v:25, n:4, pp:517-525 [Journal ] Michael Rodeh , Vaughan R. Pratt , Shimon Even Linear Algorithm for Data Compression via String Matching. [Citation Graph (0, 0)][DBLP ] J. ACM, 1981, v:28, n:1, pp:16-24 [Journal ] Michael Rodeh , Shmuel Sagiv Finding Circular Attributes in Attribute Grammars. [Citation Graph (0, 0)][DBLP ] J. ACM, 1999, v:46, n:4, pp:556- [Journal ] Amihood Amir , Dmitry Keselman , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein , Michael Rodeh Text Indexing and Dictionary Matching with One Error. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:37, n:2, pp:309-325 [Journal ] David Bernstein , Michael Rodeh , Izidor Gertner Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1989, v:10, n:1, pp:120-139 [Journal ] Danny Dolev , Maria M. Klawe , Michael Rodeh An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1982, v:3, n:3, pp:245-260 [Journal ] Alon Itai , Michael Rodeh Scheduling Transmissions in a Network. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:409-429 [Journal ] Michael Rodeh Finding the Median Distributively. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1982, v:24, n:2, pp:162-166 [Journal ] Nadav Eiron , Michael Rodeh , Iris Steinwarts Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:3- [Journal ] David Bernstein , Jeffrey M. Jaffe , Michael Rodeh Scheduling Arithmetic and Load Operations in Parallel with No Spilling. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:6, pp:1098-1127 [Journal ] Alon Itai , Richard J. Lipton , Christos H. Papadimitriou , Michael Rodeh Covering Graphs by Simple Circuits. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:4, pp:746-750 [Journal ] Alon Itai , Michael Rodeh Finding a Minimum Circuit in a Graph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1978, v:7, n:4, pp:413-423 [Journal ] David Bernstein , Michael Rodeh , Izidor Gertner On the Complexity of Scheduling Problems for Parallel/Pipelined Machines. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1989, v:38, n:9, pp:1308-1313 [Journal ] David Steinberg , Michael Rodeh A Layout for the Shuffle-Exchange Network with O(N2 / log3/2 N ) Area. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1981, v:30, n:12, pp:977-982 [Journal ] Alon Itai , Michael Rodeh , Hadas Shachnai The passport control problem or how to keep a dynamic service system load balanced? [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:282, n:2, pp:303-318 [Journal ] Michael Rodeh A fast test for unique decipherability based on suffix trees. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1982, v:28, n:4, pp:648-0 [Journal ] FLAME - An Efficient Access Method for Optical Disks. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.306secs