{"id":"https://openalex.org/W1984281137","doi":"https://doi.org/10.1137/s0097539793260404","title":"An Optimal $O(\\log \\log N)$-Time Parallel Algorithm for Detecting all Squares in a String","display_name":"An Optimal $O(\\log \\log N)$-Time Parallel Algorithm for Detecting all Squares in a String","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W1984281137","doi":"https://doi.org/10.1137/s0097539793260404","mag":"1984281137"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793260404","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793260404","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5029039590","display_name":"Alberto Apostolico","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alberto Apostolico","raw_affiliation_strings":["Purdue University"],"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037464757","display_name":"Dany Breslauer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dany Breslauer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029039590"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.277,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.89256863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"25","issue":"6","first_page":"1318","last_page":"1331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7522383332252502},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.7296866178512573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6681283116340637},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5832441449165344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5329094529151917},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.48973608016967773},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4824669659137726},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.43078237771987915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4266824722290039},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.41765347123146057},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.3869331181049347},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2600077986717224},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.054822295904159546}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7522383332252502},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.7296866178512573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6681283116340637},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5832441449165344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5329094529151917},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.48973608016967773},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4824669659137726},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.43078237771987915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4266824722290039},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.41765347123146057},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3869331181049347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2600077986717224},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.054822295904159546},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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":3,"locations":[{"id":"doi:10.1137/s0097539793260404","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793260404","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-2085","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/1086","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.4099","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.aau.dk/BRICS/RS/95/11/BRICS-RS-95-11.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.4399999976158142,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W17150092","https://openalex.org/W129503451","https://openalex.org/W204432766","https://openalex.org/W1485536627","https://openalex.org/W1514324498","https://openalex.org/W1519893856","https://openalex.org/W1523480252","https://openalex.org/W1535681052","https://openalex.org/W1549679293","https://openalex.org/W1592508669","https://openalex.org/W1967384930","https://openalex.org/W1973456884","https://openalex.org/W1983243118","https://openalex.org/W1990387309","https://openalex.org/W1992470151","https://openalex.org/W2024145045","https://openalex.org/W2030605270","https://openalex.org/W2034334221","https://openalex.org/W2067787802","https://openalex.org/W2078042165","https://openalex.org/W2078226209","https://openalex.org/W2086273045","https://openalex.org/W2086965829","https://openalex.org/W2130566259","https://openalex.org/W2154104338","https://openalex.org/W2168396231","https://openalex.org/W2244342551","https://openalex.org/W2475555490","https://openalex.org/W4301662502"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W1529311266","https://openalex.org/W2065008672","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W2079093912","https://openalex.org/W3144947242","https://openalex.org/W4287692398","https://openalex.org/W3047118271","https://openalex.org/W1983650378"],"abstract_inverted_index":{"An":[0],"optimal":[1,32,64],"$O(\\log":[2],"\\log":[3,48,49],"n)$-time":[4],"concurrent-read":[5],"concurrent-write":[6],"parallel":[7,65],"algorithm":[8,61,67],"for":[9],"detecting":[10],"all":[11],"squares":[12,75],"in":[13],"a":[14],"string":[15],"is":[16,28],"presented.":[17],"A":[18],"tight":[19],"lower":[20],"bound":[21],"shows":[22],"that":[23],"over":[24],"general":[25],"alphabets,":[26],"this":[27],"the":[29,39,74,77],"fastest":[30],"possible":[31],"algorithm.":[33],"When":[34],"p":[35],"processors":[36],"are":[37],"available,":[38],"bounds":[40],"become":[41],"$\\Theta":[42],"\\lceil":[43],"{({{n\\log":[44],"n)}":[45],"p}\\rceil":[46],"+":[47,52],"_{\\lceil":[50],"{1":[51],"{p":[53],"/":[54],"n}}":[55],"\\rceil":[56],"}":[57],"2p}":[58],")$.":[59],"The":[60],"uses":[62],"an":[63],"string-matching":[66],"together":[68],"with":[69],"periodicity":[70],"properties":[71],"to":[72],"locate":[73],"within":[76],"input":[78],"string.":[79]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}