{"id":"https://openalex.org/W190961617","doi":null,"title":"A Fast Natural Algorithm for Searching: Preliminary version","display_name":"A Fast Natural Algorithm for Searching: Preliminary version","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W190961617","mag":"190961617"},"language":"en","primary_location":{"id":"mag:190961617","doi":null,"is_oa":false,"landing_page_url":"http://delab.csd.auth.gr/~bci1/SEEFM03/seefm03_15.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"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/A5035882410","display_name":"Joshua J. Arulanandham","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Joshua J. Arulanandham","raw_affiliation_strings":["University of AUCKLAND"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of AUCKLAND","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079186295","display_name":"Cristian S. Calude","orcid":"https://orcid.org/0000-0002-8711-6799","observed_orcids":["https://orcid.org/0000-0002-8711-6799"]},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Cristian S. Calude","raw_affiliation_strings":["University of AUCKLAND"],"raw_orcid":"https://orcid.org/0000-0002-8711-6799","affiliations":[{"raw_affiliation_string":"University of AUCKLAND","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083519582","display_name":"Michael J. Dinneen","orcid":"https://orcid.org/0000-0001-9977-525X","observed_orcids":["https://orcid.org/0000-0001-9977-525X"]},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Michael J. Dinneen","raw_affiliation_strings":["University of AUCKLAND"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of AUCKLAND","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154130895"],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6273999810218811,"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.6273999810218811,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.22840000689029694,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.0689999982714653,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"sorting","score":0.47099998593330383},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.699999988079071},{"id":"https://openalex.org/keywords/deterministic-algorithms","display_name":"deterministic algorithms","score":0.6359999775886536}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6225957870483398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6061540246009827},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.5569049119949341},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5408696532249451},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5344981551170349},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5286581516265869},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5030423998832703},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.4106512665748596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3621026277542114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3228178024291992},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17662885785102844},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:190961617","doi":null,"is_oa":false,"landing_page_url":"http://delab.csd.auth.gr/~bci1/SEEFM03/seefm03_15.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W82042501","https://openalex.org/W1537406203","https://openalex.org/W2084652510"],"related_works":["https://openalex.org/W7097352478","https://openalex.org/W4206384881","https://openalex.org/W2154014559","https://openalex.org/W2953459320","https://openalex.org/W7098865041","https://openalex.org/W7096818259","https://openalex.org/W7764891","https://openalex.org/W1947120330","https://openalex.org/W7214760044","https://openalex.org/W168750380"],"abstract_inverted_index":{"In":[0],"this":[1,83],"note":[2],"we":[3],"present":[4],"two":[5],"natural":[6],"algorithms\u2014one":[7],"for":[8,12,53],"sorting":[9],"and":[10],"another":[11],"searching":[13],"a":[14],"sorted":[15],"list":[16,44],"of":[17,32,37],"items.":[18],"Both":[19],"algorithms":[20,39],"work":[21],"in":[22,45,66],"O(":[23,46],"\u221a":[24,47],"N":[25,28,48],")":[26,49],"time,":[27,50],"being":[29],"the":[30,33],"size":[31],"list.":[34],"A":[35],"combination":[36],"these":[38],"can":[40],"search":[41,64],"an":[42,51],"unsorted":[43],"impossibility":[52],"classical":[54],"algorithms.":[55],"The":[56],"same":[57],"complexity":[58],"is":[59,72,76],"achieved":[60],"by":[61],"Grover's":[62,69],"quantum":[63],"algorithm;":[65],"contrast":[67],"to":[68],"algorithm":[70],"which":[71],"probabilistic,":[73],"our":[74],"method":[75],"guaranteed":[77],"correct.":[78],"Two":[79],"applications":[80],"will":[81],"conclude":[82],"note.":[84]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}