Sartaj K. Sahni
- Ellis Horowitz and Sartaj Sahni. Computing partitions with
applications to the knapsack problem. Journal of the
ACM, 21(2):277-292, April 1974.
References,
Citations,
etc.
- E. Horowitz and S. Sahni. On computing the exact determinant
of matrices with polynomial entries. Journal of the
ACM, 22(1):38-50, January 1975.
References,
etc.
- Sartaj Sahni. Approximate
algorithms for the 0/1 knapsack problem. Journal of the
ACM, 22(1):115-124, January 1975.
References,
Citations,
etc.
- Sartaj K. Sahni. Algorithms
for scheduling independent tasks. Journal of the ACM,
23(1):116-127, January 1976.
Citations.
- Ellis Horowitz and Sartaj Sahni. Exact and approximate algorithms
for scheduling nonidentical processors. Journal of the
ACM, 23(2):317-327, April 1976.
- Sartaj Sahni and Teofilo Gonzalez. P-complete approximation
problems. Journal of the ACM, 23(3):555-565, July 1976.
Citations.
- Teofilo Gonzalez and Sartaj Sahni. Open shop scheduling to minimize
finish time. Journal of the ACM, 23(4):665-679, October
1976.
- Teofilo Gonzalez and Sartaj Sahni. Preemptive scheduling of uniform
processor systems. Journal of the ACM, 25(1):92-101,
January 1978.
Citations.
- David Nassimi and Sartaj Sahni. An optimal routing algorithm for
mesh-connected parallel computers. Journal of the ACM,
27(1):6-29, January 1980.
Citations.
- Sartaj Sahni and Yookun Cho. Scheduling independent tasks with
due times on a uniform processor system. Journal of the
ACM, 27(3):550-563, July 1980.
- David Nassimi and Sartaj Sahni. Parallel permutation and sorting
algorithms and a new generalized connection network. Journal
of the ACM, 29(3):642-667, July 1982.
Citations.
Shortcuts: