On the lower bound for parallel string matching
We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G].
Gespeichert in:
| Veröffentlicht in: | International journal of computer mathematics 1996-01, Vol.62 (3-4), p.155-162 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 162 |
|---|---|
| container_issue | 3-4 |
| container_start_page | 155 |
| container_title | International journal of computer mathematics |
| container_volume | 62 |
| creator | Galley, Clive N. Iliopoulosam, Costas S. |
| description | We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G]. |
| doi_str_mv | 10.1080/00207169608804533 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1080_00207169608804533</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>26263610</sourcerecordid><originalsourceid>FETCH-LOGICAL-c308t-d1e1c8ce44c1d54493c2c02b94788aeab5afff294540113e65c2ca408e9b30fc3</originalsourceid><addsrcrecordid>eNp1kEtLAzEUhYMoWKs_wN0sxN3Ym8dkMuBGii8odKPr4U4msSOZSU2mlP57U1rdiKt74HznXDiEXFO4o6BgBsCgpLKSoBSIgvMTMqHAqhyYLE7JZO_nCYBzchHjJwCoqpQTMlsO2bgymfNbE7LGb4Y2sz5kawzonHFZHEM3fGQ9jnqVxCU5s-iiuTreKXl_enybv-SL5fPr_GGRaw5qzFtqqFbaCKFpWwhRcc00sKYSpVJosCnQWssqUQiglBtZJB8FKFM1HKzmU3J76F0H_7Uxcaz7LmrjHA7Gb2LNJJNcUkggPYA6-BiDsfU6dD2GXU2h3k9T_5kmZW6O5Rg1Ohtw0F38DTJJy4Qn7P6AdUOapMetD66tR9w5H34y_P8v34utdI0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26263610</pqid></control><display><type>article</type><title>On the lower bound for parallel string matching</title><source>Taylor & Francis Journals Complete</source><creator>Galley, Clive N. ; Iliopoulosam, Costas S.</creator><creatorcontrib>Galley, Clive N. ; Iliopoulosam, Costas S.</creatorcontrib><description>We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G].</description><identifier>ISSN: 0020-7160</identifier><identifier>EISSN: 1029-0265</identifier><identifier>DOI: 10.1080/00207169608804533</identifier><identifier>CODEN: IJCMAT</identifier><language>eng</language><publisher>Abingdon: Gordon and Breach Science Publishers</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Analysis of algorithms ; Applied sciences ; Automata. Abstract machines. Turing machines ; Computer science; control theory; systems ; design of algorithms ; Exact sciences and technology ; F1.2 ; F2.2 ; G2.1 ; parallel algorithms ; Theoretical computing</subject><ispartof>International journal of computer mathematics, 1996-01, Vol.62 (3-4), p.155-162</ispartof><rights>Copyright Taylor & Francis Group, LLC 1996</rights><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c308t-d1e1c8ce44c1d54493c2c02b94788aeab5afff294540113e65c2ca408e9b30fc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207169608804533$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207169608804533$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,780,784,4024,27923,27924,27925,59647,60436</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2617696$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Galley, Clive N.</creatorcontrib><creatorcontrib>Iliopoulosam, Costas S.</creatorcontrib><title>On the lower bound for parallel string matching</title><title>International journal of computer mathematics</title><description>We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G].</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Analysis of algorithms</subject><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer science; control theory; systems</subject><subject>design of algorithms</subject><subject>Exact sciences and technology</subject><subject>F1.2</subject><subject>F2.2</subject><subject>G2.1</subject><subject>parallel algorithms</subject><subject>Theoretical computing</subject><issn>0020-7160</issn><issn>1029-0265</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNp1kEtLAzEUhYMoWKs_wN0sxN3Ym8dkMuBGii8odKPr4U4msSOZSU2mlP57U1rdiKt74HznXDiEXFO4o6BgBsCgpLKSoBSIgvMTMqHAqhyYLE7JZO_nCYBzchHjJwCoqpQTMlsO2bgymfNbE7LGb4Y2sz5kawzonHFZHEM3fGQ9jnqVxCU5s-iiuTreKXl_enybv-SL5fPr_GGRaw5qzFtqqFbaCKFpWwhRcc00sKYSpVJosCnQWssqUQiglBtZJB8FKFM1HKzmU3J76F0H_7Uxcaz7LmrjHA7Gb2LNJJNcUkggPYA6-BiDsfU6dD2GXU2h3k9T_5kmZW6O5Rg1Ohtw0F38DTJJy4Qn7P6AdUOapMetD66tR9w5H34y_P8v34utdI0</recordid><startdate>19960101</startdate><enddate>19960101</enddate><creator>Galley, Clive N.</creator><creator>Iliopoulosam, Costas S.</creator><general>Gordon and Breach Science Publishers</general><general>Taylor and Francis</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19960101</creationdate><title>On the lower bound for parallel string matching</title><author>Galley, Clive N. ; Iliopoulosam, Costas S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c308t-d1e1c8ce44c1d54493c2c02b94788aeab5afff294540113e65c2ca408e9b30fc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Analysis of algorithms</topic><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer science; control theory; systems</topic><topic>design of algorithms</topic><topic>Exact sciences and technology</topic><topic>F1.2</topic><topic>F2.2</topic><topic>G2.1</topic><topic>parallel algorithms</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Galley, Clive N.</creatorcontrib><creatorcontrib>Iliopoulosam, Costas S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Galley, Clive N.</au><au>Iliopoulosam, Costas S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the lower bound for parallel string matching</atitle><jtitle>International journal of computer mathematics</jtitle><date>1996-01-01</date><risdate>1996</risdate><volume>62</volume><issue>3-4</issue><spage>155</spage><epage>162</epage><pages>155-162</pages><issn>0020-7160</issn><eissn>1029-0265</eissn><coden>IJCMAT</coden><abstract>We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G].</abstract><cop>Abingdon</cop><pub>Gordon and Breach Science Publishers</pub><doi>10.1080/00207169608804533</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-7160 |
| ispartof | International journal of computer mathematics, 1996-01, Vol.62 (3-4), p.155-162 |
| issn | 0020-7160 1029-0265 |
| language | eng |
| recordid | cdi_crossref_primary_10_1080_00207169608804533 |
| source | Taylor & Francis Journals Complete |
| subjects | Algorithmics. Computability. Computer arithmetics Analysis of algorithms Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems design of algorithms Exact sciences and technology F1.2 F2.2 G2.1 parallel algorithms Theoretical computing |
| title | On the lower bound for parallel string matching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T14%3A35%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20lower%20bound%20for%20parallel%20string%20matching&rft.jtitle=International%20journal%20of%20computer%20mathematics&rft.au=Galley,%20Clive%20N.&rft.date=1996-01-01&rft.volume=62&rft.issue=3-4&rft.spage=155&rft.epage=162&rft.pages=155-162&rft.issn=0020-7160&rft.eissn=1029-0265&rft.coden=IJCMAT&rft_id=info:doi/10.1080/00207169608804533&rft_dat=%3Cproquest_cross%3E26263610%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26263610&rft_id=info:pmid/&rfr_iscdi=true |