List homomorphic parallel algorithms for bracket matching:
Abstract: "We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the pra...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1993
|
| Schriftenreihe: | University <Edinburgh> / Department of Computer Science: CSR
29 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the practical efficacy with which such algorithms can be derived and expressed given the support of a well understood theoretical foundation. One of the variants produced is of particular interest in that it exploits the same theoretical result twice to produce nested parallelism." |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041402 | ||
| 003 | DE-604 | ||
| 005 | 19940721 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)32408791 | ||
| 035 | |a (DE-599)BVBBV009041402 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Cole, Murray |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a List homomorphic parallel algorithms for bracket matching |c by Murray Cole |
| 264 | 1 | |a Edinburgh |c 1993 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Computer Science: CSR |v 29 | |
| 520 | 3 | |a Abstract: "We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the practical efficacy with which such algorithms can be derived and expressed given the support of a well understood theoretical foundation. One of the variants produced is of particular interest in that it exploits the same theoretical result twice to produce nested parallelism." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 810 | 2 | |a Department of Computer Science: CSR |t University <Edinburgh> |v 29 |w (DE-604)BV008906637 |9 29 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982748 | ||
Datensatz im Suchindex
| _version_ | 1804123396201512960 |
|---|---|
| any_adam_object | |
| author | Cole, Murray |
| author_facet | Cole, Murray |
| author_role | aut |
| author_sort | Cole, Murray |
| author_variant | m c mc |
| building | Verbundindex |
| bvnumber | BV009041402 |
| ctrlnum | (OCoLC)32408791 (DE-599)BVBBV009041402 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01591nam a2200325 cb4500</leader><controlfield tag="001">BV009041402</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940721 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32408791</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041402</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><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cole, Murray</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">List homomorphic parallel algorithms for bracket matching</subfield><subfield code="c">by Murray Cole</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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">University <Edinburgh> / Department of Computer Science: CSR</subfield><subfield code="v">29</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the practical efficacy with which such algorithms can be derived and expressed given the support of a well understood theoretical foundation. One of the variants produced is of particular interest in that it exploits the same theoretical result twice to produce nested parallelism."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: CSR</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">29</subfield><subfield code="w">(DE-604)BV008906637</subfield><subfield code="9">29</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982748</subfield></datafield></record></collection> |
| id | DE-604.BV009041402 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982748 |
| oclc_num | 32408791 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Computer Science: CSR |
| spelling | Cole, Murray Verfasser aut List homomorphic parallel algorithms for bracket matching by Murray Cole Edinburgh 1993 15 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Computer Science: CSR 29 Abstract: "We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the practical efficacy with which such algorithms can be derived and expressed given the support of a well understood theoretical foundation. One of the variants produced is of particular interest in that it exploits the same theoretical result twice to produce nested parallelism." Computer software sigle Mathematics sigle Mathematik Parallel processing (Electronic computers) Department of Computer Science: CSR University <Edinburgh> 29 (DE-604)BV008906637 29 |
| spellingShingle | Cole, Murray List homomorphic parallel algorithms for bracket matching Computer software sigle Mathematics sigle Mathematik Parallel processing (Electronic computers) |
| title | List homomorphic parallel algorithms for bracket matching |
| title_auth | List homomorphic parallel algorithms for bracket matching |
| title_exact_search | List homomorphic parallel algorithms for bracket matching |
| title_full | List homomorphic parallel algorithms for bracket matching by Murray Cole |
| title_fullStr | List homomorphic parallel algorithms for bracket matching by Murray Cole |
| title_full_unstemmed | List homomorphic parallel algorithms for bracket matching by Murray Cole |
| title_short | List homomorphic parallel algorithms for bracket matching |
| title_sort | list homomorphic parallel algorithms for bracket matching |
| topic | Computer software sigle Mathematics sigle Mathematik Parallel processing (Electronic computers) |
| topic_facet | Computer software Mathematics Mathematik Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008906637 |
| work_keys_str_mv | AT colemurray listhomomorphicparallelalgorithmsforbracketmatching |