World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
73
Citations
27338
World Ranking
1559
National Ranking
812

Sartaj Sahni publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Sartaj Sahni sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 250 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 560 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 424 scientists 242–251 publications: 408 scientists 252–261 publications: 378 scientists 262–271 publications: 300 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 456 publications — 91st percentile

91% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Sartaj Sahni D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Sartaj Sahni sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 984 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 969 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 765 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 517 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 73 D-Index — 89th percentile

89% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 2003 - ACM Karl V. Karlstrom Outstanding Educator Award For outstanding contributions to computing education through inspired teaching, development of courses and curricula for distance education, and authoring significant textbooks in several areas including discrete mathematics, data structures, algorithms, and parallel and distributed computing.
  • 1996 - ACM Fellow For contributions to data structures, design and analysis of algorithms, multiprocessor scheduling, electronic computer aided design, and parallel computing.
  • 1995 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 1988 - IEEE Fellow For contributions to computer algorithms, computer-aided design, and large-scale systems.

Overview

Sartaj Sahni is affiliated with the University of Florida in the United States and has a significant body of work in computer science, particularly in areas related to algorithms and networks.

Their recent papers include:

  • NSF/IEEE-TCPP Curriculum Initiative on Parallel and Distributed Computing Core Topics for Undergraduates (2024), published in HAL (Le Centre pour la Communication Scientifique Directe)
  • An Effective Data Structure for Contact Sequence Temporal Graphs (2021), published in the 2021 IEEE Symposium on Computers and Communications (ISCC)
  • Algorithms for optimal min hop and foremost paths in interval temporal graphs (2022), published in Applied Network Science
  • Cache efficient Value Iteration using clustering and annealing (2020), published in Computer Communications
  • Multiobjective Optimization of SAR Reconstruction on Hybrid Multicore Systems (2020), published in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing

Their work covers several main fields and subfields of study, including:

  • Computer Science
  • Computer Networks and Communications
  • Artificial Intelligence
  • Molecular Biology
  • Signal Processing
  • Computer Vision and Pattern Recognition

Main topics of research encompass:

  • Data Management and Algorithms
  • Opportunistic and Delay-Tolerant Networks
  • Caching and Content Delivery
  • Graph Theory and Algorithms
  • Optimization and Search Problems
  • Algorithms and Data Compression
  • Data Quality and Management

Frequent co-authors of Sartaj Sahni include:

  • Anuj Jain
  • Tania Banerjee
  • Sanjay Ranka
  • Sanaz Gheibi
  • Joyanta Basak

The publication venues where Sartaj Sahni has most frequently contributed are:

  • Algorithms
  • 2021 IEEE Symposium on Computers and Communications (ISCC)
  • Applied Network Science
  • Computer Communications
  • IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing

Sartaj Sahni has received several awards and recognitions, including:

  • ACM Karl V. Karlstrom Outstanding Educator Award (2003) for contributions to computing education, curriculum development, and authoring textbooks in various areas of computer science
  • ACM Fellow (1996) for contributions to data structures, algorithms, multiprocessor scheduling, electronic computer-aided design, and parallel computing
  • Fellow of the American Association for the Advancement of Science (AAAS) (1995)
  • IEEE Fellow (1988) for work in computer algorithms, computer-aided design, and large-scale systems

Best Publications

  • P-Complete Approximation Problems

    Sartaj Sahni;Teofilo Gonzalez

  • Fundamentals of Computer Algorithms

    Ellis Horowitz;Sartaj Sahni

  • Fundamentals of data structures

    Ellis Horowitz;Sartaj Sahni

  • Open Shop Scheduling to Minimize Finish Time

    Teofilo Gonzalez;Sartaj Sahni

  • Computing Partitions with Applications to the Knapsack Problem

    Ellis Horowitz;Sartaj Sahni

  • Algorithms for Scheduling Independent Tasks

    Sartaj K. Sahni

  • Flowshop and Jobshop Schedules: Complexity and Approximation

    Teofilo Gonzalez;Sartaj Sahni

  • Exact and Approximate Algorithms for Scheduling Nonidentical Processors

    Ellis Horowitz;Sartaj Sahni

  • Fundamentals of Data Structures in C

    Ellis Horowitz;Sartaj Sahni;Susan Anderson-Freed

  • Computationally Related Problems

    Sartaj Sahni

  • Approximate Algorithms for the 0/1 Knapsack Problem

    Sartaj Sahni

  • Parallel Matrix and Graph Algorithms

    Eliezer Dekel;David Nassimi;Sartaj Sahni

  • Computer Algorithms C

    Ellis Horowitz;Sartaj Sahni;Sanguthevar Rajasekaran

  • Data Structures, Algorithms and Applications in Java

    Sartaj Sahni

  • Anomalies in parallel branch-and-bound algorithms

    Ten-Hwang Lai;Sartaj Sahni

  • Data broadcasting in SIMD computers

    D. Nassimi;S. Sahni

  • Polynomially Complete Fault Detection Problems

    O.H. Ibarra;S.K. Sahni

  • Handbook of Data Structures and Applications

    Dinesh P. Mehta;Sartaj Sahni

  • Preemptive Scheduling of Uniform Processor Systems

    Teofilo Gonzalez;Sartaj Sahni

  • Fundamentals of Data Structures in Pascal

    Ellis Horowitz;Sartaj Sahni

  • Parallel permutation and sorting algorithms and a new generalized connection network

    David Nassimi;Sartaj Sahni

Frequent Co-Authors

Sanjay Ranka
Sanjay Ranka University of Florida
Sanguthevar Rajasekaran
Sanguthevar Rajasekaran University of Connecticut
Nageswara S. V. Rao
Nageswara S. V. Rao Oak Ridge National Laboratory
Andrew Lim
Andrew Lim National University of Singapore
Sudhakar M. Reddy
Sudhakar M. Reddy University of Iowa
Oscar H. Ibarra
Oscar H. Ibarra University of California, Santa Barbara
Albert Y. Zomaya
Albert Y. Zomaya University of Sydney
Baba C. Vemuri
Baba C. Vemuri University of Florida
Pramod P. Khargonekar
Pramod P. Khargonekar University of California, Irvine
Viktor K. Prasanna
Viktor K. Prasanna University of Southern California

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 online education opens up a wide variety of opportunities in computer science and related fields. For those looking for the easiest associate degree to get online, options are available that allow for quick entry into tech careers, often with flexible schedules ideal for working students.

Students with an interest in leadership or education technology may also consider pursuing an ed d in education. This advanced degree focuses on developing skills for educational innovation, curriculum design, and higher administration—key areas even within computer science education.

Choosing the best online degree programs is critical for career advancement. Accreditation, faculty expertise, and hands-on learning experiences are major factors to consider when selecting a school.

For those passionate about creativity and interactive technology, online game design programs provide targeted skills in developing, designing, and producing games—a rapidly growing sector within computer science.

Best Scientists Citing Sartaj Sahni

Trending Scientists

Recently Published Articles