1. DSpace at Indian Statistical Institute
  2. Dissertation and Thesis
  3. Dissertations - M Tech (CS)
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/6243
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMahata, Chinmay-
dc.date.accessioned2016-07-01T20:08:19Z-
dc.date.available2016-07-01T20:08:19Z-
dc.date.issued2000-
dc.identifier.citation29p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6243-
dc.descriptionDissertation under the supervision of Dr. Srabani Mukhopadhyaya and Dr. Krisnendu Mukhopadhyayaen_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;2000-71-
dc.subjectCachesen_US
dc.subjectAlgorithmsen_US
dc.subjectAll-pairs-shortest-pathsen_US
dc.subjectFloyd's algorithmsen_US
dc.titleCache conscious algorithms for all-pairs shortest-paths problemen_US
dc.typeThesisen_US
Appears in Collections:Dissertations - M Tech (CS)

Files in This Item:
File Description SizeFormat 
DISS-71.PDFDissertation is the original PDF603.9 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.