Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth

Thumbnail Image
Download
Name

3363525.pdf

Size

1.34 MB

Format

Adobe PDF

Checksum (MD5)

e1f2f6201d54d7b1d9a2112fd0bffff8

Download all files submitted through automated deposit
3363525.zip (917.89 KB)
Author(s)
Chatterjee, Krishnendu
•
Goyal, Prateesh
•
Ibsen-Jensen, Rasmus
•
Pavlogiannis, Andreas
Date Issued
November 13, 2019
Journal
ACM Transactions on Programming Languages & Systems
Publisher
ACM
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.
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
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.
Persistent DSpace Link
https://hdl.handle.net/1721.1/146153
DOI of Published Version
https://doi.org/10.1145/3363525
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.