Sublinear-time parallel algorithms for matching and related problems:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1988
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1211 |
| Schlagworte: | |
| Beschreibung: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009227392 | ||
| 003 | DE-604 | ||
| 005 | 20141230 | ||
| 007 | t | ||
| 008 | 940313s1988 |||| 00||| eng d | ||
| 035 | |a (OCoLC)19124232 | ||
| 035 | |a (DE-599)BVBBV009227392 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 004/.35 |2 19 | |
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Sublinear-time parallel algorithms for matching and related problems |c by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya |
| 264 | 1 | |a Stanford, Calif. |c 1988 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1211 | |
| 650 | 4 | |a Parallel algorithms | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prüfung |0 (DE-588)4047609-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Prüfung |0 (DE-588)4047609-1 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 689 | 3 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 3 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Plotkin, Serge A. |e Verfasser |4 aut | |
| 700 | 1 | |a Vaidya, Pravin M. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1211 |w (DE-604)BV008928280 |9 1211 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006136082 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804123670728146944 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin M. |
| author_facet | Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin M. |
| author_role | aut aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg s a p sa sap p m v pm pmv |
| building | Verbundindex |
| bvnumber | BV009227392 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)19124232 (DE-599)BVBBV009227392 |
| dewey-full | 004/.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 |
| dewey-search | 004/.35 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01973nam a2200517 cb4500</leader><controlfield tag="001">BV009227392</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20141230 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1988 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19124232</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009227392</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sublinear-time parallel algorithms for matching and related problems</subfield><subfield code="c">by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1211</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prüfung</subfield><subfield code="0">(DE-588)4047609-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Prüfung</subfield><subfield code="0">(DE-588)4047609-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vaidya, Pravin M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1211</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1211</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006136082</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV009227392 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006136082 |
| oclc_num | 19124232 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 25 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Goldberg, Andrew V. Verfasser aut Sublinear-time parallel algorithms for matching and related problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya Stanford, Calif. 1988 25 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1211 Parallel algorithms Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Prüfung (DE-588)4047609-1 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 s DE-604 Algorithmus (DE-588)4001183-5 s 1\p DE-604 Prüfung (DE-588)4047609-1 s 2\p DE-604 Netzwerk (DE-588)4171529-9 s 3\p DE-604 Plotkin, Serge A. Verfasser aut Vaidya, Pravin M. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1211 (DE-604)BV008928280 1211 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin M. Sublinear-time parallel algorithms for matching and related problems Parallel algorithms Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd Prüfung (DE-588)4047609-1 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4001183-5 (DE-588)4171529-9 (DE-588)4047609-1 |
| title | Sublinear-time parallel algorithms for matching and related problems |
| title_auth | Sublinear-time parallel algorithms for matching and related problems |
| title_exact_search | Sublinear-time parallel algorithms for matching and related problems |
| title_full | Sublinear-time parallel algorithms for matching and related problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya |
| title_fullStr | Sublinear-time parallel algorithms for matching and related problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya |
| title_full_unstemmed | Sublinear-time parallel algorithms for matching and related problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya |
| title_short | Sublinear-time parallel algorithms for matching and related problems |
| title_sort | sublinear time parallel algorithms for matching and related problems |
| topic | Parallel algorithms Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd Prüfung (DE-588)4047609-1 gnd |
| topic_facet | Parallel algorithms Parallel programming (Computer science) Parallelverarbeitung Algorithmus Netzwerk Prüfung |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv sublineartimeparallelalgorithmsformatchingandrelatedproblems AT plotkinsergea sublineartimeparallelalgorithmsformatchingandrelatedproblems AT vaidyapravinm sublineartimeparallelalgorithmsformatchingandrelatedproblems |