Sartaj Sahni - Concepedia

Author

Sartaj Sahni

Also Known As

ICISTM 2011 Gurgaon, Routray, Susmi, S Sahni, S. SAHNI, S. Sahni, S.K. Sahni, SARTAJ SAHNI, Sahni, Shivansh, Sanjay Ranka, Sartaj K. Sahni

530

Publications

18.3K

Citations

H-Index

219

Concepts

All Affiliations

University of Florida University of Minnesota

About

Sartaj Sahni is an author at University of Florida specializing in engineering, computer science, and computer engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	48	179	12.4K
2	Education	10	10	429
3	Business	8	8	947
4	Health Sciences	6	6	304
5	Arts	1	1	48

Sartaj Sahni

211

Publications

13.9K

Citations

H-Index

Page 1

	Year	Citations
P-Complete Approximation Problems Sartaj Sahni, Teofilo F. Gonzalez Journal of the ACM Mathematical ProgrammingPade ApproximantEngineeringComputational ComplexityP-complete Approximation Problems	1976	1.7K
Open Shop Scheduling to Minimize Finish Time Teofilo F. Gonzalez, Sartaj Sahni Journal of the ACM Mathematical ProgrammingEngineeringIndustrial EngineeringOpen Shop SchedulingOperations Research	1976	662
Algorithms for Scheduling Independent Tasks Sartaj Sahni Journal of the ACM Mathematical ProgrammingEngineeringComputational ComplexityOperations ResearchFinish Time	1976	590
Computing Partitions with Applications to the Knapsack Problem Ellis Horowitz, Sartaj Sahni Journal of the ACM Mathematical ProgrammingSearch OptimizationBranch-and-bound AlgorithmEngineeringComputational Complexity	1974	558
Exact and Approximate Algorithms for Scheduling Nonidentical Processors Ellis Horowitz, Sartaj Sahni Journal of the ACM Mathematical ProgrammingEngineeringComputer ArchitectureComputational ComplexityApproximate Algorithms	1976	473
Flowshop and Jobshop Schedules: Complexity and Approximation Teofilo F. Gonzalez, Sartaj Sahni Operations Research Job SchedulerFlow ShopsEngineeringScheduling AnalysisIndustrial Engineering	1978	426
Computationally Related Problems Sartaj Sahni SIAM Journal on Computing Mathematical ProgrammingNetwork FlowsEngineeringDeterministic Polynomial TimeComputational Complexity Theory	1974	356
Parallel Matrix and Graph Algorithms Eliezer Dekel, David Nassimi, Sartaj Sahni SIAM Journal on Computing EngineeringMatrix Multiplication AlgorithmsComputer ArchitectureAnalysis Of AlgorithmComputational Complexity	1981	353
Approximate Algorithms for the 0/1 Knapsack Problem Sartaj Sahni Journal of the ACM	1975	348
Bounds for LPT Schedules on Uniform Processors Teofilo F. Gonzalez, Óscar H. Ibarra, Sartaj Sahni SIAM Journal on Computing Mathematical ProgrammingEngineeringNonpreemptive Multiprocessor EnvironmentLargest Processing TimeComputer Architecture	1977	286

Page 1