Show simple item record

dc.contributor.authorChatterjee, Krishnendu
dc.contributor.authorGoyal, Prateesh
dc.contributor.authorIbsen-Jensen, Rasmus
dc.contributor.authorPavlogiannis, Andreas
dc.date.accessioned2022-11-04T17:10:49Z
dc.date.available2022-11-04T17:10:49Z
dc.date.issued2019-11-13
dc.identifier.issn0164-0925
dc.identifier.urihttps://hdl.handle.net/1721.1/146153
dc.publisherACMen_US
dc.relation.isversionofhttps://doi.org/10.1145/3363525en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceACMen_US
dc.titleFaster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidthen_US
dc.typeArticleen_US
dc.identifier.citationChatterjee, Krishnendu, Goyal, Prateesh, Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas. 2019. "Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth." ACM Transactions on Programming Languages & Systems.
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.relation.journalACM Transactions on Programming Languages & Systemsen_US
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-11-02T21:50:49Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-02T21:50:50Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record