{"id":"https://openalex.org/W2049495867","doi":"https://doi.org/10.1142/s0129626499000104","title":"A CONSTANT TIME PARALLEL DETECTION OF REPETITIONS","display_name":"A CONSTANT TIME PARALLEL DETECTION OF REPETITIONS","publication_year":1999,"publication_date":"1999-03-01","ids":{"openalex":"https://openalex.org/W2049495867","doi":"https://doi.org/10.1142/s0129626499000104","mag":"2049495867"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626499000104","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000104","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082392230","display_name":"EMMANUEL DELACOURT","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"EMMANUEL DELACOURT","raw_affiliation_strings":["Facult\u00e9 de Math\u00e9matiques et d' Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu, Amiens, 80039 Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 de Math\u00e9matiques et d' Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu, Amiens, 80039 Cedex 1, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013486678","display_name":"Jean\u2010Fr\u00e9d\u00e9ric Myoupo","orcid":"https://orcid.org/0000-0003-3657-2556"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"JEAN-FREDERIC MYOUPO","raw_affiliation_strings":["Facult\u00e9 de Math\u00e9matiques et d' Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu, Amiens, 80039 Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 de Math\u00e9matiques et d' Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu, Amiens, 80039 Cedex 1, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112811055","display_name":"David Sem\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"DAVID SEME","raw_affiliation_strings":["Facult\u00e9 de Math\u00e9matiques et d' Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu, Amiens, 80039 Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 de Math\u00e9matiques et d' Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu, Amiens, 80039 Cedex 1, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":1.639,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8656564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"09","issue":"01","first_page":"81","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/constant","display_name":"Constant (computer programming)","score":0.8263653516769409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6424964070320129},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.628998875617981},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.585911214351654},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5554147362709045},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5160055160522461},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5087044835090637},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.5048962235450745},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48001497983932495},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4650723934173584},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.45215508341789246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37834110856056213},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37078189849853516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3066519498825073}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.8263653516769409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6424964070320129},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.628998875617981},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.585911214351654},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5554147362709045},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5160055160522461},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5087044835090637},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.5048962235450745},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48001497983932495},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4650723934173584},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.45215508341789246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37834110856056213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37078189849853516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3066519498825073},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626499000104","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000104","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03238073v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03238073","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Parallel Processing Letters, 2011, 09 (01), pp.81-92. ⟨10.1142/S0129626499000104⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2155395173","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W1577155814","https://openalex.org/W1838063489","https://openalex.org/W2099271296","https://openalex.org/W2743938404","https://openalex.org/W2038796709","https://openalex.org/W1972433940","https://openalex.org/W1545170796"],"abstract_inverted_index":{"Recently":[0],"Akl":[1],"and":[2,17,28,52],"al.":[3],"introduced":[4],"a":[5],"new":[6],"model":[7,43,89],"of":[8,66,90,101,113],"parallel":[9,50],"computation,":[10],"called":[11],"BSR":[12,75],"(broadcasting":[13],"with":[14],"selective":[15],"reduction)":[16],"showed":[18],"that":[19],"it":[20],"is":[21,78,95,110],"more":[22,32],"powerful":[23],"than":[24,37],"any":[25,88,102],"CRCW":[26],"PRAM":[27,40],"yet":[29],"requires":[30],"no":[31],"resources":[33],"(asymptotically)":[34],"for":[35],"implementation":[36],"even":[38],"EREW":[39],"[2,3,4].":[41],"The":[42],"allows":[44],"constant":[45,60,81],"time":[46,61,82],"solutions":[47],"to":[48,63,84,97,120],"sorting,":[49],"prefix":[51],"other":[53],"problems.":[54],"In":[55],"this":[56,85],"paper,":[57],"we":[58],"describe":[59],"solution":[62,83],"the":[64,72,79,93,99,111,114],"detection":[65],"repetitions":[67,118],"(with":[68],"overlapping)":[69],"problem":[70,86,94],"using":[71],"one":[73],"criterion":[74],"model.":[76],"This":[77],"first":[80],"on":[87],"computation.":[91],"If":[92,116],"only":[96],"detect":[98],"existence":[100],"repetition":[103],"then":[104,123],"n":[105,109],"processors":[106,127],"suffice,":[107],"where":[108],"length":[112],"string.":[115],"all":[117],"are":[119],"be":[121],"found":[122],"[Formula:":[124],"see":[125],"text]":[126],"suffice":[128],"in":[129],"our":[130],"algorithm.":[131]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}