Recent developments in the complexity of combinatorial algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Mikrofilm Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Stanford, Calif.
1980
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
794 |
| Beschreibung: | Mikroreprod. e. Ms. 28 S. |
| Beschreibung: | 1 Mikrofiche 24x |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009241155 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | he|uuuuuuuuuu | ||
| 008 | 940313s1980 |||| b|||| 00||| und d | ||
| 035 | |a (OCoLC)632897292 | ||
| 035 | |a (DE-599)BVBBV009241155 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-29T | ||
| 100 | 1 | |a Tarjan, Robert E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Recent developments in the complexity of combinatorial algorithms |c Robert Endre Tarjan |
| 264 | 1 | |a Stanford, Calif. |c 1980 | |
| 300 | |a 1 Mikrofiche |b 24x | ||
| 337 | |b h |2 rdamedia | ||
| 338 | |b he |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 794 | |
| 500 | |a Mikroreprod. e. Ms. 28 S. | ||
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 794 |w (DE-604)BV008928280 |9 794 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006147983 | ||
Datensatz im Suchindex
| _version_ | 1804123687373242368 |
|---|---|
| any_adam_object | |
| author | Tarjan, Robert E. |
| author_facet | Tarjan, Robert E. |
| author_role | aut |
| author_sort | Tarjan, Robert E. |
| author_variant | r e t re ret |
| building | Verbundindex |
| bvnumber | BV009241155 |
| ctrlnum | (OCoLC)632897292 (DE-599)BVBBV009241155 |
| format | Microfilm Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00907nam a2200265 cb4500</leader><controlfield tag="001">BV009241155</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">he|uuuuuuuuuu</controlfield><controlfield tag="008">940313s1980 |||| b|||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)632897292</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009241155</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tarjan, Robert E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recent developments in the complexity of combinatorial algorithms</subfield><subfield code="c">Robert Endre Tarjan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Mikrofiche</subfield><subfield code="b">24x</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</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">794</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mikroreprod. e. Ms. 28 S.</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">794</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">794</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006147983</subfield></datafield></record></collection> |
| id | DE-604.BV009241155 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:44Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006147983 |
| oclc_num | 632897292 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 1 Mikrofiche 24x |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Tarjan, Robert E. Verfasser aut Recent developments in the complexity of combinatorial algorithms Robert Endre Tarjan Stanford, Calif. 1980 1 Mikrofiche 24x h rdamedia he rdacarrier Stanford University / Computer Science Department: Report STAN-CS 794 Mikroreprod. e. Ms. 28 S. Computer Science Department: Report STAN-CS Stanford University 794 (DE-604)BV008928280 794 |
| spellingShingle | Tarjan, Robert E. Recent developments in the complexity of combinatorial algorithms |
| title | Recent developments in the complexity of combinatorial algorithms |
| title_auth | Recent developments in the complexity of combinatorial algorithms |
| title_exact_search | Recent developments in the complexity of combinatorial algorithms |
| title_full | Recent developments in the complexity of combinatorial algorithms Robert Endre Tarjan |
| title_fullStr | Recent developments in the complexity of combinatorial algorithms Robert Endre Tarjan |
| title_full_unstemmed | Recent developments in the complexity of combinatorial algorithms Robert Endre Tarjan |
| title_short | Recent developments in the complexity of combinatorial algorithms |
| title_sort | recent developments in the complexity of combinatorial algorithms |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT tarjanroberte recentdevelopmentsinthecomplexityofcombinatorialalgorithms |