In situ inversion of a cyclic permutation:
An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather t...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
703 |
| Schlagworte: | |
| Zusammenfassung: | An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself. |
| Beschreibung: | 5 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010589663 | ||
| 003 | DE-604 | ||
| 005 | 20010508 | ||
| 007 | t | ||
| 008 | 960130s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)14705921 | ||
| 035 | |a (DE-599)BVBBV010589663 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Feijen, W. H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a In situ inversion of a cyclic permutation |c W, H. J. Feijen ; A. J. M. van Gasteren ; David Gries |
| 264 | 1 | |a Ithaca, New York |c 1985 | |
| 300 | |a 5 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 703 | |
| 520 | 3 | |a An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Permutations | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Gasteren, Antonetta J. M. van |e Verfasser |4 aut | |
| 700 | 1 | |a Gries, David |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 703 |w (DE-604)BV006185504 |9 703 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007061546 | ||
Datensatz im Suchindex
| _version_ | 1804125060458348544 |
|---|---|
| any_adam_object | |
| author | Feijen, W. H. Gasteren, Antonetta J. M. van Gries, David |
| author_facet | Feijen, W. H. Gasteren, Antonetta J. M. van Gries, David |
| author_role | aut aut aut |
| author_sort | Feijen, W. H. |
| author_variant | w h f wh whf a j m v g ajmv ajmvg d g dg |
| building | Verbundindex |
| bvnumber | BV010589663 |
| ctrlnum | (OCoLC)14705921 (DE-599)BVBBV010589663 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01461nam a2200337 cb4500</leader><controlfield tag="001">BV010589663</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010508 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960130s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14705921</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010589663</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feijen, W. H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">In situ inversion of a cyclic permutation</subfield><subfield code="c">W, H. J. Feijen ; A. J. M. van Gasteren ; David Gries</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 Bl.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">703</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Permutations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gasteren, Antonetta J. M. van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gries, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">703</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">703</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007061546</subfield></datafield></record></collection> |
| id | DE-604.BV010589663 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007061546 |
| oclc_num | 14705921 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 5 Bl. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Feijen, W. H. Verfasser aut In situ inversion of a cyclic permutation W, H. J. Feijen ; A. J. M. van Gasteren ; David Gries Ithaca, New York 1985 5 Bl. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 703 An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself. Algorithms Permutations Proof theory Gasteren, Antonetta J. M. van Verfasser aut Gries, David Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 703 (DE-604)BV006185504 703 |
| spellingShingle | Feijen, W. H. Gasteren, Antonetta J. M. van Gries, David In situ inversion of a cyclic permutation Algorithms Permutations Proof theory |
| title | In situ inversion of a cyclic permutation |
| title_auth | In situ inversion of a cyclic permutation |
| title_exact_search | In situ inversion of a cyclic permutation |
| title_full | In situ inversion of a cyclic permutation W, H. J. Feijen ; A. J. M. van Gasteren ; David Gries |
| title_fullStr | In situ inversion of a cyclic permutation W, H. J. Feijen ; A. J. M. van Gasteren ; David Gries |
| title_full_unstemmed | In situ inversion of a cyclic permutation W, H. J. Feijen ; A. J. M. van Gasteren ; David Gries |
| title_short | In situ inversion of a cyclic permutation |
| title_sort | in situ inversion of a cyclic permutation |
| topic | Algorithms Permutations Proof theory |
| topic_facet | Algorithms Permutations Proof theory |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT feijenwh insituinversionofacyclicpermutation AT gasterenantonettajmvan insituinversionofacyclicpermutation AT griesdavid insituinversionofacyclicpermutation |