{"id":"https://openalex.org/W2029465766","doi":"https://doi.org/10.1109/isit.2013.6620427","title":"Fundamental limits of identification: Identification rate, search and memory complexity trade-off","display_name":"Fundamental limits of identification: Identification rate, search and memory complexity trade-off","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2029465766","doi":"https://doi.org/10.1109/isit.2013.6620427","mag":"2029465766"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","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/A5035862183","display_name":"Farzad Farhadzadeh","orcid":"https://orcid.org/0000-0002-3969-2089"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Farzad Farhadzadeh","raw_affiliation_strings":["Department of Computer Science, University of Geneva, Geneva, Switzerland","Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Geneva, Geneva, Switzerland","institution_ids":["https://openalex.org/I114457229"]},{"raw_affiliation_string":"Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#","institution_ids":["https://openalex.org/I114457229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039843593","display_name":"F.M.J. Willems","orcid":"https://orcid.org/0000-0002-7316-3471"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frans M.J. Willems","raw_affiliation_strings":["Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, Netherlands","Dept. of Electr. Eng, Eindhoven Univ. of Technol., Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Dept. of Electr. Eng, Eindhoven Univ. of Technol., Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091506990","display_name":"Slava Voloshynovskiy","orcid":"https://orcid.org/0000-0003-0416-9674"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sviatoslav Voloshynovskiy","raw_affiliation_strings":["Department of Computer Science, University of Geneva, Geneva, Switzerland","Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Geneva, Geneva, Switzerland","institution_ids":["https://openalex.org/I114457229"]},{"raw_affiliation_string":"Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1453,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78799879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1252","last_page":"1256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9865999817848206,"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":0.9865999817848206,"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/T11106","display_name":"Data Management and Algorithms","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9758999943733215,"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/computer-science","display_name":"Computer science","score":0.7753539085388184},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.7522214651107788},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5777103304862976},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5683351159095764},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5590086579322815},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41668909788131714},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36815345287323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2806127071380615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1482757329940796}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7753539085388184},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.7522214651107788},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5777103304862976},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5683351159095764},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5590086579322815},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41668909788131714},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36815345287323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2806127071380615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1482757329940796},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/isit.2013.6620427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/e21330bd-9dca-4895-b954-c77d848efbea","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e21330bd-9dca-4895-b954-c77d848efbea","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Farhadzadeh, F, Willems, F M J & Voloshynovskiy, S 2013, Fundamental limits of identification : identification rate, search and memory complexity trade-off. in 2013 IEEE International Symposium on Information Theory (ISIT). Institute of Electrical and Electronics Engineers, Istanbul, Turkey, pp. 1252-1256. https://doi.org/10.1109/ISIT.2013.6620427","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:unige.ch:aou:unige:32007","is_oa":false,"landing_page_url":"https://archive-ouverte.unige.ch/unige:32007","pdf_url":null,"source":{"id":"https://openalex.org/S4306402259","display_name":"Archive ouverte UNIGE (University of Geneva)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114457229","host_organization_name":"University of Geneva","host_organization_lineage":["https://openalex.org/I114457229"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"2013 IEEE International Symposium on Information Theory (ISIT) (2013)\\n p. 1252-1256","raw_type":"info:eu-repo/semantics/bookPart"},{"id":"pmh:775300","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=775300","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.375.795","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cvml.unige.ch/publications/postscript/2013/isit_2013_submission_4th.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:775300","is_oa":false,"landing_page_url":"http://repository.tue.nl/775300","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:tue:oai:pure.tue.nl:publications/e21330bd-9dca-4895-b954-c77d848efbea","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e21330bd-9dca-4895-b954-c77d848efbea","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2013 IEEE International Symposium on Information Theory (ISIT), 1252 - 1256","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W83334756","https://openalex.org/W1541459201","https://openalex.org/W2038044292","https://openalex.org/W2095996258","https://openalex.org/W2104589614","https://openalex.org/W2109954355","https://openalex.org/W2127382990","https://openalex.org/W2146461393","https://openalex.org/W2150412388","https://openalex.org/W2155826369","https://openalex.org/W6603388714","https://openalex.org/W6632397832"],"related_works":["https://openalex.org/W2161474341","https://openalex.org/W4302615923","https://openalex.org/W3203142394","https://openalex.org/W2351061015","https://openalex.org/W4220731478","https://openalex.org/W1974101135","https://openalex.org/W2017509870","https://openalex.org/W4251141768","https://openalex.org/W2542937328","https://openalex.org/W2372764048"],"abstract_inverted_index":{"In":[0],"this":[1,29],"paper,":[2],"we":[3],"introduce":[4],"a":[5,33,42,45,83,106,131],"new":[6,132],"generalized":[7],"scheme":[8,115],"to":[9,44,88,98,104,129],"resolve":[10],"the":[11,14,54,67,80,89,110],"trade-off":[12],"between":[13],"identification":[15,23,121],"rate,":[16],"search":[17],"and":[18,49,69],"memory":[19,137],"complexities":[20],"in":[21,32,76,120],"large-scale":[22],"systems.":[24],"The":[25,71,113],"main":[26],"contribution":[27],"of":[28,41,47,63,66,85,101,135],"paper":[30],"consists":[31],"special":[34],"database":[35,43,68],"organization":[36],"based":[37,60],"on":[38,61],"assigning":[39],"entries":[40,65],"set":[46],"predefined":[48],"possibly":[50],"overlapping":[51],"clusters,":[52],"where":[53],"cluster":[55],"representative":[56],"points":[57],"are":[58,96],"generated":[59],"statistics":[62],"both":[64],"queries.":[70],"decoding":[72],"procedure":[73],"is":[74,91],"accomplished":[75],"two":[77],"stages:":[78],"At":[79],"first":[81],"stage,":[82],"list":[84],"clusters":[86,103],"related":[87],"query":[90],"estimated,":[92],"then":[93],"refinement":[94],"checks":[95],"performed":[97],"all":[99],"members":[100],"these":[102],"produce":[105],"unique":[107],"index":[108],"at":[109],"second":[111],"stage.":[112],"proposed":[114],"generalizes":[116],"several":[117],"practical":[118],"searching":[119],"systems":[122],"as":[123,125],"well":[124],"makes":[126],"it":[127],"possible":[128],"approach":[130],"achievable":[133],"region":[134],"search-":[136],"complexity":[138],"trade-off.":[139]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}