{"id":"https://openalex.org/W2090919369","doi":"https://doi.org/10.1142/s0129054103002229","title":"EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES","display_name":"EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W2090919369","doi":"https://doi.org/10.1142/s0129054103002229","mag":"2090919369"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103002229","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002229","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5101435519","display_name":"David S. L. Wei","orcid":"https://orcid.org/0000-0002-3839-5576"},"institutions":[{"id":"https://openalex.org/I164389053","display_name":"Fordham University","ror":"https://ror.org/03qnxaf80","country_code":"US","type":"education","lineage":["https://openalex.org/I164389053"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DAVID S. L. WEI","raw_affiliation_strings":["Dept. of Comp. and Info. Sc.,  Fordham University, Bronx, NY 10458, USA","Dept. of Comp. and Info. Sc., Fordham University, Bronx, NY 10458, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comp. and Info. Sc.,  Fordham University, Bronx, NY 10458, USA","institution_ids":["https://openalex.org/I164389053"]},{"raw_affiliation_string":"Dept. of Comp. and Info. Sc., Fordham University, Bronx, NY 10458, USA","institution_ids":["https://openalex.org/I164389053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034177039","display_name":"Sanguthevar Rajasekaran","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SANGUTHEVAR RAJASEKARAN","raw_affiliation_strings":["Dept. of Comp. and Info. Sc.,  University of Florida, Gainesville, FL 32611, USA","Dept. of Comp. and Info. Sc., University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comp. and Info. Sc.,  University of Florida, Gainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Dept. of Comp. and Info. Sc., University of Florida, Gainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087692639","display_name":"Kshirasagar Naik","orcid":"https://orcid.org/0000-0002-1064-4905"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"KSHIRASAGAR NAIK","raw_affiliation_strings":["Dept. of Elect. and Comp. Eng.,  University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","Dept. of Elect. and Comp. Eng., University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Elect. and Comp. Eng.,  University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Dept. of Elect. and Comp. Eng., University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043885374","display_name":"Sy\u2010Yen Kuo","orcid":"https://orcid.org/0000-0002-3021-8321"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]},{"id":"https://openalex.org/I99613584","display_name":"National Taipei University","ror":"https://ror.org/03e29r284","country_code":"TW","type":"education","lineage":["https://openalex.org/I99613584"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"SY-YEN KUO","raw_affiliation_strings":["Dept. of Elect. Eng.,  National Taiwan University, Taipei, Taiwan, R.O.C","Dept. of Elect. Eng., National Taiwan University, Taipei, Taiwan, R.O.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Elect. Eng.,  National Taiwan University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I16733864","https://openalex.org/I99613584"]},{"raw_affiliation_string":"Dept. of Elect. Eng., National Taiwan University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I16733864","https://openalex.org/I99613584"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17684902,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"06","first_page":"1129","last_page":"1146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10237","display_name":"Cryptography and Data Security","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"}}],"keywords":[{"id":"https://openalex.org/keywords/quicksort","display_name":"Quicksort","score":0.8524662852287292},{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.8499221801757812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7512331008911133},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6534256935119629},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5561641454696655},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5419611930847168},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48793765902519226},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47588932514190674},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.46348410844802856},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.46054428815841675},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4584391415119171},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.4570268988609314},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.43117576837539673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36525237560272217},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3431345224380493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17666396498680115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13147491216659546},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10604941844940186}],"concepts":[{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.8524662852287292},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.8499221801757812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7512331008911133},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6534256935119629},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5561641454696655},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5419611930847168},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48793765902519226},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47588932514190674},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.46348410844802856},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.46054428815841675},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4584391415119171},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.4570268988609314},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43117576837539673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36525237560272217},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3431345224380493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17666396498680115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13147491216659546},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10604941844940186},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054103002229","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002229","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:140.112.114.62:246246/142001","is_oa":false,"landing_page_url":"http://ntur.lib.ntu.edu.tw//handle/246246/142001","pdf_url":null,"source":{"id":"https://openalex.org/S4306402491","display_name":"NTUR (\u81fa\u7063\u6a5f\u69cb\u5178\u85cf)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I16733864","host_organization_name":"National Taiwan University","host_organization_lineage":["https://openalex.org/I16733864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W177465002","https://openalex.org/W1513982482","https://openalex.org/W1983266860","https://openalex.org/W1989640573","https://openalex.org/W2061496873","https://openalex.org/W2091258557","https://openalex.org/W2091698120","https://openalex.org/W2119387648","https://openalex.org/W2172271047","https://openalex.org/W2293301713","https://openalex.org/W2752885492","https://openalex.org/W2914438073","https://openalex.org/W2994762488","https://openalex.org/W4301347794","https://openalex.org/W4311017726"],"related_works":["https://openalex.org/W1772474011","https://openalex.org/W2389598404","https://openalex.org/W4320925713","https://openalex.org/W1493296159","https://openalex.org/W76067348","https://openalex.org/W2065192940","https://openalex.org/W2503958529","https://openalex.org/W2144222125","https://openalex.org/W133797109","https://openalex.org/W2765396134"],"abstract_inverted_index":{"In":[0,15],"this":[1],"paper":[2],"we":[3,17,152],"show":[4,35,154],"the":[5,22,28,37,52,55,102,116,129,173,185],"power":[6],"of":[7,24,40,54,88,107,115,119,125,180,192],"sampling":[8,19],"techniques":[9,20],"in":[10,21,105,139,190],"designing":[11],"efficient":[12],"distributed":[13,133,170,187],"algorithms.":[14],"particular,":[16],"apply":[18],"design":[23],"selection":[25,68,99,134,150],"algorithms":[26,127,183],"on":[27,69,172],"hypercube":[29,76,174],"and":[30,34,84,111,122,160,175,196],"de":[31,72,176],"Bruijn":[32,73,177],"networks,":[33],"that":[36,155],"message":[38,109,120,194],"complexity":[39,110,121,195],"selecting":[41],"an":[42],"item":[43],"from":[44],"a":[45,59,67,70,86],"set":[46,56],"(file)":[47],"is":[48],"less":[49],"sensitive":[50],"to":[51,128],"cardinality":[53],"(file).":[57],"Given":[58],"file":[60,130],"with":[61,95],"n":[62],"keys,":[63],"our":[64,126,132,149,181],"algorithm":[65],"performs":[66],"p-node":[71],"network":[74],"or":[75],"using":[77],"only":[78],"O(p":[79],"log":[80,81,90,92,93],"n)":[82],"messages":[83],"suffering":[85],"delay":[87,124],"O(\u03c4":[89],"p":[91],"n),":[94],"high":[96],"probability.":[97],"Our":[98],"scheme":[100,159,163],"outperforms":[101],"existing":[103,186],"approaches":[104],"terms":[106,191],"both":[108,156,193],"communication":[112,123,197],"delay.":[113,198],"Because":[114],"lesser":[117],"sensitivity":[118],"size,":[131],"schemes":[135,189],"are":[136,146],"very":[137,142],"attractive":[138],"applications":[140],"where":[141],"large":[143,169],"database":[144],"systems":[145],"involved.":[147],"Using":[148],"algorithms,":[151],"also":[153],"quicksort-based":[157],"sorting":[158,162,168,182,188],"enumeration":[161],"can":[164],"be":[165],"developed":[166],"for":[167],"files":[171],"networks.":[178],"Both":[179],"outperform":[184]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
