2026 Sartaj Sahni: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	73	1559	1512	812	782	456	27338

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

2441
Citations
Fundamentals of Computer Algorithms

Ellis Horowitz;Sartaj Sahni

2322
Citations
Fundamentals of data structures

Ellis Horowitz;Sartaj Sahni

1351
Citations
Open Shop Scheduling to Minimize Finish Time

Teofilo Gonzalez;Sartaj Sahni

971
Citations
Computing Partitions with Applications to the Knapsack Problem

Ellis Horowitz;Sartaj Sahni

795
Citations
Algorithms for Scheduling Independent Tasks

Sartaj K. Sahni

755
Citations
Flowshop and Jobshop Schedules: Complexity and Approximation

Teofilo Gonzalez;Sartaj Sahni

648
Citations
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Ellis Horowitz;Sartaj Sahni

638
Citations
Fundamentals of Data Structures in C

Ellis Horowitz;Sartaj Sahni;Susan Anderson-Freed

605
Citations
Computationally Related Problems

Sartaj Sahni

534
Citations
Approximate Algorithms for the 0/1 Knapsack Problem

Sartaj Sahni

524
Citations
Parallel Matrix and Graph Algorithms

Eliezer Dekel;David Nassimi;Sartaj Sahni

519
Citations
Computer Algorithms C

Ellis Horowitz;Sartaj Sahni;Sanguthevar Rajasekaran

459
Citations
Data Structures, Algorithms and Applications in Java

Sartaj Sahni

435
Citations
Anomalies in parallel branch-and-bound algorithms

Ten-Hwang Lai;Sartaj Sahni

421
Citations
Data broadcasting in SIMD computers

D. Nassimi;S. Sahni

397
Citations
Polynomially Complete Fault Detection Problems

O.H. Ibarra;S.K. Sahni

379
Citations
Handbook of Data Structures and Applications

Dinesh P. Mehta;Sartaj Sahni

355
Citations
Preemptive Scheduling of Uniform Processor Systems

Teofilo Gonzalez;Sartaj Sahni

317
Citations
Fundamentals of Data Structures in Pascal

Ellis Horowitz;Sartaj Sahni

288
Citations
Parallel permutation and sorting algorithms and a new generalized connection network

David Nassimi;Sartaj Sahni

288
Citations

Frequent Co-Authors

Sanjay Ranka University of Florida

Sanguthevar Rajasekaran University of Connecticut

Nageswara S. V. Rao Oak Ridge National Laboratory

Andrew Lim National University of Singapore

Sudhakar M. Reddy University of Iowa

Oscar H. Ibarra University of California, Santa Barbara

Albert Y. Zomaya University of Sydney

Baba C. Vemuri University of Florida

Pramod P. Khargonekar University of California, Irvine

Viktor K. Prasanna University of Southern California

External Links

Wikipedia of Sartaj Sahni Personal website of Sartaj Sahni Google Scholar page

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

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.