{"id":"https://openalex.org/W2111941176","doi":"https://doi.org/10.1109/tit.1978.1055968","title":"Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems","display_name":"Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems","publication_year":1978,"publication_date":"1978-11-01","ids":{"openalex":"https://openalex.org/W2111941176","doi":"https://doi.org/10.1109/tit.1978.1055968","mag":"2111941176"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1978.1055968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1978.1055968","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5078681192","display_name":"Bharath Chandrasekaran","orcid":"https://orcid.org/0000-0002-3673-9435"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Chandrasekaran","raw_affiliation_strings":["Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025099834","display_name":"K. Lakshmanan","orcid":null},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Lakshmanan","raw_affiliation_strings":["Computer Science Section, Wayne State University, Detroit, MI, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Section, Wayne State University, Detroit, MI, USA","institution_ids":["https://openalex.org/I185443292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078681192"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":2.6356,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.91532194,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"24","issue":"6","first_page":"755","last_page":"759"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9740999937057495,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9492999911308289,"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/automaton","display_name":"Automaton","score":0.7176189422607422},{"id":"https://openalex.org/keywords/bernoullis-principle","display_name":"Bernoulli's principle","score":0.5768865346908569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5280844569206238},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.515067994594574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48683375120162964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4489808976650238},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4204457402229309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3272690773010254}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7176189422607422},{"id":"https://openalex.org/C152361515","wikidata":"https://www.wikidata.org/wiki/Q181328","display_name":"Bernoulli's principle","level":2,"score":0.5768865346908569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5280844569206238},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.515067994594574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48683375120162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4489808976650238},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4204457402229309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3272690773010254},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1978.1055968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1978.1055968","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W139773673","https://openalex.org/W1969061574","https://openalex.org/W1971418757","https://openalex.org/W2087910444","https://openalex.org/W2111941176","https://openalex.org/W2166430806","https://openalex.org/W2805771469","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1619264321","https://openalex.org/W2899588557","https://openalex.org/W127357700","https://openalex.org/W1480528870","https://openalex.org/W2508541108","https://openalex.org/W2315419748","https://openalex.org/W2120954098","https://openalex.org/W1029445510","https://openalex.org/W4312340169","https://openalex.org/W1232590083"],"abstract_inverted_index":{"The":[0],"design":[1],"of":[2,34,50,62,68],"optimal,":[3],"time-invariant,":[4],"randomized,":[5],"finite-state":[6],"automata":[7,42,52],"for":[8,18],"<tex":[9,19,38],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[10,20,39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</tex>":[11],"-hypothesis":[12],"testing":[13],"is":[14,28,53],"an":[15,69],"open":[16],"problem":[17],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K":[21],"&gt;":[22],"2</tex>":[23],".":[24],"A":[25,48],"lower":[26],"bound":[27],"constructed":[29],"on":[30],"the":[31,66],"smallest":[32],"probability":[33],"error":[35],"achievable":[36],"by":[37],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</tex>":[40],"-state":[41],"solving":[43],"a":[44],"three-hypothesis":[45],"Bernoulli":[46],"problem.":[47],"class":[49],"close-to-optimal":[51],"exhibited":[54],"that":[55],"requires":[56],"at":[57],"most":[58],"one":[59],"extra":[60],"bit":[61],"memory":[63],"to":[64],"match":[65],"performnnce":[67],"optimal":[70],"automaton.":[71]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}