dc.contributor.author | Chatterjee, Krishnendu | |
dc.contributor.author | Goyal, Prateesh | |
dc.contributor.author | Ibsen-Jensen, Rasmus | |
dc.contributor.author | Pavlogiannis, Andreas | |
dc.date.accessioned | 2022-11-04T17:10:49Z | |
dc.date.available | 2022-11-04T17:10:49Z | |
dc.date.issued | 2019-11-13 | |
dc.identifier.issn | 0164-0925 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/146153 | |
dc.publisher | ACM | en_US |
dc.relation.isversionof | https://doi.org/10.1145/3363525 | en_US |
dc.rights | Article 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.source | ACM | en_US |
dc.title | Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Chatterjee, 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.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
dc.relation.journal | ACM Transactions on Programming Languages & Systems | en_US |
dc.identifier.mitlicense | PUBLISHER_POLICY | |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2022-11-02T21:50:49Z | |
dc.language.rfc3066 | en | |
dc.rights.holder | The author(s) | |
dspace.date.submission | 2022-11-02T21:50:50Z | |
mit.license | PUBLISHER_POLICY | |
mit.metadata.status | Authority Work and Publication Information Needed | en_US |