Help


from Wikipedia
« »  
With his advisor Ellis Horowitz, Sahni wrote two widely-used textbooks, Fundamentals of Algorithms and Fundamentals of Data Structures.
He has also written highly-cited research papers on the NP-completeness of approximately solving certain optimization problems, on open shop scheduling, on parallel algorithms for matrix multiplication and their application in graph theory, and on improved exponential time exact algorithms for the subset sum problem, among his many other research results.

2.170 seconds.