{"id":"https://openalex.org/W3035235962","doi":"https://doi.org/10.1145/3357713.3384341","title":"Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits","display_name":"Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035235962","doi":"https://doi.org/10.1145/3357713.3384341","mag":"3035235962"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384341","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","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/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100337687","display_name":"Chen Wang","orcid":"https://orcid.org/0000-0003-4044-9438"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen Wang","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":1.4683,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83212077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1237","last_page":"1250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/coin-flipping","display_name":"Coin flipping","score":0.9636111259460449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7008482217788696},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6412075757980347},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5957339406013489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5000901222229004},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.4761105477809906},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.4259689748287201},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3892343044281006},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3864988386631012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21165558695793152},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07411980628967285},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07103118300437927}],"concepts":[{"id":"https://openalex.org/C97399411","wikidata":"https://www.wikidata.org/wiki/Q825367","display_name":"Coin flipping","level":2,"score":0.9636111259460449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7008482217788696},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6412075757980347},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5957339406013489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5000901222229004},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.4761105477809906},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.4259689748287201},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3892343044281006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3864988386631012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21165558695793152},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07411980628967285},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07103118300437927},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357713.3384341","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11663518020004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/Exploration-with-limited-memory-streaming-algorithms/991031654454704646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1506859583","https://openalex.org/W1971077223","https://openalex.org/W1981313592","https://openalex.org/W1997959284","https://openalex.org/W1998498767","https://openalex.org/W2038435918","https://openalex.org/W2051834357","https://openalex.org/W2064379477","https://openalex.org/W2064710146","https://openalex.org/W2079317670","https://openalex.org/W2108794978","https://openalex.org/W2109498389","https://openalex.org/W2128020755","https://openalex.org/W2164545125","https://openalex.org/W2221311665","https://openalex.org/W2547059025","https://openalex.org/W2560674852","https://openalex.org/W2963554715","https://openalex.org/W2964047785","https://openalex.org/W2964305024","https://openalex.org/W3003196782","https://openalex.org/W3035235962","https://openalex.org/W4247950230","https://openalex.org/W4256417298","https://openalex.org/W4299828299"],"related_works":["https://openalex.org/W2607437843","https://openalex.org/W4295700147","https://openalex.org/W2963162727","https://openalex.org/W171213352","https://openalex.org/W2106714532","https://openalex.org/W4297979791","https://openalex.org/W4388675521","https://openalex.org/W2108135022","https://openalex.org/W3148810651","https://openalex.org/W2789077243"],"abstract_inverted_index":{"Consider":[0],"the":[1,17,50],"following":[2],"abstract":[3],"coin":[4,20,26,61],"tossing":[5],"problem:":[6],"Given":[7],"a":[8,22,30],"set":[9],"of":[10,25,33,60],"n":[11],"coins":[12],"with":[13,55],"unknown":[14],"biases,":[15],"find":[16],"most":[18],"biased":[19],"using":[21],"minimal":[23],"number":[24],"tosses.":[27],"This":[28],"is":[29],"common":[31],"abstraction":[32],"various":[34],"exploration":[35],"problems":[36],"in":[37],"theoretical":[38],"computer":[39],"science":[40],"and":[41,44],"machine":[42],"learning":[43],"has":[45],"been":[46,64],"studied":[47],"extensively":[48],"over":[49],"years.":[51],"In":[52],"particular,":[53],"algorithms":[54],"optimal":[56],"sample":[57],"complexity":[58],"(number":[59],"tosses)":[62],"have":[63],"known":[65],"for":[66,69],"this":[67],"problem":[68],"quite":[70],"some":[71],"time.":[72]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}