{"id":"https://openalex.org/W2912637539","doi":"https://doi.org/10.1137/1.9781611974782","title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","display_name":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2912637539","doi":"https://doi.org/10.1137/1.9781611974782","mag":"2912637539"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611974782","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611974782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},"type":"paratext","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/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Klein, Philip N.","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":null,"display_name":"Association for Computing Machinery","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Association for Computing Machinery","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":102,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.6539999842643738,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.6539999842643738,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6496999859809875,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5676000118255615,"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/computer-science","display_name":"Computer science","score":0.5346006751060486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4311055839061737}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5346006751060486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4311055839061737}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611974782","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611974782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},{"id":"pmh:oai:pure.atira.dk:publications/6a044eb7-a304-418d-b87f-485552459cb5","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/6a044eb7-a304-418d-b87f-485552459cb5","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Larsen, K G & Williams, R 2017, Faster Online Matrix-Vector Multiplication. in P N Klein (ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. vol. PRDA17, Society for Industrial and Applied Mathematics, pp. 2182-2189, 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Barcelona, Spain, 16/01/2017. https://doi.org/10.1137/1.9781611974782","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"We":[0,102,177],"consider":[1],"the":[2,42,47,152,207,218],"Online":[3],"Boolean":[4,18,24,43],"Matrix-Vector":[5],"Multiplication":[6],"(OMV)":[7],"problem":[8,58],"studied":[9],"by":[10],"Henzinger":[11,68],"et":[12,69],"al.":[13,70],"[STOC'15]:":[14],"given":[15],"an":[16,214],"nfin":[17],"matrix":[19],"M,":[20],"we":[21,127],"receive":[22],"n":[23,113],"vectors":[25],"v1;":[26],":":[27,28,29],";vn":[30],"one":[31],"at":[32],"a":[33,104,141,149,181,187],"time,":[34],"and":[35,174],"are":[36,59],"required":[37],"to":[38,92,143,147,160],"output":[39],"Mvi":[40],"(over":[41],"semiring)":[44],"before":[45],"seeing":[46,122],"vector":[48],"vi+1,":[49],"for":[50,56,80,82,97,108,135,192],"all":[51,83],"i.":[52],"Previous":[53],"known":[54],"algorithms":[55],"this":[57],"combinatorial,":[60],"running":[61,111],"in":[62,112,157],"O(n":[63,75],"<sup>3</sup>=log":[64],"<sup>2</sup>":[65],"n)":[66],"time.":[67,118],"conjecture":[71,89,220],"there":[72],"is":[73,90,206],"no":[74],"<sup>3</sup>-\u03f5":[76],")":[77],"time":[78,134,200],"algorithm":[79],"OMV,":[81,110],"e":[84],"&gt;":[85],"0;":[86],"their":[87],"OMV":[88,193,219],"shown":[91],"imply":[93],"strong":[94],"hardness":[95],"results":[96],"many":[98],"basic":[99],"dynamic":[100],"problems.":[101],"give":[103],"substantially":[105],"faster":[106,167],"method":[107,185],"computing":[109],"<sup>3</sup>=2W(":[114],"p":[115,124,131,198],"logn)":[116,125,132],"randomized":[117],"In":[119],"fact,":[120],"after":[121],"2w(":[123],"vectors,":[126],"already":[128],"achieve":[129],"n2=2W(":[130],"amortized":[133],"matrix-vector":[136,145],"multiplication.":[137,164],"Our":[138],"approach":[139],"gives":[140,186],"way":[142],"reduce":[144],"multiplication":[146],"solving":[148],"version":[150],"of":[151,183,217],"Orthogonal":[153],"Vectors":[154],"problem,":[155],"which":[156],"turn":[158],"reduces":[159],"\"small\"":[161],"algebraic":[162],"matrix-matrix":[163],"Applications":[165],"include":[166],"independent":[168],"set":[169],"detection,":[170],"partial":[171],"match":[172],"retrieval,":[173],"2-CNF":[175],"evaluation.":[176],"also":[178],"show":[179],"how":[180],"modification":[182],"our":[184],"cell":[188],"probe":[189],"data":[190],"structure":[191],"with":[194],"worst":[195],"case":[196],"O(n7=4=":[197],"w)":[199],"per":[201],"query":[202],"vector,":[203],"where":[204],"w":[205],"word":[208],"size.":[209],"This":[210],"result":[211],"rules":[212],"out":[213],"unconditional":[215],"proof":[216],"using":[221],"purely":[222],"information-theoretic":[223],"arguments.":[224]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":25},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":6}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2019-02-21T00:00:00"}