World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
10427
World Ranking
9992
National Ranking
4209

Overview

Salim El Rouayheb is affiliated with Rutgers, The State University of New Jersey in the United States. Their research primarily spans the field of Computer Science, with notable subfields including Artificial Intelligence, Computer Networks and Communications, Sociology and Political Science, Molecular Biology, and Computational Theory and Mathematics.

The scientist's work covers several main topics, such as Privacy-Preserving Technologies in Data, Stochastic Gradient Optimization Techniques, Cryptography and Data Security, Privacy, Security, and Data Protection, Complexity and Algorithms in Graphs, Wireless Communication Security Techniques, and DNA and Biological Computing.

Recent publications by Salim El Rouayheb include:

  • Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes (2020) in IEEE Transactions on Communications
  • Walk for Learning: A Random Walk Approach for Federated Learning From Heterogeneous Data (2023) in IEEE Journal on Selected Areas in Communications
  • Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication (2021) in arXiv (Cornell University)
  • Private and rateless adaptive coded matrix-vector multiplication (2021) in EURASIP Journal on Wireless Communications and Networking
  • Intermittent Private Information Retrieval With Application to Location Privacy (2022) in IEEE Journal on Selected Areas in Communications

The frequent co-authors collaborating with Salim El Rouayheb include Fangwei Ye, Rafael G. L. D'Oliveira, Rawad Bitar, Daniel Heinlein, and Parimal Parag.

Publication venues where Salim El Rouayheb has frequently contributed comprise arXiv (Cornell University), IEEE Transactions on Information Theory, IEEE Transactions on Communications, IEEE Journal on Selected Areas in Communications, and IEEE Journal on Selected Areas in Information Theory.

Best Publications

  • Advances and Open Problems in Federated Learning

    Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet

  • Advances and open problems in federated learning

    Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet

  • On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory

    Salim El Rouayheb;Alex Sprintson;Costas Georghiades

  • Private Information Retrieval From MDS Coded Data in Distributed Storage Systems

    Razane Tajeddine;Oliver W. Gnilke;Salim El Rouayheb

  • Fractional repetition codes for repair in distributed storage systems

    Salim El Rouayheb;Kannan Ramchandran

  • Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks

    S. Pawar;S. El Rouayheb;K. Ramchandran

  • On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks

    S.Y. El Rouayheb;M.A.R. Chaudhry;A. Sprintson

  • On coding for cooperative data exchange

    Salim El Rouayheb;Alex Sprintson;Parastoo Sadeghi

  • On Wiretap Networks II

    S.Y. El Rouayheb;E. Soljanin

  • Secure Network Coding for Wiretap Networks of Type II

    S. El Rouayheb;E. Soljanin;A. Sprintson

  • An Equivalence Between Network Coding and Index Coding

    Michelle Effros;Salim El Rouayheb;Michael Langberg

  • GASP Codes for Secure Distributed Matrix Multiplication

    Rafael G. L. D'Oliveira;Salim El Rouayheb;David Karpuk

  • Private Information Retrieval With Side Information

    Swanand Kadhe;Brenden Garcia;Anoosheh Heidarzadeh;Salim El Rouayheb

  • On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks

    Salim Y. El Rouayheb;Mohammad Asad R. Chaudhry;Alex Sprintson

  • Private information retrieval schemes for codec data with arbitrary collusion patterns

    Razane Tajeddine;Oliver W. Gnilke;David Karpuk;Ragnar Freij-Hollanti

  • A randomized algorithm and performance bounds for coded cooperative data exchange

    Alex Sprintson;Parastoo Sadeghi;Graham Booker;Salim El Rouayheb

  • DRESS codes for the storage cloud: Simple randomized constructions

    Sameer Pawar;Nima Noorshams;Salim El Rouayheb;Kannan Ramchandran

  • Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning

    Rawad Bitar;Mary Wootters;Salim El Rouayheb

  • Private information retrieval from MDS coded data in distributed storage systems

    Razan Tajeddine;Salim El Rouayheb

  • Minimizing latency for secure distributed computing

    Rawad Bitar;Parimal Parag;Salim El Rouayheb

  • An equivalence between network coding and index coding

    M. Effros;S. El Rouayheb;M. Langberg

  • Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns

    Razane Tajeddine;Oliver W. Gnilke;David Karpuk;Ragnar Freij-Hollanti

Frequent Co-Authors

Alex Sprintson
Alex Sprintson Texas A&M University
Kannan Ramchandran
Kannan Ramchandran University of California, Berkeley
Costas N. Georghiades
Costas N. Georghiades Texas A&M University
Michael Gastpar
Michael Gastpar École Polytechnique Fédérale de Lausanne
H. Vincent Poor
H. Vincent Poor Princeton University
Emina Soljanin
Emina Soljanin Rutgers, The State University of New Jersey
Olgica Milenkovic
Olgica Milenkovic University of Illinois at Urbana-Champaign
Farinaz Koushanfar
Farinaz Koushanfar University of California, San Diego
Dawn Song
Dawn Song University of California, Berkeley

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

Exploring computer science online opens numerous opportunities, no matter your background or experience. Many learners are drawn to affordable online degree programs that offer flexibility and save on tuition costs, making higher education more accessible to a wider audience.

Even if your academic record isn’t perfect, options exist—some online graduate schools with low gpa requirements make it easier to advance your qualifications without stringent admission criteria. For those aiming to enter the workforce quickly, a online computer science degree can be completed in a shorter timeframe, providing the skills needed to pursue in-demand tech roles.

Computer science expertise is highly versatile. Graduates can pursue careers in software development, cybersecurity, data analysis, and more. Plus, the skills gained often lead to roles beyond tech—similar to the varied options highlighted in what jobs can you get with an environmental science degree. Online degrees ensure students are well-prepared for today’s dynamic career landscape.

Best Scientists Citing Salim El Rouayheb

Trending Scientists

Recently Published Articles