Nassimi, David; Sahni, Sartaj Parallel permutation and sorting algorithms and a new generalized connection network. (English) Zbl 0488.68045 J. Assoc. Comput. Mach. 29, 642-667 (1982). MSC: 68P10 68N25 68N99 94C99 PDFBibTeX XMLCite \textit{D. Nassimi} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 29, 642--667 (1982; Zbl 0488.68045) Full Text: DOI
Sahni, Sartaj; Cho, Yookun Scheduling independent tasks with due times on a uniform processor system. (English) Zbl 0475.68013 J. Assoc. Comput. Mach. 27, 550-563 (1980). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{S. Sahni} and \textit{Y. Cho}, J. Assoc. Comput. Mach. 27, 550--563 (1980; Zbl 0475.68013) Full Text: DOI
Nassimi, David; Sahni, Sartaj An optimal routing algorithm for Mesh-connected parallel computers. (English) Zbl 0422.68009 J. Assoc. Comput. Mach. 27, 6-29 (1980). MSC: 68Q25 68N25 68P10 68N99 PDFBibTeX XMLCite \textit{D. Nassimi} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 27, 6--29 (1980; Zbl 0422.68009) Full Text: DOI
Gonzalez, Teofilo; Sahni, Sartaj Preemptive scheduling of uniform processor systems. (English) Zbl 0364.68046 J. Assoc. Comput. Mach. 25, 92-101 (1978). MSC: 68M20 PDFBibTeX XMLCite \textit{T. Gonzalez} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 25, 92--101 (1978; Zbl 0364.68046) Full Text: DOI
Sahni, Sartaj; Gonzalez, Teofilo P-complete approximation problems. (English) Zbl 0348.90152 J. Assoc. Comput. Mach. 23, 555-565 (1976). MSC: 90C35 68Q25 68Q45 68N01 90C10 90B10 90C30 PDFBibTeX XMLCite \textit{S. Sahni} and \textit{T. Gonzalez}, J. Assoc. Comput. Mach. 23, 555--565 (1976; Zbl 0348.90152) Full Text: DOI
Gonzalez, Teofilo; Sahni, Sartaj Open shop scheduling to minimize finish time. (English) Zbl 0343.68031 J. Assoc. Comput. Mach. 23, 665-679 (1976). MSC: 68Q45 68W99 68Q25 PDFBibTeX XMLCite \textit{T. Gonzalez} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 23, 665--679 (1976; Zbl 0343.68031) Full Text: DOI
Horowitz, Ellis; Sahni, Sartaj Exact and approximate algorithms for scheduling nonidentical processors. (English) Zbl 0329.68041 J. Assoc. Comput. Mach. 23, 317-327 (1976). MSC: 68W99 68Q45 68N01 68Q25 PDFBibTeX XMLCite \textit{E. Horowitz} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 23, 317--327 (1976; Zbl 0329.68041) Full Text: DOI
Sahni, Sartaj K. Algorithms for scheduling independent tasks. (English) Zbl 0326.68024 J. Assoc. Comput. Mach. 23, 116-127 (1976). MSC: 68W99 68Q45 68Q25 90B35 PDFBibTeX XMLCite \textit{S. K. Sahni}, J. Assoc. Comput. Mach. 23, 116--127 (1976; Zbl 0326.68024) Full Text: DOI
Sahni, Sartaj Approximate algorithms for the 0/1 knapsack problem. (English) Zbl 0362.90066 J. Assoc. Comput. Mach. 22, 115-124 (1975). MSC: 90C10 68W99 65K05 PDFBibTeX XMLCite \textit{S. Sahni}, J. Assoc. Comput. Mach. 22, 115--124 (1975; Zbl 0362.90066) Full Text: DOI
Horowitz, E.; Sahni, S. On computing the exact determinant of matrices with polynomial entries. (English) Zbl 0293.65026 J. Assoc. Comput. Mach. 22, 38-50 (1975). MSC: 65F99 68W99 15-04 PDFBibTeX XMLCite \textit{E. Horowitz} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 22, 38--50 (1975; Zbl 0293.65026) Full Text: DOI
Horowitz, Ellis; Sahni, Sartaj Computing partitions with applications to the knapsack problem. (English) Zbl 0329.90046 J. Assoc. Comput. Mach. 21, 277-292 (1974). MSC: 90C10 PDFBibTeX XMLCite \textit{E. Horowitz} and \textit{S. Sahni}, J. Assoc. Comput. Mach. 21, 277--292 (1974; Zbl 0329.90046) Full Text: DOI Link