{"id":"https://openalex.org/W3035443347","doi":"https://doi.org/10.1145/3357713.3384311","title":"A polynomial lower bound on adaptive complexity of submodular maximization","display_name":"A polynomial lower bound on adaptive complexity of submodular maximization","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035443347","doi":"https://doi.org/10.1145/3357713.3384311","mag":"3035443347"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384311","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/A5101412259","display_name":"Wenzheng Li","orcid":"https://orcid.org/0009-0008-4536-8948"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wenzheng Li","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101725949","display_name":"Paul Liu","orcid":"https://orcid.org/0000-0002-9386-6609"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Liu","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003968234","display_name":"J. Vondr\u00e1k","orcid":"https://orcid.org/0000-0002-4674-0771"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Vondr\u00e1k","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10237","display_name":"Cryptography and Data Security","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9278627038002014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6989517211914062},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6377868056297302},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5788448452949524},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5456519722938538},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49549925327301025},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45901811122894287},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45878106355667114},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4256367087364197},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4184448719024658},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4114200472831726},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3649974763393402},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3229597806930542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2659890353679657},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.12869128584861755}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9278627038002014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6989517211914062},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6377868056297302},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5788448452949524},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5456519722938538},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49549925327301025},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45901811122894287},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45878106355667114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4256367087364197},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4184448719024658},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4114200472831726},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3649974763393402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3229597806930542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2659890353679657},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.12869128584861755},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":1,"locations":[{"id":"doi:10.1145/3357713.3384311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384311","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1965765215","https://openalex.org/W1997959284","https://openalex.org/W2038938388","https://openalex.org/W2053381548","https://openalex.org/W2089729462","https://openalex.org/W2143996311","https://openalex.org/W2177862760","https://openalex.org/W2179494254","https://openalex.org/W2500139799","https://openalex.org/W2560674852","https://openalex.org/W2797074460","https://openalex.org/W2809318113","https://openalex.org/W2883693373","https://openalex.org/W2890891613","https://openalex.org/W2895443120","https://openalex.org/W2952567852","https://openalex.org/W2953374984","https://openalex.org/W2962908181","https://openalex.org/W2963059222","https://openalex.org/W2963268806","https://openalex.org/W2963829849","https://openalex.org/W4247950230"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W961142965","https://openalex.org/W1774334694"],"abstract_inverted_index":{"In":[0,15],"large-data":[1],"applications,":[2],"it":[3],"is":[4],"desirable":[5],"to":[6,46],"design":[7],"algorithms":[8],"with":[9],"a":[10,25,47,63],"high":[11],"degree":[12],"of":[13,18,28],"parallelization.":[14],"the":[16,34],"context":[17],"submodular":[19],"optimization,":[20],"adaptive":[21,35],"complexity":[22],"has":[23],"become":[24],"widely-used":[26],"measure":[27],"an":[29],"algorithm's":[30],"\"sequentiality\".":[31],"Algorithms":[32],"in":[33,38,50,55,72],"model":[36],"proceed":[37],"rounds,":[39],"and":[40],"can":[41],"issue":[42],"polynomially":[43],"many":[44],"queries":[45,54],"function":[48],"f":[49],"each":[51,56],"round.":[52],"The":[53],"round":[57],"must":[58],"be":[59],"independent,":[60],"produced":[61],"by":[62],"computation":[64],"that":[65],"depends":[66],"only":[67],"on":[68],"query":[69],"results":[70],"obtained":[71],"previous":[73],"rounds.":[74]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}