{"id":"https://openalex.org/W1864806550","doi":"https://doi.org/10.82444/warw.33535921","title":"Efficient parallel string comparison","display_name":"Efficient parallel string comparison","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1864806550","doi":"https://doi.org/10.82444/warw.33535921","mag":"1864806550"},"language":"en","primary_location":{"id":"pmh:oai:wrap.warwick.ac.uk:61628","doi":null,"is_oa":false,"landing_page_url":"http://wrap.warwick.ac.uk/61628/1/krusche.pdf","pdf_url":"http://wrap.warwick.ac.uk/61628/1/krusche.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Book Item"},"volume":null,"type":"book-chapter","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.82444/warw.33535921","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034471501","display_name":"Peter Krusche","orcid":"https://orcid.org/0009-0003-2541-5181","observed_orcids":["https://orcid.org/0009-0003-2541-5181"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Krusche","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057408760","display_name":"Alexander Tiskin","orcid":"https://orcid.org/0000-0003-0680-4192","observed_orcids":["https://orcid.org/0000-0003-0680-4192"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Tiskin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9333,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.93877551,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.010400000028312206,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/longest-common-subsequence","display_name":"longest common subsequence","score":0.9940000176429749},{"id":"https://openalex.org/keywords/string-comparison","display_name":"string comparison","score":0.9509999752044678},{"id":"https://openalex.org/keywords/scalable-communication","display_name":"scalable communication","score":0.9729999899864197},{"id":"https://openalex.org/keywords/work-optimal-algorithms","display_name":"work-optimal algorithms","score":0.9240000247955322},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.5809999704360962}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9072425961494446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7906733751296997},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7661890983581543},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6415745615959167},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.512495756149292},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4723288416862488},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4659121334552765},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4433179795742035},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4276336431503296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4013115167617798},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.36850136518478394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1792677640914917},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:wrap.warwick.ac.uk:61628","doi":null,"is_oa":false,"landing_page_url":"http://wrap.warwick.ac.uk/61628/1/krusche.pdf","pdf_url":"http://wrap.warwick.ac.uk/61628/1/krusche.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Book Item"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.2668","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.2668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.warwick.ac.uk/~peter/files/semilocal-par.pdf","raw_type":"text"},{"id":"doi:10.82444/warw.33535921","doi":"https://doi.org/10.82444/warw.33535921","is_oa":true,"landing_page_url":"https://doi.org/10.82444/warw.33535921","pdf_url":null,"source":{"id":"https://openalex.org/S7407060609","display_name":"University of Warwick","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferenceProceeding"},{"id":"mag:1864806550","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/parco/parco2007.html#KruscheT07","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Parallel Computing","raw_type":null}],"best_oa_location":{"id":"doi:10.82444/warw.33535921","doi":"https://doi.org/10.82444/warw.33535921","is_oa":true,"landing_page_url":"https://doi.org/10.82444/warw.33535921","pdf_url":null,"source":{"id":"https://openalex.org/S7407060609","display_name":"University of Warwick","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferenceProceeding"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W20034245","https://openalex.org/W186906173","https://openalex.org/W1569198079","https://openalex.org/W1574782237","https://openalex.org/W1647671624","https://openalex.org/W1846712348","https://openalex.org/W1889224378","https://openalex.org/W1970026646","https://openalex.org/W2045271686","https://openalex.org/W2060296641","https://openalex.org/W2066688636","https://openalex.org/W2070320107","https://openalex.org/W2106184136","https://openalex.org/W2128703518","https://openalex.org/W2147602940"],"related_works":["https://openalex.org/W3203750076","https://openalex.org/W7098459235","https://openalex.org/W3041766674","https://openalex.org/W7097966044","https://openalex.org/W7097863858","https://openalex.org/W2072458248","https://openalex.org/W2147602940","https://openalex.org/W109827894","https://openalex.org/W2130413548","https://openalex.org/W6902030976"],"abstract_inverted_index":{"The":[0],"longest":[1],"common":[2],"subsequence":[3],"(LCS)":[4],"problem":[5,20,60],"is":[6,52],"a":[7,57],"classical":[8],"method":[9],"of":[10,29,61,70,75],"string":[11,63],"comparison.":[12],"Several":[13],"coarse-grained":[14,42],"parallel":[15,43],"algorithms":[16,31],"for":[17],"the":[18,25,40,50,76],"LCS":[19,44],"have":[21],"been":[22],"proposed":[23],"in":[24,66],"past.":[26],"However.":[27],"none":[28],"these":[30,71],"achieve":[32],"scalable":[33,47],"communication.":[34,48],"In":[35],"this":[36],"paper.":[37],"we":[38],"propose":[39],"first":[41],"algorithm":[45,51],"with":[46],"Moreover,":[49],"work-optimal,":[53],"synchronisation-efficient,":[54],"and":[55],"solves":[56],"more":[58],"general":[59],"semi-local":[62],"comparison,":[64],"improving":[65],"at":[67],"least":[68],"two":[69],"aspects":[72],"on":[73],"each":[74],"predecessors.":[77]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}