{"id":"https://openalex.org/W2113152042","doi":"https://doi.org/10.1142/s012962649100015x","title":"DETERMINING THE MODE IN PARALLEL","display_name":"DETERMINING THE MODE IN PARALLEL","publication_year":1991,"publication_date":"1991-09-01","ids":{"openalex":"https://openalex.org/W2113152042","doi":"https://doi.org/10.1142/s012962649100015x","mag":"2113152042"},"language":"en","primary_location":{"id":"doi:10.1142/s012962649100015x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962649100015x","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/A5022573566","display_name":"Eliezer A. Albacea","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"ELIEZER A. ALBACEA","raw_affiliation_strings":["Department of Computer Science, Australian National University, GPO Box 4, Canberra,  ACT 2601, Australia","Department of Computer Science, Australian National University, GPO Box 4, Canberra, ACT 2601, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Australian National University, GPO Box 4, Canberra,  ACT 2601, Australia","institution_ids":["https://openalex.org/I118347636"]},{"raw_affiliation_string":"Department of Computer Science, Australian National University, GPO Box 4, Canberra, ACT 2601, Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022573566"],"corresponding_institution_ids":["https://openalex.org/I118347636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13658311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"01","issue":"01","first_page":"3","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.34040001034736633,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.34040001034736633,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.09179999679327011,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.07760000228881836,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6979660987854004},{"id":"https://openalex.org/keywords/mode","display_name":"Mode (computer interface)","score":0.6877719163894653},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6736304759979248},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5913278460502625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5686960816383362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49922704696655273},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.49426960945129395},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47314226627349854},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.45460763573646545},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41500142216682434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33259084820747375}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6979660987854004},{"id":"https://openalex.org/C48677424","wikidata":"https://www.wikidata.org/wiki/Q6888088","display_name":"Mode (computer interface)","level":2,"score":0.6877719163894653},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6736304759979248},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5913278460502625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5686960816383362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49922704696655273},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.49426960945129395},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47314226627349854},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.45460763573646545},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41500142216682434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33259084820747375},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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":1,"locations":[{"id":"doi:10.1142/s012962649100015x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962649100015x","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/W2739612537","https://openalex.org/W3013085049","https://openalex.org/W2349174696","https://openalex.org/W2360241746","https://openalex.org/W4313041667","https://openalex.org/W2767599893","https://openalex.org/W2381572297","https://openalex.org/W3114770763","https://openalex.org/W1560496689","https://openalex.org/W2368890809"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,52],"the":[3,7,10,16,19,24,37,42,57,69,76],"problem":[4,25],"of":[5,18,26,36],"finding":[6,41,75],"element":[8],"with":[9],"highest":[11],"frequency":[12],"in":[13],"a":[14,30],"set,":[15,20],"mode":[17],"is":[21,59],"bounded":[22],"by":[23,48],"sorting":[27],"multisets.":[28],"As":[29],"consequence,":[31],"we":[32],"obtained":[33,47],"an":[34,50],"improvement":[35],"upper":[38],"bound":[39],"for":[40,74],"mode.":[43,77],"This":[44],"result":[45],"was":[46,65],"presenting":[49],"algorithm":[51,64,73],"requires":[53],"linear":[54],"time":[55],"when":[56],"set":[58],"initially":[60],"sorted.":[61],"The":[62],"same":[63],"parallelized":[66],"to":[67],"produce":[68],"first":[70],"optimal":[71],"parallel":[72]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}