An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Freie Univ., Fachbereich Mathematik und Informatik
1999
|
| Schriftenreihe: | Technical report / Freie Universität Berlin, Fachbereich Mathematik und Informatik, Serie B, Informatik
99,13 |
| Beschreibung: | 17 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV026951453 | ||
| 003 | DE-604 | ||
| 005 | 20110228 | ||
| 007 | t | ||
| 008 | 110326s1999 d||| |||| 00||| eng d | ||
| 015 | |a 00,B12,0438 |2 dnb | ||
| 015 | |a 00,B12,0438 |2 dnb | ||
| 035 | |a (OCoLC)76113050 | ||
| 035 | |a (DE-599)BVBBV026951453 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-188 | ||
| 100 | 1 | |a Wankar, Rajeev |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |c Rajeev Wankar, Elfriede Fehr, and N. S. Chaudhari |
| 264 | 1 | |a Berlin |b Freie Univ., Fachbereich Mathematik und Informatik |c 1999 | |
| 300 | |a 17 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technical report / Freie Universität Berlin, Fachbereich Mathematik und Informatik, Serie B, Informatik |v 99,13 | |
| 700 | 1 | |a Fehr, Elfriede |d 1950- |e Verfasser |0 (DE-588)141672250 |4 aut | |
| 700 | 1 | |a Chaudhari, N. S. |e Verfasser |4 aut | |
| 810 | 2 | |a Universität <Berlin, Freie Universität> |p Fachbereich Mathematik und Informatik |t Freie Universität Berlin, Fachbereich Mathematik und Informatik / B |v 99,13 |w (DE-604)BV026062980 |9 99,13 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-021612581 | ||
Datensatz im Suchindex
| _version_ | 1804144412780920832 |
|---|---|
| any_adam_object | |
| author | Wankar, Rajeev Fehr, Elfriede 1950- Chaudhari, N. S. |
| author_GND | (DE-588)141672250 |
| author_facet | Wankar, Rajeev Fehr, Elfriede 1950- Chaudhari, N. S. |
| author_role | aut aut aut |
| author_sort | Wankar, Rajeev |
| author_variant | r w rw e f ef n s c ns nsc |
| building | Verbundindex |
| bvnumber | BV026951453 |
| ctrlnum | (OCoLC)76113050 (DE-599)BVBBV026951453 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01340nam a2200313 cb4500</leader><controlfield tag="001">BV026951453</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110326s1999 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">00,B12,0438</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">00,B12,0438</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76113050</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV026951453</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wankar, Rajeev</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems</subfield><subfield code="c">Rajeev Wankar, Elfriede Fehr, and N. S. Chaudhari</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Freie Univ., Fachbereich Mathematik und Informatik</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technical report / Freie Universität Berlin, Fachbereich Mathematik und Informatik, Serie B, Informatik</subfield><subfield code="v">99,13</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fehr, Elfriede</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)141672250</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chaudhari, N. S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität <Berlin, Freie Universität> </subfield><subfield code="p">Fachbereich Mathematik und Informatik</subfield><subfield code="t">Freie Universität Berlin, Fachbereich Mathematik und Informatik / B</subfield><subfield code="v">99,13</subfield><subfield code="w">(DE-604)BV026062980</subfield><subfield code="9">99,13</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-021612581</subfield></datafield></record></collection> |
| id | DE-604.BV026951453 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T23:03:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021612581 |
| oclc_num | 76113050 |
| open_access_boolean | |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | 17 S. graph. Darst. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Freie Univ., Fachbereich Mathematik und Informatik |
| record_format | marc |
| series2 | Technical report / Freie Universität Berlin, Fachbereich Mathematik und Informatik, Serie B, Informatik |
| spelling | Wankar, Rajeev Verfasser aut An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems Rajeev Wankar, Elfriede Fehr, and N. S. Chaudhari Berlin Freie Univ., Fachbereich Mathematik und Informatik 1999 17 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technical report / Freie Universität Berlin, Fachbereich Mathematik und Informatik, Serie B, Informatik 99,13 Fehr, Elfriede 1950- Verfasser (DE-588)141672250 aut Chaudhari, N. S. Verfasser aut Universität <Berlin, Freie Universität> Fachbereich Mathematik und Informatik Freie Universität Berlin, Fachbereich Mathematik und Informatik / B 99,13 (DE-604)BV026062980 99,13 |
| spellingShingle | Wankar, Rajeev Fehr, Elfriede 1950- Chaudhari, N. S. An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |
| title | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |
| title_auth | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |
| title_exact_search | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |
| title_full | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems Rajeev Wankar, Elfriede Fehr, and N. S. Chaudhari |
| title_fullStr | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems Rajeev Wankar, Elfriede Fehr, and N. S. Chaudhari |
| title_full_unstemmed | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems Rajeev Wankar, Elfriede Fehr, and N. S. Chaudhari |
| title_short | An efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |
| title_sort | an efficient parallel algorithm for the all pairs shortest path problem using processor arrays with reconfigurable bus systems |
| volume_link | (DE-604)BV026062980 |
| work_keys_str_mv | AT wankarrajeev anefficientparallelalgorithmfortheallpairsshortestpathproblemusingprocessorarrayswithreconfigurablebussystems AT fehrelfriede anefficientparallelalgorithmfortheallpairsshortestpathproblemusingprocessorarrayswithreconfigurablebussystems AT chaudharins anefficientparallelalgorithmfortheallpairsshortestpathproblemusingprocessorarrayswithreconfigurablebussystems |