World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
4868
World Ranking
13969
National Ranking
5552

Overview

Michael Rodeh is affiliated with IBM in the United States, contributing to the scientific and technical landscape within this institution. Their professional activity is based in the United States.

While specific recent papers, co-authors, publication venues, book publications, main fields of study, subfields, main research topics, and awards are not detailed in the available data, the profile reflects a researcher actively involved in academic or professional research affiliated with a major technology company.

IBM's research environment often includes a wide array of technology and engineering disciplines, implying Rodeh's engagement with advanced computing, information technology, or related fields. However, due to the absence of detailed publication or topic data, further specification of their research focus is not possible here.

Given the lack of publicly listed recent publications or notable awards, it is difficult to outline the specifics of Michael Rodeh's research contributions or collaborations. This suggests either a limited public record of scholarly output or a focus on internal or proprietary research projects within IBM.

There is no indication that Michael Rodeh is deceased, so all references remain in present tense.

Best Publications

  • Finding a Minimum Circuit in a Graph

    Alon Itai;Michael Rodeh

  • The multi-tree approach to reliability in distributed networks

    Alon Itai;Michael Rodeh

  • CSSV: towards a realistic tool for statically detecting all buffer overflows in C

    Nurit Dor;Michael Rodeh;Mooly Sagiv

  • An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

    Danny Dolev;Maria M. Klawe;Michael Rodeh

  • Linear Algorithm for Data Compression via String Matching

    Michael Rodeh;Vaughan R. Pratt;Shimon Even

  • Global instruction scheduling for superscalar machines

    David Bernstein;Michael Rodeh

  • Symmetry breaking in distributed networks

    Alon Itai;Michael Rodeh

  • Symmetry breaking in distributive networks

    Alon Itai;Michael Rodeh

  • A Sparse Table Implementation of Priority Queues

    Alon Itai;Alan G. Konheim;Michael Rodeh

  • Some Matching Problems for Bipartite Graphs

    Steven L. Tanimoto;Alon Itai;Michael Rodeh

  • Achieving Distributed Termination without Freezing

    N. Francez;M. Rodeh

  • On the complexity of scheduling problems for parallel/pipelined machines

    D. Bernstein;M. Rodeh;I. Gertner

  • Cleanness Checking of String Manipulations in C Programs via Integer Analysis

    Nurit Dor;Michael Rodeh;Shmuel Sagiv

  • CSSV

    Unknown

  • Economical encoding of commas between strings

    S. Even;M. Rodeh

  • Covering a Graph by Circuits

    Alon Itai;Michael Rodeh

  • Text Indexing and Dictionary Matching with One Error

    Amihood Amir;Dmitry Keselman;Gad M. Landau;Moshe Lewenstein

  • The Multi-Tree Approach To Reliability In Distributed Networks

    A. Itai;M. Rodeh

  • Finding a minimum circuit in a graph

    Alon Itai;Michael Rodeh

  • Checking Cleanness in Linked Lists

    Nurit Dor;Michael Rodeh;Shmuel Sagiv

  • Unidirectional Distributed Algorithm for Extrema Finding in a Circle

    Danny Dolev;Maria Klawe;Michael Rodeh

Frequent Co-Authors

Alon Itai
Alon Itai Technion – Israel Institute of Technology
Nissim Francez
Nissim Francez Technion – Israel Institute of Technology
Mooly Sagiv
Mooly Sagiv Tel Aviv University
Danny Dolev
Danny Dolev Hebrew University of Jerusalem
Amihood Amir
Amihood Amir Bar-Ilan University
Gad M. Landau
Gad M. Landau University of Haifa
Reinhard Wilhelm
Reinhard Wilhelm Saarland University
Zvi Galil
Zvi Galil Georgia Institute of Technology
Maria Klawe
Maria Klawe Harvey Mudd College
Shimon Even
Shimon Even Technion – Israel Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As Computer Science continues to evolve, so do the pathways to earn a relevant degree online. Students can start with 2 year online degrees to build foundational skills and enter the tech job market quickly. For those looking to specialize, pursuing one of the most useful graduate degrees can open doors to advanced roles in fields like data science, cybersecurity, and AI.

Finding the right program is essential, especially for students with budget constraints. Thankfully, there are many affordable online courses that don’t compromise on quality. Additionally, if your academic record isn’t perfect, you still have options—many reputable schools are among the college with low gpa institutions, making higher education more accessible.

Whether you’re aiming for a quick start, a specialized master’s degree, or seeking flexible and affordable education, there’s an online path in Computer Science to fit your needs and career goals.

Best Scientists Citing Michael Rodeh