{"id":"https://openalex.org/W2000484009","doi":"https://doi.org/10.5555/314161.314321","title":"Fast algorithms for sorting and searching strings","display_name":"Fast algorithms for sorting and searching strings","publication_year":1997,"publication_date":"1997-01-05","ids":{"openalex":"https://openalex.org/W2000484009","doi":"https://doi.org/10.5555/314161.314321","mag":"2000484009"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.5506","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~rs/strings/paper.ps","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5109990155","display_name":"Jon Louis Bentley","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4387152956","display_name":"Alcatel-Lucent (France)","ror":"https://ror.org/024850w61","country_code":"FR","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210149358","https://openalex.org/I4387152956"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jon Bentley","raw_affiliation_strings":["Bell Labs, Lucent Technologies, 700 Mountain Avenue, Murray Hill., NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs, Lucent Technologies, 700 Mountain Avenue, Murray Hill., NJ#TAB#","institution_ids":["https://openalex.org/I4387152956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077370067","display_name":"Robert Sedgewick","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Sedgewick","raw_affiliation_strings":["Princeton Univ., Princeton , NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.3342,"has_fulltext":false,"cited_by_count":402,"citation_normalized_percentile":{"value":0.98488744,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"360","last_page":"369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0,"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.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/string-sorting","display_name":"string sorting","score":0.7300000190734863},{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.722000002861023},{"id":"https://openalex.org/keywords/quicksort","display_name":"quicksort","score":0.7870000004768372},{"id":"https://openalex.org/keywords/radix-sort","display_name":"radix sort","score":0.9890000224113464},{"id":"https://openalex.org/keywords/tries","display_name":"tries","score":0.925000011920929},{"id":"https://openalex.org/keywords/binary-search-trees","display_name":"binary search trees","score":0.9990000128746033}],"concepts":[{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.7821122407913208},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7648054957389832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7488009929656982},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.663447916507721},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5974583625793457},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.566463828086853},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.553707480430603},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5450859069824219},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.515995979309082},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.466480553150177},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4595860540866852},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.43846067786216736},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43249592185020447},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4268152117729187},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.41892093420028687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19131571054458618},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.08457201719284058},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.5506","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~rs/strings/paper.ps","raw_type":"text"},{"id":"mag:2000484009","doi":"https://doi.org/10.5555/314161.314321","is_oa":false,"landing_page_url":"https://www.cs.princeton.edu/~rs/strings/paper.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W41435888","https://openalex.org/W85177704","https://openalex.org/W1499824048","https://openalex.org/W1526131532","https://openalex.org/W1554988973","https://openalex.org/W1976776761","https://openalex.org/W1981177980","https://openalex.org/W1989640573","https://openalex.org/W2000538582","https://openalex.org/W2010816129","https://openalex.org/W2014771275","https://openalex.org/W2016701389","https://openalex.org/W2040046786","https://openalex.org/W2044792517","https://openalex.org/W2053767428","https://openalex.org/W2067719424","https://openalex.org/W2103953153","https://openalex.org/W2125532313","https://openalex.org/W2130055503","https://openalex.org/W2137661354","https://openalex.org/W2149468555","https://openalex.org/W2155631901","https://openalex.org/W2157718155","https://openalex.org/W2158874082","https://openalex.org/W2273959428","https://openalex.org/W2752853835","https://openalex.org/W2987803397","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W3198160809","https://openalex.org/W2752853835","https://openalex.org/W2161488606","https://openalex.org/W2158874082","https://openalex.org/W2121252285","https://openalex.org/W2533248932","https://openalex.org/W2337480916","https://openalex.org/W2157718155","https://openalex.org/W2130564474","https://openalex.org/W2149468555","https://openalex.org/W2058822978","https://openalex.org/W2087721273","https://openalex.org/W2076747312","https://openalex.org/W1875619160","https://openalex.org/W2155512447","https://openalex.org/W2289119746","https://openalex.org/W100509257","https://openalex.org/W1990061958","https://openalex.org/W2434820933","https://openalex.org/W1997688397"],"abstract_inverted_index":{"We":[0,83,109],"present":[1,85],"theoretical":[2],"algorithms":[3,68,124],"for":[4,17],"sorting":[5,26],"and":[6,10,30,48,57,105,117,125],"searching":[7,44],"multikey":[8,123],"data,":[9],"derive":[11],"from":[12],"them":[13],"practical":[14,78],"C":[15,40],"implementations":[16],"applications":[18],"in":[19,130],"which":[20],"keys":[21],"are":[22,128],"character":[23],"strings.":[24],"The":[25,43,63,122],"algorithm":[27,45],"blends":[28,46],"Quicksort":[29,104,134],"radix":[31],"sort;":[32],"it":[33,52,148],"is":[34,53],"competitive":[35],"with":[36,141],"the":[37,67,74,115],"best":[38],"known":[39],"sort":[41],"codes.":[42],"tries":[47],"binary":[49,106],"search":[50,61,107],"trees;":[51],"faster":[54],"than":[55],"hashing":[56],"other":[58,119],"commonly":[59],"used":[60],"methods.":[62],"basic":[64,120],"ideas":[65],"behind":[66],"date":[69],"back":[70],"at":[71],"least":[72],"to":[73,87],"1960s,":[75],"but":[76],"their":[77],"utility":[79],"has":[80],"been":[81],"overlooked.":[82],"also":[84],"extensions":[86],"more":[88],"complex":[89],"string":[90],"problems,":[91],"such":[92],"as":[93],"partial-match":[94],"searching.":[95],"1.":[96],"Introduction":[97],"Section":[98,131],"2":[99],"briefly":[100],"reviews":[101],"Hoare's":[102],"[9]":[103],"trees.":[108],"emphasize":[110],"a":[111,136],"well-known":[112],"isomorphism":[113],"relating":[114],"two,":[116],"summarize":[118],"facts.":[121],"data":[126],"structures":[127],"presented":[129],"3.":[132],"Multikey":[133],"orders":[135],"set":[137],"of":[138],"n":[139],"vectors":[140],"k":[142],"components":[143],"each.":[144],"Like":[145],"regular":[146],"Quicksort,":[147],"partitions":[149],"its":[150],"input":[151],"into...":[152]},"counts_by_year":[{"year":2025,"cited_by_count":36},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":14}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}