{"id":"https://openalex.org/W2002841819","doi":"https://doi.org/10.1142/s0129626495000205","title":"FAST PARALLEL ALGORITHMS FOR MINIMUM AND RELATED PROBLEMS WITH SMALL INTEGER INPUTS","display_name":"FAST PARALLEL ALGORITHMS FOR MINIMUM AND RELATED PROBLEMS WITH SMALL INTEGER INPUTS","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2002841819","doi":"https://doi.org/10.1142/s0129626495000205","mag":"2002841819"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626495000205","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626495000205","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/A5103285481","display_name":"Omer Berkman","orcid":"https://orcid.org/0000-0003-0503-7366"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"OMER BERKMAN","raw_affiliation_strings":["Department of Computer Science, King's College London, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College London, England","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065128060","display_name":"Yossi Matias","orcid":"https://orcid.org/0000-0003-3960-6002"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YOSSI MATIAS","raw_affiliation_strings":["AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","AT&T Bell Laboratories , 600 Mountain Avenue, Murray Hill , NJ , 07974-0636 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Bell Laboratories , 600 Mountain Avenue, Murray Hill , NJ , 07974-0636 , USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103285481"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":1.1786,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.82001591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"05","issue":"02","first_page":"223","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9977999925613403,"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.9977999925613403,"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.9889000058174133,"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/maxima-and-minima","display_name":"Maxima and minima","score":0.7284248471260071},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6470927000045776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6385839581489563},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.626564085483551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5529162287712097},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5462786555290222},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5293049812316895},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5024516582489014},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4692036509513855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4278988242149353},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41642439365386963},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3955237865447998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32381659746170044}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7284248471260071},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6470927000045776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6385839581489563},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.626564085483551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5529162287712097},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5462786555290222},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5293049812316895},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5024516582489014},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4692036509513855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4278988242149353},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41642439365386963},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3955237865447998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32381659746170044},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626495000205","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626495000205","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"}],"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/W2004283824","https://openalex.org/W2113270940","https://openalex.org/W1581210843","https://openalex.org/W1992104669","https://openalex.org/W1982530285","https://openalex.org/W2521054645","https://openalex.org/W1998702677","https://openalex.org/W1830048115","https://openalex.org/W2515993118","https://openalex.org/W2887154986"],"abstract_inverted_index":{"The":[0],"fundamental":[1],"problem":[2,202],"of":[3,57,64,76,84,130],"minimum":[4,200,219],"computation":[5,201],"has":[6],"several":[7],"well-studied":[8],"generalizations":[9],"such":[10],"as":[11],"prefix":[12],"minima,":[13,15],"range":[14,103],"and":[16,48,107],"all":[17,74,121,211],"nearest":[18],"smaller":[19],"values":[20,75],"computations.":[21],"Recent":[22],"papers":[23],"introduced":[24],"parallel":[25],"algorithms":[26,59,110,145,162,179],"for":[27,51,73,81,120,198,210],"these":[28,58],"problems":[29],"when":[30],"the":[31,61,82,91,102,131,147,150,157,166,169,182,192,199,203,218],"n":[32,106],"input":[33,194,220],"elements":[34],"are":[35],"given":[36],"from":[37],"an":[38],"integer":[39],"domain":[40,151,170],"[1..s],":[41],"obtaining":[42],"O(":[43,65,70,114,207],"lglglg":[44,66,71,115,187,208],"s)":[45],"running":[46,62,92,112,204],"time":[47,63,93,113,205],"linear":[49],"work":[50,163],"s":[52,77,85,104,116,122,153,172,212],"\u2265":[53,123,213],"n.":[54],"However,":[55],"most":[56],"have":[60],"n)":[67],"(rather":[68],"than":[69],"s))":[72],"\u2264":[78,105],"n,":[79],"except":[80],"case":[83,90,148],"=":[86],"O(1)":[87],"in":[88],"which":[89],"is":[94,119,127,154,173,191,206,217],"O(\u03b1(n)).":[95],"In":[96,196],"this":[97],"paper":[98],"we":[99,176],"focus":[100],"on":[101],"provide":[108],"linear-work":[109],"whose":[111],"+":[117],"f(n))":[118],"0,":[124,214],"where":[125,189,215],"f(n)":[126],"either":[128],"one":[129],"slow":[132],"growing":[133],"functions":[134],"lg":[135],"*n":[136],"or":[137],"\u03b1(n).":[138],"We":[139],"show":[140],"how":[141],"to":[142,146],"generalize":[143],"our":[144,178],"that":[149,168],"size":[152,171],"unknown,":[155],"with":[156,181],"same":[158],"complexities.":[159],"(All":[160],"previous":[161],"only":[164],"under":[165],"assumption":[167],"known.)":[174],"Moreover,":[175],"make":[177],"output-sensitive":[180],"lglglgs":[183],"term":[184],"replaced":[185],"by":[186],"M,":[188],"M":[190],"maximum":[193],"value.":[195,221],"fact,":[197],"m)":[209],"m":[216]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}