Sartaj Sahni (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sartaj Sahni" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
451st place
277th place
11th place
8th place
921st place
644th place
1st place
1st place
5,196th place
3,635th place
1,185th place
840th place
6,454th place
4,437th place
4,501st place
3,002nd place
low place
low place
43rd place
161st place
low place
low place
207th place
136th place
102nd place
76th place
low place
low place
652nd place
515th place
9,065th place
7,557th place

aaas.org

acm.org

awards.acm.org

fellows.acm.org

ams.org

mathscinet.ams.org

  • Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems" (PDF), Journal of the Association for Computing Machinery, 23 (3): 555–565, doi:10.1145/321958.321975, MR 0408313, S2CID 207548581.
  • Gonzalez, Teofilo; Sahni, Sartaj (1976), "Open shop scheduling to minimize finish time", Journal of the Association for Computing Machinery, 23 (4): 665–679, CiteSeerX 10.1.1.394.1507, doi:10.1145/321978.321985, MR 0429089, S2CID 1642775.
  • Dekel, Eliezer; Nassimi, David; Sahni, Sartaj (1981), "Parallel matrix and graph algorithms", SIAM Journal on Computing, 10 (4): 657–675, doi:10.1137/0210049, MR 0635424.
  • Horowitz, Ellis; Sahni, Sartaj (1969), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858.

computer.org

computer.org

awards.computer.org

dblp.org

dml.cz

  • Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems" (PDF), Journal of the Association for Computing Machinery, 23 (3): 555–565, doi:10.1145/321958.321975, MR 0408313, S2CID 207548581.

doi.org

  • Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems" (PDF), Journal of the Association for Computing Machinery, 23 (3): 555–565, doi:10.1145/321958.321975, MR 0408313, S2CID 207548581.
  • Gonzalez, Teofilo; Sahni, Sartaj (1976), "Open shop scheduling to minimize finish time", Journal of the Association for Computing Machinery, 23 (4): 665–679, CiteSeerX 10.1.1.394.1507, doi:10.1145/321978.321985, MR 0429089, S2CID 1642775.
  • Dekel, Eliezer; Nassimi, David; Sahni, Sartaj (1981), "Parallel matrix and graph algorithms", SIAM Journal on Computing, 10 (4): 657–675, doi:10.1137/0210049, MR 0635424.
  • Horowitz, Ellis; Sahni, Sartaj (1969), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858.

eurasc.org

handle.net

hdl.handle.net

ieee.org

iitk.ac.in

mathgenealogy.org

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

  • Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems" (PDF), Journal of the Association for Computing Machinery, 23 (3): 555–565, doi:10.1145/321958.321975, MR 0408313, S2CID 207548581.
  • Gonzalez, Teofilo; Sahni, Sartaj (1976), "Open shop scheduling to minimize finish time", Journal of the Association for Computing Machinery, 23 (4): 665–679, CiteSeerX 10.1.1.394.1507, doi:10.1145/321978.321985, MR 0429089, S2CID 1642775.
  • Horowitz, Ellis; Sahni, Sartaj (1969), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858.

ufl.edu

cise.ufl.edu

web.archive.org

wikidata.org