World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
65
Citations
18205
World Ranking
2444
National Ranking
1224

Research.com Recognitions

  • 2013 - ACM Fellow For contributions to algorithms for graph partitioning and for single- and multi-commodity flows.

Overview

Satish Rao is affiliated with the University of California, Berkeley in the United States. Their research spans various topics within the broad field of medicine, with a particular emphasis on endocrinology, diabetes, and metabolism, as well as topics in molecular biology and pathology.

Their recent publications cover a range of subjects and appear in several academic journals, including:

  • Metabolic non-communicable disease health report of India: the ICMR-INDIAB national cross-sectional study (2023, The Lancet Diabetes & Endocrinology)
  • Local Flow Partitioning for Faster Edge Connectivity (2020, SIAM Journal on Computing)
  • Mechanical Properties of Post-Cured Eggshell-Filled Glass-Fibre-Reinforced Polymer Composites (2023, Journal of Composites Science)
  • Aberrant cytoplasmic localization of ARID1B activates ERK signaling and promotes oncogenesis (2020, Journal of Cell Science)
  • Conservation genetics of montane willow populations in Scotland-limited natural recovery despite long-distance gene flow and high genetic diversity (2022, Environmental Research Ecology)

The scientist has frequently published in the following venues:

  • International Journal of Advanced Research
  • IET conference proceedings.
  • The Lancet Diabetes & Endocrinology
  • Journal of Composites Science
  • SIAM Journal on Computing

Their primary field of study is medicine, with 34 publications attributed to it. Important subfields include:

  • Endocrinology, Diabetes and Metabolism
  • Periodontics
  • Molecular Biology
  • Pulmonary and Respiratory Medicine
  • Pathology and Forensic Medicine

Research topics often addressed by Satish Rao include:

  • Oral microbiology and periodontitis research
  • Diabetes, Cardiovascular Risks, and Lipoproteins
  • Natural Fiber Reinforced Composites
  • Complexity and Algorithms in Graphs
  • Genetic diversity and population structure
  • Dental Health and Care Utilization
  • Thyroid Disorders and Treatments

Frequent collaborators of the scientist include:

  • Ranjit Mohan Anjana
  • Shashank Joshi
  • Viswanathan Mohan
  • Ranjit Unnikrishnan
  • Mohan Deepa

Satish Rao received the ACM Fellow award in 2013 for contributions to algorithms related to graph partitioning and single- and multi-commodity flows. This recognition highlights their work within computational and algorithmic aspects intersecting with their broader research scope.

Best Publications

  • Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

    Tom Leighton;Satish Rao

  • Expander flows, geometric embeddings and graph partitioning

    Sanjeev Arora;Satish Rao;Umesh Vazirani

  • A tight bound on approximating arbitrary metrics by tree metrics

    Jittat Fakcharoenphol;Satish Rao;Kunal Talwar

  • A Maximum Likelihood Stereo Algorithm

    Ingemar J. Cox;Sunita L. Hingorani;Satish B. Rao;Bruce M. Maggs

  • Beyond the flow decomposition barrier

    Andrew V. Goldberg;Satish Rao

  • An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

    T. Leighton;S. Rao

  • Distributed Object Location in a Dynamic Network

    Kirsten Hildrum;John D. Kubiatowicz;Satish Rao;Ben Y. Zhao

  • BSPlib: The BSP programming library

    Jonathan M. D. Hill;Bill McColl;Dan C. Stefanescu;Dan C. Stefanescu;Mark W. Goudreau

  • Method for caching and delivery of compressed content in a content delivery network

    Michael M. Afergan;Charisma Schlossberg;Duke P. Hong;Satish Balusu Rao

  • Approximation schemes for Euclidean k-medians and related problems

    Sanjeev Arora;Prabhakar Raghavan;Satish Rao

  • Faster Shortest-Path Algorithms for Planar Graphs

    Monika R Henzinger;Philip Klein;Satish Rao;Sairam Subramanian

  • Optimal route selection in a content delivery network

    Claudson F. Bornstein;Timothy K. Canfield;Gary L. Miller;Satish B. Rao

  • ANTIDOTE: understanding and defending against poisoning of anomaly detectors

    Benjamin I.P. Rubinstein;Blaine Nelson;Ling Huang;Anthony D. Joseph

  • Packet routing and job-shop scheduling in O (congestion+dilation) steps

    Frank Thomson Leighton;Bruce M. Maggs;Satish Rao

  • Distributed object location in a dynamic network

    Kirsten Hildrum;John D. Kubiatowicz;Satish Rao;Ben Y. Zhao

  • Expander flows, geometric embeddings and graph partitioning

    Sanjeev Arora;Satish Rao;Umesh Vazirani

  • Planar graphs, negative weight edges, shortest paths, and near linear time

    Jittat Fakcharoenphol;Satish Rao

  • Divide-and-conquer approximation algorithms via spreading metrics

    Guy Even;Joseph Seffi Naor;Satish Rao;Baruch Schieber

  • Excluded minors, network decomposition, and multicommodity flow

    Philip Klein;Serge A. Plotkin;Satish Rao

  • Approximating geometrical graphs via “spanners” and “banyans”

    Satish B. Rao;Warren D. Smith

  • Faster shortest-path algorithms for planar graphs

    Philip Klein;Satish Rao;Monika Rauch;Sairam Subramanian

Frequent Co-Authors

Kamalika Chaudhuri
Kamalika Chaudhuri University of California, San Diego
Bruce M. Maggs
Bruce M. Maggs Duke University
Kunal Talwar
Kunal Talwar Apple (United States)
Monika Henzinger
Monika Henzinger Institute of Science and Technology Austria
Philip N. Klein
Philip N. Klein Brown University
Anthony D. Joseph
Anthony D. Joseph University of California, Berkeley
Michael W. Mahoney
Michael W. Mahoney University of California, Berkeley
J. D. Tygar
J. D. Tygar University of California, Berkeley
Tandy Warnow
Tandy Warnow University of Illinois at Urbana-Champaign

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 a career in Computer Science doesn’t have to follow a traditional, four-year campus route. Many students now start with online associate degree programs that can be completed quickly and offer foundational skills. These can serve as a strong stepping stone to bachelor’s studies or entry-level tech jobs.

If you’re interested in blending technical skills with management, a business degree can expand your opportunities in areas like project management, IT consulting, or digital entrepreneurship.

Cost is a critical factor for many learners. Thankfully, there are cheap online universities that offer quality bachelor’s programs without a hefty price tag. These affordable pathways can make a Computer Science degree far more accessible.

For those focused on engineering fields closely tied to computing, seeking the cheapest engineering degree online can lead to rewarding, versatile careers while minimizing student debt. Choosing among these flexible degree routes can open many doors in the tech industry, both in the U.S. and worldwide.

Best Scientists Citing Satish Rao

Trending Scientists