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