{"id":"https://openalex.org/W2143409244","doi":"https://doi.org/10.1109/ipps.1994.288278","title":"Sorting strings and constructing digital search trees in parallel","display_name":"Sorting strings and constructing digital search trees in parallel","publication_year":2002,"publication_date":"2002-12-17","ids":{"openalex":"https://openalex.org/W2143409244","doi":"https://doi.org/10.1109/ipps.1994.288278","mag":"2143409244"},"language":"en","primary_location":{"id":"doi:10.1109/ipps.1994.288278","doi":"https://doi.org/10.1109/ipps.1994.288278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1994.288278","pdf_url":null,"source":{"id":"https://openalex.org/S4306420034","display_name":"International Parallel Processing Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 8th International Parallel Processing Symposium","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5085648933","display_name":"Joseph F. J\u00e1J\u00e1","orcid":"https://orcid.org/0000-0002-8620-5650","observed_orcids":["https://orcid.org/0000-0002-8620-5650"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.F. Jaja","raw_affiliation_strings":["Department of Electrical Engineering Institute for Adv. Comp. Studies, Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering Institute for Adv. Comp. Studies, Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111973528","display_name":"Kwan Woo Ryu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["KR","US"],"is_corresponding":false,"raw_author_name":"Kwan Woo Ryu","raw_affiliation_strings":["Departrnent of Computer Engineering, Kyungpook National University, South Korea","Institute for Adv. Comp. Studies, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departrnent of Computer Engineering, Kyungpook National University, South Korea","institution_ids":["https://openalex.org/I31419693"]},{"raw_affiliation_string":"Institute for Adv. Comp. Studies, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674","observed_orcids":["https://orcid.org/0000-0003-0713-2674"]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"U. Vishkin","raw_affiliation_strings":["Department of Electrical Engineering Institute for Adv. Comp. Studies, University of Maryland, College Park, MD, USA","Tel-Aviv University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering Institute for Adv. Comp. Studies, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"349","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0007999999797903001,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0003000000142492354,"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/digital-search-trees","display_name":"digital search trees","score":0.9779999852180481},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.7039999961853027},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.7979999780654907},{"id":"https://openalex.org/keywords/deterministic-algorithms","display_name":"deterministic algorithms","score":0.8610000014305115},{"id":"https://openalex.org/keywords/crcw-pram","display_name":"CRCW PRAM","score":0.7799999713897705},{"id":"https://openalex.org/keywords/lexicographic-order","display_name":"lexicographic order","score":0.7260000109672546},{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.5220000147819519},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.46799999475479126}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6471834778785706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5598592758178711},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5514206290245056},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.550613522529602},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5417523980140686},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5160984396934509},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5155748724937439},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.495340496301651},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.43694111704826355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41706788539886475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38251757621765137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37955355644226074},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipps.1994.288278","doi":"https://doi.org/10.1109/ipps.1994.288278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1994.288278","pdf_url":null,"source":{"id":"https://openalex.org/S4306420034","display_name":"International Parallel Processing Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 8th International Parallel Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1508623823","https://openalex.org/W1655990431","https://openalex.org/W1969428672","https://openalex.org/W1978583881","https://openalex.org/W1981573606","https://openalex.org/W1983343295","https://openalex.org/W1992353663","https://openalex.org/W1995300673","https://openalex.org/W2003200876","https://openalex.org/W2027679733","https://openalex.org/W2033191517","https://openalex.org/W2034334221","https://openalex.org/W2047234016","https://openalex.org/W2048128011","https://openalex.org/W2050046996","https://openalex.org/W2069489095","https://openalex.org/W2076458424","https://openalex.org/W2086273045","https://openalex.org/W2090195984","https://openalex.org/W2092901467","https://openalex.org/W2093599904","https://openalex.org/W2120490947","https://openalex.org/W2134008688","https://openalex.org/W2622132947"],"related_works":["https://openalex.org/W7033038716","https://openalex.org/W2088124861","https://openalex.org/W7098223769","https://openalex.org/W1575639363","https://openalex.org/W1508623823","https://openalex.org/W3001187146","https://openalex.org/W3033427368","https://openalex.org/W2057697239","https://openalex.org/W7099020775","https://openalex.org/W2080516655"],"abstract_inverted_index":{"We":[0,176,206],"describe":[1],"two":[2],"simple":[3],"optimal-work":[4,179],"parallel":[5,73,98,162,180,209],"algorithms":[6,63,74,79,92,99,116,135,144,154,163,181,211],"for":[7,75,188,197],"sorting":[8,76,210],"a":[9,37,53,101,173,184,189,198,201,218,223],"list":[10,203],"/spl":[11,23,26,124,170],"Lscr/=(X/sub":[12],"1/,X/sub":[13],"2/,...,X/sub":[14],"m/)":[15],"of":[16,87,104,192,204,216,222],"m":[17],"strings":[18,193],"over":[19],"an":[20],"arbitrary":[21],"alphabet":[22,112,120],"Sigma/,":[24],"where":[25,169],"Sigmasub":[27],"i=1sup":[28],"mspl":[29],"verbar/X/sub":[30],"ispl":[31],"verbar/=n.":[32],"The":[33],"first":[34],"algorithm":[35,39,55],"is":[36,52,93,121,136,172],"deterministic":[38],"that":[40,56,118,145],"runs":[41,57],"in":[42,58,200],"O((log/sup":[43],"2/":[44],"m)/(log":[45],"log":[46,157],"m))":[47],"time":[48],"and":[49,151,194],"the":[50,70,78,81,84,91,111,114,119,129,134,137,142,147,152,208,214],"second":[51],"randomized":[54],"O(log":[59],"m)":[60],"time.":[61],"Both":[62],"use":[64,100,155,164,207],"O(m":[65,156],"log(m)+n)":[66],"operations.":[67],"Compared":[68],"to":[69,123,182,195,212,228],"best":[71],"known":[72,143],"strings,":[77],"offer":[80],"following":[82],"improvements:":[83],"total":[85],"number":[86,103],"operations":[88],"used":[89],"by":[90,133],"optimal":[94],"while":[95,113,160],"all":[96],"previous":[97,115,161],"non-optimal":[102],"operations;":[105],"we":[106],"make":[107],"no":[108],"assumption":[109],"about":[110],"assume":[117,146],"restricted":[122],"lcub/1,2,...,":[125],"n/sup":[126],"O(1/)/spl":[127],"rcub/;":[128],"computation":[130],"model":[131],"assumed":[132],"Common":[138],"CRCW":[139,149],"PRAM":[140],"unlike":[141],"Arbitrary":[148],"PRAM;":[150],"presented":[153],"m+n)":[158],"space,":[159,168],"O(n/sup":[165],"1+/spl":[166],"epsiv)":[167],"epsiv/":[171],"positive":[174],"constant.":[175],"also":[177],"present":[178],"construct":[183],"digital":[185],"search":[186,196],"tree":[187],"given":[190],"set":[191],"string":[199,225],"sorted":[202],"strings.":[205],"solve":[213],"problem":[215],"determining":[217],"minimal":[219],"starting":[220],"point":[221],"circular":[224],"with":[226],"respect":[227],"lexicographic":[229],"ordering.>":[230]},"counts_by_year":[],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}